Anonymous IBE from Quadratic Residuosity with Improved Performance
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.
KeywordsIdentity Based Encryption Anonymous IBE Cocks Scheme Quadratic Residuosity
Unable to display preview. Download preview PDF.
- 1.Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) Advances in Cryptology CRYPTO - 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)Google Scholar
- 4.Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC 2008: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 197–206. ACM, New York (2008)Google Scholar
- 10.Boneh, D., Gentry, C., Hamburg, M.: Space-efficient identity based encryption without pairings. In: FOCS, pp. 647–657. IEEE Computer Society (2007)Google Scholar
- 15.Barua, R., Jhanwar, M.: On the number of solutions of the equation rx 2 + sy 2 = 1 (mod n). Indian Journal of Statistical 2010 72-A (pt. 1), 226–236 (2010)Google Scholar