Paper 2013/570

New Efficient Identity-Based Encryption From Factorization

Jun Shao, Licheng Wang, Xiaolei Dong, and Zhenfu Cao

Abstract

Identity Based Encryption (IBE) systems are often constructed using pairings or lattices. Three exceptions are due to Cocks in 2001, Boneh, Gentry and Hamburg in 2007, and Paterson and Srinivasan in 2009. The main goal of this paper to propose new IBE schemes, which may give a way to find IBEs without pairing or lattice. Essentially, the security of our IBE schemes is rooted in the intractability assumption of integer factorization. We believe that our constructions have some essential differences from all existing IBEs.

Metadata
Available format(s)
PDF
Publication info
Preprint. MINOR revision.
Keywords
Identity-based encryptionwithout pairingswithout lattices
Contact author(s)
zfcao @ cs sjtu edu cn
History
2013-09-11: last of 5 revisions
2013-09-09: received
See all versions
Short URL
https://ia.cr/2013/570
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/570,
      author = {Jun Shao and Licheng Wang and Xiaolei Dong and Zhenfu Cao},
      title = {New Efficient Identity-Based Encryption From Factorization},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/570},
      year = {2013},
      url = {https://eprint.iacr.org/2013/570}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.