Cryptology ePrint Archive: Report 2017/1123

Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs

Cecilia Boschini and Jan Camenisch and Gregory Neven

Abstract: Higher-level cryptographic privacy-enhancing protocols such as anonymous credentials, voting schemes, and e-cash are often constructed by suitably combining signature, commitment, and encryption schemes with zero-knowledge proofs. Indeed, a large body of protocols have been constructed in that manner from Camenisch-Lysyanskaya signatures and generalized Schnorr proofs. In this paper, we build a similar framework for lattice-based schemes by presenting a signature and commitment scheme that are compatible with Lyubashevsky's Fiat-Shamir proofs with abort, currently the most efficient zero-knowledge proofs for lattices. To cope with the relaxed soundness guarantees of these proofs, we define corresponding notions of relaxed signature and commitment schemes. We demonstrate the flexibility and efficiency of our new primitives by constructing a new lattice-based anonymous attribute token scheme and providing concrete parameters to securely instantiate this scheme.

Category / Keywords: public-key cryptography / Lattices, sigma protocols, anonymous attribute tokens, group signatures, privacy enhancing protocols

Date: received 20 Nov 2017

Contact author: bos at zurich ibm com

Available format(s): PDF | BibTeX Citation

Version: 20171124:065254 (All versions of this report)

Short URL: ia.cr/2017/1123

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]