Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
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
SIAM Journal on Computing
On the Exact Security of Full Domain Hash
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st 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
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Tag-KEM/DEM: a new framework for hybrid encryption and a new analysis of kurosawa-desmedt KEM
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Efficient Identity-Based Encryption with Tight Security Reduction
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient identity-based encryption with tight security reduction
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
| Hi-index | 0.00 |
Concrete security reduction plays an important role in practice, because it explicitly bounds an adversary’s success probability as a function of their resources. In this paper, we study the security reductions of Boneh-Franklin identity based encryption (IBE) schemes and its variants, focusing on the efficiency of their security reductions: Improvements on proofs of Boneh-Franklin IBE and variants. The proof of the Boneh-Franklin IBE (BF-IBE) scheme was long believed to be correct until recently, Galindo pointed out a flawed step in the proof and gave a new proof, however, the new reduction was even looser. We give a new proof of the BF-IBE scheme that essentially improves previously known results. Very interestingly, our result is even better than the original underestimated one. Similar analysis can also be applied to Galindo’s BF-IBE variant, resulting in a tighter reduction. A new BF-IBE variant with tighter security reductions. We propose another variant of the BF-IBE that admits better security reduction, however, the scheme relies on a stronger assumption, namely the Gap Bilinear Diffie-Hellman (GBDH) assumption.