Verifiable security of Boneh-Franklin identity-based encryption
From MaRDI portal
Recommendations
- Reconsideration on the Security of the Boneh-Franklin Identity-Based Encryption Scheme
- Information Security and Cryptology
- Automata, Languages and Programming
- Efficient Identity-Based Encryption with Tight Security Reduction
- A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
Cites work
- scientific article; zbMATH DE number 1341866 (Why is no real title available?)
- scientific article; zbMATH DE number 2086725 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- Automata, Languages and Programming
- Beyond provable security verifiable IND-CCA security of OAEP
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient indifferentiable hashing into ordinary elliptic curves
- Formal Certification of ElGamal Encryption
- Formal certification of code-based cryptographic proofs
- Identity-Based Encryption from the Weil Pairing
- Identity-based cryptosystems and signature schemes
- Programming language techniques for cryptographic proofs
- Short signatures from the Weil pairing
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
Cited in
(6)- Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme
- A Framework for Identity-Based Encryption with Almost Tight Security
- Reconsideration on the Security of the Boneh-Franklin Identity-Based Encryption Scheme
- Cryptography and Coding
- Automata, Languages and Programming
- On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham
This page was built for publication: Verifiable security of Boneh-Franklin identity-based encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092349)