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

RLWE-Based Zero-Knowledge Proofs for Linear and Multiplicative Relations

Ramiro Martínez, Paz Morillo

Published Jan 1, 2019• 2 citations
Publisher
DOI
10.1007/978-3-030-35199-1_13

Related papers

Zero Knowledge Proofs from Ring-LWE

Xiang Xie, Rui Xue, Minqian Wang

Lecture notes in computer science•Jan 1, 2013•32 citations

Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications

San Ling, Khoa Nguyen, Damien Stehlé +1 more

Lecture notes in computer science•Jan 1, 2013•178 citations

Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment

Yang Tao, Xi Wang, Rui Zhang

Lecture notes in computer science•Jan 1, 2020•4 citations

Quantum Zero-Knowledge Proof

Tao Shang

Springer eBooks•Oct 15, 2024•0 citations

Efficient Zero-Knowledge Proofs for Commitments from Learning With Errors over Rings.

Fabrice Benhamouda, Stephan Krenn, Vadim Lyubashevsky +1 more

Abstract. We design an efficient commitment scheme, and companion zero-knowledge proofs of knowledge, based on the learning with errors over rings (RLWE) problem. In particular, for rings in which almost all elements have inverses, we construct a perfectly binding commitment scheme whose hiding property relies on the RLWE assumption. Our scheme maps elements from the ring (or equivalently, n elements from Fq) to a small constant number of ring elements. We then construct Σ-protocols for proving, in a zero-knowledge manner, knowledge of the message contained in a commitment. We are able to further extend our basic protocol to allow us to prove additive and multiplicative relations among committed values. Our protocols have a communication complexity of O(Mn log q) and achieve a negligible knowledge error in one run. Here M is the constant from a rejection sampling technique that we employ, and can be set close to 1 by adjusting other parameters. Previously known Σ-protocols for LWE-related languages either relied on “smudging ” out the error (which necessitates working over large fields, resulting in poor efficiency) or only achieved a noticeable or even constant knowledge error (thus requiring many repetitions of the protocol).

•Jan 1, 2014•0 citations

Card-Based Zero-Knowledge Proof for the Nearest Neighbor Property: Zero-Knowledge Proof of ABC End View

Takuro Fukasawa, Yoshifumi Manabe

Lecture notes in computer science•Jan 1, 2022•15 citations
Abstract. We design an efficient commitment scheme, and companion zero-knowledge proofs of knowledge, based on the learning with errors over rings (RLWE) problem. In particular, for rings in which almost all elements have inverses, we construct a perfectly binding commitment scheme whose hiding property relies on the RLWE assumption. Our scheme maps elements from the ring (or equivalently, n elements from Fq) to a small constant number of ring elements. We then construct Σ-protocols for proving, in a zero-knowledge manner, knowledge of the message contained in a commitment. We are able to further extend our basic protocol to allow us to prove additive and multiplicative relations among committed values. Our protocols have a communication complexity of O(Mn log q) and achieve a negligible knowledge error in one run. Here M is the constant from a rejection sampling technique that we employ, and can be set close to 1 by adjusting other parameters. Previously known Σ-protocols for LWE-related languages either relied on “smudging ” out the error (which necessitates working over large fields, resulting in poor efficiency) or only achieved a noticeable or even constant knowledge error (thus requiring many repetitions of the protocol).