Abstract
To design an efficient post-quantum linearly homomorphic signature scheme, using the pre-image sampling function, a lattice-based linearly homomorphic signature scheme over a binary field is proposed in this paper. Linear homomorphism is achieved through the homomorphism of the lattice-based hash function used in the proposed signature scheme. It is shown that the proposed scheme satisfies the privacy property. Based on the hardness of the short integer solution problem, the proposed scheme is unforgeable against the type 1 and type 2 adversaries in the random oracle model. Moreover, compared with a presented linearly homomorphic signature scheme in 2011, the proposed scheme has some advantages with respect to the public key size, signature length and computational cost.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Lyubashevsky V, Micciancio D. Asymptotically efficient lattice-based digital signatures. In: Proceedings of the TCC 2008, LNCS 4948. Berlin: Springer-Verlag, 2008. 37–54
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, British Columbia, 2008. 197–206
Cash D, Hofheinz D, Kiltz E, et al. Bonsai trees, or how to delegate a lattice basis. In: Proceedings of Eurocrypt 2010, LNCS 6110. Berlin: Springer-Verlag, 2010. 523–552
Agrawal S, Boneh D, Boyen X. Efficient lattice (H)IBE in the standard model. In: Proceedings of Eurocrypt 2010, LNCS 6110. Berlin: Springer-Verlag, 2010. 553–572
Boneh D, Freeman D M. Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. In: Proceedings of PKC 2011, LNCS 6571. Berlin: Springer-Verlag, 2011. 1–16
Boneh D, Freeman D M. Homomorphic Signatures for polynomial functions. In: Proceedings of Eurocrypt 2011, LNCS 6632. Berlin: Springer-Verlag, 2011. 149–168
Gordon S D, Katz J, Vaikuntanathan V. A group signature scheme from lattice assumptions. In: Proceedings of Asiacrypt 2010, LNCS 6477. Berlin: Springer-Verlag, 2010. 395–412
Johnson R, Molnar D, Song D, et al. Homomorphic signature schemes. In: Proceedings of CT-RSA 2002, LNCS 2271. Berlin: Springer-Verlag, 2002. 244–262
Gennaro R, Katz J, Rabin T. Secure network coding over the integers. In: Proceedings of PKC 2010, LNCS 6056. Berlin: Springer-Verlag, 2010. 142–160
Boneh D, Freeman D M, Katz J, et al. Singing a linear subspace: signature schemes for network coding. In: Proceedings of PKC 2009, LNCS 5443. Berlin: Springer-Verlag, 2009. 68–87
Micciancio D, Regev O. Worst-case to average-case reductions based on Gaussian measures. In: Proceedings of 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Rome, 2004. 372–381
Alwen J, Peikert C. Generating shorter bases for hard random lattices. In: Proceedings of 26th International Symposium on Theoretical Aspects of Computer Science, Vol 09001, Freiburg, 2009. 75–86
Ahn D H, Boneh D, Camenisch J, et al. Computing on authenticated data. http://eprint.iacr.org/2011/096
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, F., Hu, Y. & Wang, B. Lattice-based linearly homomorphic signature scheme over binary field. Sci. China Inf. Sci. 56, 1–9 (2013). https://doi.org/10.1007/s11432-012-4681-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-012-4681-9