Lattice-based linearly homomorphic signatures in the standard model

Theoretical Computer Science

Volumn 634, Issue , 2016, Pages 47-54

  Chen, Wenbin ^a   Lei, Hao ^b   Qi, Ke ^a  

^a GUANGZHOU UNIVERSITY   (China)

^b HUAWEI TECHNOLOGIES CO LTD   (China)

Author keywords

Lattice; Linearly homomorphic signature

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE;

DIFFIE-HELLMAN ASSUMPTION; LATTICE; LATTICE-BASED; LINEARLY HOMOMORPHIC SIGNATURE; RSA ASSUMPTION; THE STANDARD MODEL;

NETWORK SECURITY;

EID: 84964344073     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2016.04.009     Document Type: Article

References (19)

1. Ajtai M. Generating hard instances of lattice problems. STOC 1996, 99-108. extended abstract, ACM.
2. Ajtai M. Generating hard instances of the short basis problem. Lecture Notes in Comput. Sci. 1999, vol. 1644:1-9. Springer. J. Wiedermann, P. van Emde Boas, M. Nielsen (Eds.).
3. Alwen J., Peikert C. Generating shorter bases for hard random lattices. STACS 2009, 75-86. Full version available at. http://www.cc.gatech.edu/~cpeikert/pubs/shorter.pdf.
4. Attrapadung N., Libert B. Homomorphic network coding signatures in the standard model. Lecture Notes in Comput. Sci. Mar. 2011, vol. 6571:17-34. Springer. D. Catalano, N. Fazio, R. Gennaro, A. Nicolosi (Eds.).
5. Boneh D., Freeman D.M. Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. Lecture Notes in Comput. Sci. Mar. 2011, vol. 6571:1-16. Springer. D. Catalano, N. Fazio, R. Gennaro, A. Nicolosi (Eds.).
6. Boneh D., Freeman D.M. Homomorphic signatures for polynomial functions. Lecture Notes in Comput. Sci. May 2011, vol. 6632:149-168. Springer. K.G. Paterson (Ed.).
7. Boneh D., Freeman D., Katz J., Waters B. Signing a linear subspace: signature schemes for network coding. Lecture Notes in Comput. Sci. Mar. 2009, vol. 5443:68-87. Springer. S. Jarecki, G. Tsudik (Eds.).
8. D. Catalano, D. Fiore, B. Warinschi, Efficient network coding signatures in the standard model, in: Fischlin et al. [11], pp. 680-696.
9. Catalano Dario, Fiore Dario, Warinschi Bogdan Adaptive pseudo-free groups and applications. Lecture Notes in Comput. Sci. 2011, vol. 6632:207-223. Springer, Berlin, Germany. K.G. Paterson (Ed.).
10. Cash David, Hofheinz Dennis, Kiltz Eike, Peikert Chris Bonsai tree, or how to delegate a lattice basis. EUROCRYPT 2010 2010, 523-552.
11. Public Key Cryptography - PKC 2012 - Proceedings of the 15th International Conference on Practice and Theory in Public Key Cryptography. Lecture Notes in Comput. Sci. 2012, vol. 7293. Springer. M. Fischlin, J. Buchmann, M. Manulis (Eds.).
12. D.M. Freeman, Improved security for linearly homomorphic signatures: a generic framework, in: Fischlin et al. [11], pp. 697-714.
13. Gennaro R., Katz J., Krawczyk H., Rabin T. Secure network coding over the integers. Lecture Notes in Comput. Sci. May 2010, vol. 6056:142-160. Springer. P.Q. Nguyen, D. Pointcheval (Eds.).
14. Gentry C., Peikert C., Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions. 40th ACM Symposium on Theory of Computing 2008, 197-206. ACM.
15. Johnson R., Molnar D., Song D.X., Wagner D. Homomorphic signature schemes. Lecture Notes in Comput. Sci. Feb. 2002, vol. 2271:244-262. Springer. B. Preneel (Ed.).
16. Lewko A.B., Waters B. New techniques for dual system encryption and fully secure HIBE with short ciphertexts. Lecture Notes in Comput. Sci. 2010, vol. 5978:455-479. Springer.
17. Micciancio D., Goldwasser S. Complexity of Lattice Problems: A Cryptographic Perspective. Kluwer Int. Ser. Eng. Comput. Sci. 2002, vol. 671. Kluwer Academic Publishers, Boston, Massachusetts.
18. Micciancio D., Regev O. Worst-case to average-case reductions based on Gaussian measures. The 45th Annual IEEE Symposium on Foundations of Computer Science 2004, 372-381. IEEE Computer Society, Washington, DC, USA.
19. Rückert Markus Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles. Lecture Notes in Comput. Sci. 2010, vol. 6061:182-200.