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

Shorter Lattice-Based Zero-Knowledge Proofs for the Correctness of a Shuffle

Javier Herranz, Ramiro Pinilla, Manuel Sánchez

Published Jan 1, 2021• 8 citations
Publisher
DOI
10.1007/978-3-662-63958-0_27

Related papers

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

Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler

Lecture notes in computer science•Jan 1, 2021•60 citations

How to Avoid Repetitions in Lattice-Based Deniable Zero-Knowledge Proofs

Xavier Arnal, Abraham Cano, Tamara Finogina +1 more

Lecture notes in computer science•Jan 1, 2022•1 citation

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

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

A Leakage-Resilient Zero Knowledge Proof for Lattice Problem

Yang Liu, Hongda Li, Qihua Niu

Lecture notes in computer science•Jan 1, 2012•0 citations