Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs

DOI10.1007/978-3-540-85174-5_29MaRDI QIDQ3600238zbMATH OpenOpenAlexFDO

Authors Yevgeniy Dodis, Victor Shoup, Shabsi Walfish

Publication date 10 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85174-5_29

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Composition of zero-knowledge proofs with efficient provers
• scientific article; zbMATH DE number 1304087
• Efficient generic zero-knowledge proofs from commitments (extended abstract)
• scientific article; zbMATH DE number 177820
• On the Composition of Zero-Knowledge Proof Systems
• scientific article; zbMATH DE number 2009953
• A framework for practical universally composable zero-knowledge protocols
• Efficient zero-knowledge proofs. (Abstract)
• Prover-efficient commit-and-prove zero-knowledge snarks

Cited in

(28)

• Hybrid commitments and their applications to zero-knowledge proof systems
• The wonderful world of global random oracles
• More efficient commitments from structured lattice assumptions
• Secure two-party computation via cut-and-choose oblivious transfer
• Signatures from sequential-OR proofs
• Zero-knowledge proofs for committed symmetric Boolean functions
• New constructions of efficient simulation-sound commitments using encryption and their applications
• Constant-Size Commitments to Polynomials and Their Applications
• A framework for practical universally composable zero-knowledge protocols
• A second note on the feasibility of generalized universal composability
• scientific article; zbMATH DE number 1942445 (Why is no real title available?)
• scientific article; zbMATH DE number 2009953 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• On the Composition of Zero-Knowledge Proof Systems
• Generic construction of GUC secure commitment in the KRK model
• Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
• Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
• On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments
• Witness-succinct universally-composable SNARKs
• \textit{CCOM}: cost-efficient and collusion-resistant oracle mechanism for smart contracts
• Universally composable -protocols in the global random-oracle model
• GUC-secure commitments via random oracles: new impossibility and feasibility
• Endemic oblivious transfer via random oracles, revisited
• Secure multiparty computation with identifiable abort via vindicating release
• Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
• Identity-based trapdoor mercurial commitments and applications
• Cryptography in the multi-string model
• Linearly homomorphic structure-preserving signatures and their applications

This page was built for publication: Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600238)