Fuzzy Certificateless Identity-Based Encryption Protocol from Lattice


Article Preview

Due to their conjectured resistance to quantum cryptanalysis, strong worst-case/average-case security guarantees, ease of implementation and increasing practicality, lattice-based cryptography is one of the hottest and fastest moving areas in mathematical cryptography today. In this paper, we give a fuzzy certificateless identity-based encryption scheme from lattice, whose security is based on the hardness of the Learning With Errors (LWE) problem. In the scheme, the user can choose his own secret key that the KGC cannot obtain, which is an efficient approach to mitigate the key escrow problem in fuzzy identity-based encryption scheme.



Edited by:

X.D. Yu




G. Y. Zhang "Fuzzy Certificateless Identity-Based Encryption Protocol from Lattice", Applied Mechanics and Materials, Vols. 380-384, pp. 2262-2266, 2013

Online since:

August 2013





[1] M. Ajtai. Generating hard instances of lattice problems (extended abstract). In STOC 1996, pages 99-108. ACM, (1996).

DOI: https://doi.org/10.1145/237814.237838

[2] Daniele Micciancio. Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. In FOCS, pages 356-365, (2002).

DOI: https://doi.org/10.1109/sfcs.2002.1181960

[3] Miklós Ajtai and Cynthia Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In STOC, pages 284-293, (1997).

DOI: https://doi.org/10.1145/258533.258604

[4] Oded Regev. On lattices, learning with errors, random linear codes, and cryptography. In STOC 2005, pages 84-93. ACM, (2005).

DOI: https://doi.org/10.1145/1060590.1060603

[5] Amit Sahai and Brent Waters. Fuzzy identity-based encryption. In EUROCRYPT, pages 457-473, (2005).

DOI: https://doi.org/10.1007/11426639_27

[6] Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan. Trapdoors for hard lattices and new cryptographic constructions. In STOC, pages 197-206. ACM, (2008).

DOI: https://doi.org/10.1145/1374376.1374407

[7] David Cash, Dennis Hofheinz, Eike Kiltz, and Chris Peikert. Bonsai trees or, how to delegate a lattice basis. In EUROCRYPT 2010, (2010).

DOI: https://doi.org/10.1007/978-3-642-13190-5_27

[8] Shweta Agrawal, Dan Boneh, and Xavier Boyen. Efficient lattice (H)IBE in the standard model. In Advances in Cryptology-EUROCRYPT 2010, volume 6110 of LNCS, pages 553-572. Springer, (2010).

DOI: https://doi.org/10.1007/978-3-642-13190-5_28

[9] Shweta Agrawal, Dan Boneh, and Xavier Boyen. Lattice basis delegation in fixed dimensionand shorter-ciphertext hierarchical IBE. In Advances in Cryptology-CRYPTO 2010, volume6223 of LNCS, pages 98-115. Springer, (2010).

DOI: https://doi.org/10.1007/978-3-642-14623-7_6

[10] Craig Gentry. Fully homomorphic encryption using ideal lattices. In STOC, pages 169-178, (2009).

DOI: https://doi.org/10.1145/1536414.1536440

[11] Craig Gentry. Toward basing fully homomorphic encryption on worst-case hardness. In CRYPTO, pages 116-137, (2010).

DOI: https://doi.org/10.1007/978-3-642-14623-7_7

[12] Zvika Brakerski and Vinod Vaikuntanathan. Fully homomorphic encryption from ring-LWE and security for key dependent messages. In CRYPTO 2011, (2011).

DOI: https://doi.org/10.1007/978-3-642-22792-9_29

[13] Chris Peikert. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In STOC 2009, pages 333-342. ACM, (2009).

DOI: https://doi.org/10.1145/1536414.1536461

[14] Sattam S. Al-Riyami, Kenneth G. Paterson. Certificateless public key cryptography. In: ASIACRYPT, Chi-Sung Laih, editor, 2003, volume 2894 of Lecture Notes in Computer Science, pages 452-473.

DOI: https://doi.org/10.1007/978-3-540-40061-5_29

Fetching data from Crossref.
This may take some time to load.