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

Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems

Jules Maire, Damien Vergnaud

Published Jan 1, 2024• 3 citations
Publisher
DOI
10.1007/978-3-031-50594-2_10

Related papers

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

Quantum Computationally Predicate-Binding Commitments with Application in Quantum Zero-Knowledge Arguments for NP

Jun Yan

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

Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications

Rupeng Yang, Man Ho Au, Zhenfei Zhang +3 more

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

Quantum Computationally Predicate-Binding Commitment with Application in Quantum Zero-Knowledge Argument for NP.

Jun Yan

•Jan 1, 2020•1 citation

Relativistic commitment and zero-knowledge proofs

André Chailloux

•Mar 1, 2018•0 citations

On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs

Ivan Damgård

Springer eBooks•Nov 8, 2007•58 citations