Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Relations Among Notions of Security for Public-Key Encryption Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Secure Integration of Asymmetric and Symmetric Encryption Schemes
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Toward Hierarchical Identity-Based Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Hierarchical ID-Based Cryptography
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An Identity Based Encryption Scheme Based on Quadratic Residues
Proceedings of the 8th IMA International Conference on Cryptography and Coding
Certificate-based encryption and the certificate revocation problem
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Boneh-Franklin identity based encryption revisited
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Efficient Selective Identity-Based Encryption Without Random Oracles
Journal of Cryptology
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Identity-Based Encryptions with Tight Security Reductions to the BDH Problem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
| Hi-index | 0.00 |
The Boneh-Franklin identity-based encryption (BF-IBE) scheme [6] is well-known as a fully functional identity-based encryption (IBE) scheme. Recently, Galindo [13] pointed out a flaw in the original proof of the security of the BF-IBE scheme. He claims that its security can be fixed without changing both the scheme and the underlying assumption if the efficiency of the security reduction is sacrificed. This result would be bad news for many cryptographic schemes [1,7,10,15] that are based on the BF-IBE scheme because an inefficient security reduction would imply either the lower security level or the use of larger key sizes to attain a given security level. In this paper, we give a new proof of the security of the BF-IBE scheme, showing that it has a tighter security reduction than had been previously believed.