Verifiable Security of Boneh-Franklin Identity-Based Encryption

DOI10.1007/978-3-642-24316-5_7zbMath1298.94079OpenAlexW1843079611MaRDI QIDQ3092349

Gilles Barthe, Santiago Zanella Béguelin, Federico Olmedo

Publication date: 16 September 2011

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24316-5_7

zbMATH Keywords

pairing-based cryptographyidentity-based encryptionBilinear Diffie-Hellman problemBoneh-Franklin schemeCertiCryptverifiable security

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• Coq
• CertiCrypt

Cites Work

• Unnamed Item
• Unnamed Item
• Short signatures from the Weil pairing
• Identity-Based Cryptosystems and Signature Schemes
• Beyond Provable Security Verifiable IND-CCA Security of OAEP
• Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
• Formal Certification of ElGamal Encryption
• Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
• Identity-Based Encryption from the Weil Pairing
• Formal certification of code-based cryptographic proofs
• Advances in Cryptology – CRYPTO 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Automata, Languages and Programming
• Programming Language Techniques for Cryptographic Proofs

This page was built for publication: Verifiable Security of Boneh-Franklin Identity-Based Encryption