Paper 2014/778

Anonymous IBE from Quadratic Residuosity with Improved Performance

Michael Clear, Hitesh Tewari, and Ciarán McGoldrick


Identity Based Encryption (IBE) has been constructed from bilinear pairings, lattices and quadratic residuosity. The latter is an attractive basis for an IBE owing to the fact that it is a well-understood hard problem from number theory. Cocks constructed the first such scheme, and subsequent improvements have been made to achieve anonymity and improve space efficiency. However, the anonymous variants of Cocks' scheme thus far are all less efficient than the original. In this paper, we present a new universally-anonymous IBE scheme based on the quadratic residuosity problem. Our scheme has better performance than the universally anonymous scheme from Ateniese and Gasti (CT-RSA 2009) at the expense of more ciphertext expansion. Another contribution of this paper is a modification to a variant of the space-efficient scheme by Boneh, Gentry and Hamburg (FOCS 07) that results in an IND-ID-CPA secure IBE scheme with comparable efficiency to Cocks, but with reduced ciphertext expansion.

Note: Minor extension to Africacrypt 2014 paper.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. MINOR revision.Africacrypt 2014
Anonymous IBECocksQuadratic Residuosity
Contact author(s)
clearm @ scss tcd ie
2014-10-05: received
Short URL
Creative Commons Attribution


      author = {Michael Clear and Hitesh Tewari and Ciarán McGoldrick},
      title = {Anonymous IBE from Quadratic Residuosity with Improved Performance},
      howpublished = {Cryptology ePrint Archive, Paper 2014/778},
      year = {2014},
      doi = {10.1007/978-3-319-06734-6_23},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.