Cryptology ePrint Archive: Report 2016/516

Boneh-Gentry-Hamburg's Identity-based Encryption Schemes Revisited

Ferucio Laurentiu Tiplea and George Teseleanu and Sorin Iftene and Anca-Maria Nica

Abstract: We revise Boneh-Gentry-Hamburg's identity-based encryption schemes and we show that we can renounce to the use of pseudo-random functions. We then prove IND-ID-CPA and ANON-IND-ID-CPA security of these schemes by showing that the advantage of any efficient adversary against these schemes is less than or equal to the quadratic residuosity advantage of some efficient adversary against the RSA generator. This greatly improves the existing upper bounds (being probably the tightest upper bound).

Category / Keywords: public-key cryptography / public-key cryptography, identity-based encryption

Date: received 26 May 2016

Contact author: ferucio tiplea at uaic ro

Available format(s): PDF | BibTeX Citation

Version: 20160529:210123 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]