Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures

Abstract : Lattice problems are an attractive basis for cryptographic systems because they seem to offer better security than discrete logarithm and factoring based problems. Efficient lattice-based constructions are known for signature and encryption schemes. However, the constructions known for more sophisticated schemes such as group signatures are still far from being practical. In this paper we make a number of steps towards efficient lattice-based constructions of more complex cryptographic protocols. First, we provide a more efficient way to prove knowledge of plaintexts for lattice-based encryption schemes. We then show how our new protocol can be combined with a proof of knowledge for Pedersen commitments in order to prove that the committed value is the same as the encrypted one. Finally, we make use of this to construct a new group signature scheme that is a “hybrid” in the sense that privacy holds under a lattice-based assumption while security is discrete-logarithm-based.
Document type :
Conference papers
Complete list of metadatas
Contributor : Fabrice Benhamouda <>
Submitted on : Wednesday, November 19, 2014 - 10:41:34 PM
Last modification on : Monday, October 28, 2019 - 2:40:06 PM




Fabrice Benhamouda, Jan Camenisch, Stephan Krenn, Vadim Lyubashevsky, Gregory Neven. Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures. ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2014, Kaohsiung, Taiwan. pp.551-572, ⟨10.1007/978-3-662-45611-8_29⟩. ⟨hal-01084737⟩



Record views