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

Practical Product Proofs for Lattice Commitments

Thomas Attema, Vadim Lyubashevsky, Gregor Seiler

Published Jan 1, 2020• 72 citations
Publisher
DOI
10.1007/978-3-030-56880-1_17

Related papers

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•67 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

Toward Practical Lattice-Based Proof of Knowledge from Hint-MLWE

Duhyeong Kim, Dongwon Lee, Jinyeong Seo +1 more

Lecture notes in computer science•Jan 1, 2023•55 citations

Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs

Yevgeniy Dodis, Victor Shoup, Shabsi Walfish

Lecture notes in computer science•Aug 20, 2008•34 citations

Unclonable Commitments and Proofs

Vipul Goyal, Giulio Malavolta, Justin Raizes

Lecture notes in computer science•Nov 30, 2024•6 citations

Proving multiplicative relations for lattice commitments in batch

Mengfan Wang, Guifang Huang, Dong Fang +1 more

Abstract Lattice-based commitment schemes and their associated zero-knowledge proofs are essential building blocks for advanced lattice-based cryptographic protocols. In particular, proofs of algebraic relations among committed messages are widely used in privacy-preserving protocols such as range proofs. At CRYPTO 2020, Attema et al. proposed practical proofs for valid openings and multiplicative relations among committed values using the BDLOP commitment scheme. In their work, all commitments are generated using the same short randomness. In this paper, we consider a batch setting where commitments are generated using $$\ell$$ ℓ independent random vectors and present a batch valid opening proof. Our construction generalizes the approach of Baum et al. by supporting a larger challenge set and removing the requirement for invertible challenge differences. As a result, the proof size scales logarithmically with $$\ell$$ ℓ , rather than linearly. Furthermore, we introduce a product proof for committed messages with shared randomness across these $$\ell$$ ℓ commitment groups. Compared to the naive approach of applying Attema’s product proof once and repeating the opening proof $$\ell -1$$ ℓ - 1 times, our method achieves significantly better communication efficiency.

Cybersecurity•Jan 27, 2026•0 citations
Abstract Lattice-based commitment schemes and their associated zero-knowledge proofs are essential building blocks for advanced lattice-based cryptographic protocols. In particular, proofs of algebraic relations among committed messages are widely used in privacy-preserving protocols such as range proofs. At CRYPTO 2020, Attema et al. proposed practical proofs for valid openings and multiplicative relations among committed values using the BDLOP commitment scheme. In their work, all commitments are generated using the same short randomness. In this paper, we consider a batch setting where commitments are generated using ℓ\ellℓ ℓ independent random vectors and present a batch valid opening proof. Our construction generalizes the approach of Baum et al. by supporting a larger challenge set and removing the requirement for invertible challenge differences. As a result, the proof size scales logarithmically with ℓ\ellℓ ℓ , rather than linearly. Furthermore, we introduce a product proof for committed messages with shared randomness across these ℓ\ellℓ ℓ commitment groups. Compared to the naive approach of applying Attema’s product proof once and repeating the opening proof ℓ−1\ell -1ℓ−1 ℓ - 1 times, our method achieves significantly better communication efficiency.