Space-Efficient Identity Based Encryption Without Pairings

Dan Boneh; Craig Gentry; Michael Hamburg

Paper 2007/177

Space-Efficient Identity Based Encryption Without Pairings

Dan Boneh, Craig Gentry, and Michael Hamburg

Abstract

Identity Based Encryption (IBE) systems are often constructed using bilinear maps (a.k.a. pairings) on elliptic curves. One exception is an elegant system due to Cocks which builds an IBE based on the quadratic residuosity problem modulo an RSA composite N. The Cocks system, however, produces long ciphertexts. Since the introduction of the Cocks system in 2001 it has been an open problem to construct a space efficient IBE system without pairings. In this paper we present an IBE system in which ciphertext size is short: an encryption of an L-bit message consists of a single element in Z_N plus L+1 additional bits. Security, as in the Cocks system, relies on the quadratic residuosity problem. The system is based on the theory of ternary quadratic forms and as a result, encryption and decryption are slower than in the Cocks system.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): dabo @ cs stanford edu
History: 2007-05-20: received
Short URL: https://ia.cr/2007/177
License: CC BY

BibTeX

@misc{cryptoeprint:2007/177,
      author = {Dan Boneh and Craig Gentry and Michael Hamburg},
      title = {Space-Efficient Identity Based Encryption Without Pairings},
      howpublished = {Cryptology ePrint Archive, Paper 2007/177},
      year = {2007},
      note = {\url{https://eprint.iacr.org/2007/177}},
      url = {https://eprint.iacr.org/2007/177}
}