Identity-based signcryption from lattices

Security and Communication Networks

Volumn 8, Issue 18, 2015, Pages 3751-3770

  Yan, Jianhua ^a,b   Wang, Licheng ^a   Dong, Mianxiong ^c   Yang, Yixian ^a   Yao, Wenbin ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^b LUDONG UNIVERSITY   (China)

^c NATIONAL INSTITUTE OF INFORMATION AND COMMUNICATIONS TECHNOLOGY   (Japan)

Author keywords

Lattice; Learning with errors; Learning with rounding; Short integer solution; Signcryption; Standard model

Indexed keywords

AUTHENTICATION; COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; NUMBER THEORY; QUANTUM COMPUTERS; QUANTUM CRYPTOGRAPHY;

INTEGER SOLUTIONS; LATTICE; LEARNING WITH ERRORS; LEARNING WITH ROUNDING; SIGNCRYPTION; STANDARD MODEL;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84937692362     PISSN: 19390114     EISSN: 19390122     Source Type: Journal    
DOI: 10.1002/sec.1297     Document Type: Article

References (40)

1. Shamir A. Identity-based cryptosystems and signature schemes. In Advances in Cryptology, Proceedings of CRYPTO '84, Santa Barbara, California, USA, August 19-22, 1984, Proceedings, vol. 196, Lecture Notes in Computer Science. Springer: Berlin Heidelberg, 1984; 47-53.
2. Zheng Y. Digital signcryption or how to achieve cost(signature & encryption) << cost(signature) + cost(encryption). In Advances in Cryptology-CRYPTO '97, 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 1997, Proceedings, vol. 1294, Lecture Notes in Computer Science. Springer: Berlin Heidelberg, 1997; 165-179.
3. Malone-Lee J, Mao W. Two birds one stone: signcryption using RSA. In Topics in Cryptology-CT-RSA 2003, vol. 2612, Joye M (ed), Lecture Notes in Computer Science, Springer: Berlin Heidelberg, 2003; 211-226.
4. Boyen X. Multipurpose identity-based signcryption-a Swiss army knife for identity-based cryptography. In Proceedings of CRYPTO 2003. Springer-Verlag: Berlin Heidelberg, 2003; 383-399.
5. Barreto P, Libert B, McCullagh N, Quisquater JJ. Efficient and provably-secure identity-based signatures and signcryption from bilinear maps. In Advances in Cryptology-ASIACRYPT 2005, vol. 3788, Roy B (ed), Lecture Notes in Computer Science, Springer: Berlin Heidelberg, 2005; 515-532.
6. Yan J, Wang L, Wang L, Yang Y, Yao W. Efficient lattice-based signcryption in standard model. Mathematical Problems in Engineering. 2013; 2013: 18, Article ID 702539, DOI: 10.1155/2013/702539.
7. Malone-Lee J. Identity-based signcryption. Cryptology ePrint Archive, 2002. http://eprint.iacr.org/2002/098.pdf.
8. Libert B, Quisquater JJ. A new identity-based signcryption scheme from pairings. 2003 IEEE Information Theory Workshop, 2003. Paris, France, Proceedings, 2003; 155-158. 10.1109/ITW.2003.1216718.
9. Boyen. Multipurpose identity-based signcryption: a Swiss army knife for identity-based cryptography. CRYPTO: Proceedings of Crypto, 2003.
10. Regev O. On lattices, learning with errors, random linear codes, and cryptography. In Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing, STOC '05. ACM: New York, NY, USA, 2005; 84-93.
11. Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC '08. ACM: New York, NY, USA, 2008; 197-206.
12. Peikert C. Public-key cryptosystems from the worst-case shortest vector problem. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing. ACM: New York, 2009; 333-342.
13. Peikert C, Waters B. Lossy trapdoor functions and their applications. SIAM Journal on Computing. 2011; 40(6): 1803-1844.
14. Lyubashevsky V. Lattice signatures without trapdoors. In Advances in Cryptology C EUROCRYPT 2012, vol. 7237 Pointcheval D, Johansson T (eds), Lecture Notes in Computer Science. Springer: Berlin Heidelberg, 2012; 738-755.
15. Ducas L, Durmus A, Lepoint T, Lyubashevsky V. Lattice signatures and bimodal Gaussians. In Advances in Cryptology C CRYPTO 2013, vol. 8042, Canetti R, Garay J (eds), Lecture Notes in Computer Science, Springer: Berlin Heidelberg, 2013; 40-56.
16. Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from (standard) LWE. In Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science FOCS '11, IEEE Computer Society: Washington, DC, USA, 2011; 97-106.
17. Brakerski Z, Gentry C, Vaikuntanathan V. Fully homomorphic encryption without bootstrapping. Electronic Colloquium on Computational Complexity (ECCC). 2011; 18: 111-111.
18. Brakerski Z. Fully homomorphic encryption without modulus switching from classical GapSVP. In Advances in Cryptology C CRYPTO 2012, vol. 7417, Safavi-Naini R, Canetti R (eds), Lecture Notes in Computer Science, Springer: Berlin Heidelberg, 2012; 868-886.
19. Gentry C, Sahai A, Waters B. Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In Advances in Cryptology C CRYPTO 2013, vol. 8042, Canetti R, Garay J (eds), Lecture Notes in Computer Science. Springer: Berlin Heidelberg, 2013; 75-92.
20. Agrawal S, Freeman D, Vaikuntanathan V. Functional encryption for inner product predicates from learning with errors. In Advances in Cryptology C ASIACRYPT 2011, vol. 7073, Lee D, Wang X (eds), Lecture Notes in Computer Science. Springer: Berlin Heidelberg, 2011; 21-40.
21. Gorbunov S, Vaikuntanathan V, Wee H. Attribute-based encryption for circuits. In Proceedings of the 45th Annual ACM Symposium on Symposium on Theory of Computing, STOC '13. ACM: New York, NY, USA, 2013; 545-554.
22. Agrawal S, Boneh D, Boyen X. Efficient lattice (H)IBE in the standard model. In Advances in Cryptology C EUROCRYPT 2010, vol. 6110, Gilbert H (ed), Lecture Notes in Computer Science. Springer: Berlin Heidelberg, 2010; 553-572.
23. Boyen X. Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more. In Public Key Cryptography C PKC 2010, vol. 6056, Nguyen P, Pointcheval D (eds), Lecture Notes in Computer Science. Springer: Berlin Heidelberg, 2010; 499-517.
24. Waters B. Efficient identity-based encryption without random oracles. In Advances in Cryptology C EUROCRYPT 2005, vol. 3494, Cramer R (ed), Lecture Notes in Computer Science. Springer: Berlin Heidelberg, 2005; 114-127.
25. Canetti R, Halevi S, Katz J. Chosen-ciphertext security from identity-based encryption. In Advances in Cryptology-EUROCRYPT'2004, vol. 3027, Cachin C, Camenisch J (eds), Lecture Notes in Computer Science. Springer: Berlin, 2004; 207-222.
26. Boneh D, Canetti R, Halevi S, Katz J. Chosen-ciphertext security from identity-based encryption. SIAM Journal of Computing. 2006; 36(5): 1301-1328.
27. Micciancio D, Goldwasser S. Complexity of Lattice Problems: A Cryptographic Perspective, Vol. 671. Springer: Berlin Heidelberg, 2002.
28. Alwen J, Krenn S, Pietrzak K, Wichs D. Learning with rounding, revisited. In Advances in Cryptology C CRYPTO 2013, vol. 8042, Canetti R, Garay J (eds), Lecture Notes in Computer Science, Springer: Berlin Heidelberg, 2013; 57-74.
29. Micciancio D, Regev O. Worst-case to average-case reductions based on Gaussian measure. SIAM Journal on Computing. 2007; 37(1): 267-302. 10.1137/S0097539705447360. Preliminary version in FOCS 2004.
30. Alwen J, Peikert C. Generating shorter bases for hard random lattices. Theory of Computing Systems. 2011; 48: 535-553.
31. Krawczyk H, Rabin T. Chameleon hashing and signatures. IACR Eprint archive, 1998. http: //eprint.iacr.org/1998/010, appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive. talr@watson.ibm.com 10500 received March 17th, 1998.
32. Cash D, Hofheinz D, Kiltz E, Peikert C. Bonsai trees, or how to delegate a lattice basis. Journal of Cryptology. 2012; 25: 601-639.
33. Dent A. Hybrid signcryption schemes with insider security. In Information Security and Privacy, vol. 3574, Lecture Notes in Computer Science Springer: Berlin Heidelberg, 2005; 253-266.
34. Chen L, Malone-Lee J. Improved identity-based signcryption. In Public Key Cryptography-PKC 2005, vol. 3386, Vaudenay S (ed), Lecture Notes in Computer Science. Springer: Berlin Heidelberg, 2005; 362-379.
35. Banerjee A, Peikert C, Rosen A. Pseudorandom functions and lattices. In Advances in Cryptology C EUROCRYPT 2012, vol. 7237, Pointcheval D, Johansson T (eds), Lecture Notes in Computer Science. Springer: Berlin Heidelberg, 2012; 719-737.
36. Aharonov D, Regev O. Lattice problems in NP insert CONP. Journal of the ACM. 2005; 52(5): 749-765.
37. Shoup V. A Computational Introduction to Number Theory and Algebra, vol. 2nd edn. Cambridge University Press: Cambridge, 2008.
38. Lindner R, Peikert C. Better key sizes (and attacks) for LWE-based encryption. In In CT-RSA: San Francisco, CA, USA, 2011; 319-339.
39. Boneh D, Katz J. Improved efficiency for CCA-secure cryptosystems built using identity-based encryption. In Topics in Cryptology C CT-RSA 2005, vol. 3376, Menezes A (ed), Lecture Notes in Computer Science. Springer: Berlin Heidelberg, 2005; 87-103.
40. Malone-Lee J. Identity-based signcryption. IACR Cryptology ePrint Archive. 2002; 2002: 98.