Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

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

Fabrice Benhamouda, Jan L. Camenisch, Stephan Krenn, Vadim Lyubashevsky, Gregory Neven

Published Jan 1, 2014• 100 citations
Publisher
DOI
10.1007/978-3-662-45611-8_29

Related papers

Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs

Cecilia Boschini, Jan L. Camenisch, Gregory Neven

Lecture notes in computer science•Jan 1, 2018•12 citations

Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon

Lecture notes in computer science•Jan 1, 2022•129 citations

Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption

Benoît Libert, San Ling, Fabrice Mouhartem +2 more

Lecture notes in computer science•Jan 1, 2016•40 citations

Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems

Rikke Bendlin, Ivan Damgård

Lecture notes in computer science•Jan 1, 2010•99 citations

Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs

Jonathan Bootle, Vadim Lyubashevsky, Gregor Seiler

Lecture notes in computer science•Jan 1, 2019•84 citations

Zero-knowledge arguments for matrix–vector relations and lattice-based group encryption

Benoît Libert, San Ling, Fabrice Mouhartem +2 more

Theoretical Computer Science•Jan 9, 2019•7 citations