Efficient generic zero-knowledge proofs from commitments (extended abstract)

DOI10.1007/978-3-319-49175-2_10MaRDI QIDQ2953816zbMATH OpenOpenAlexFDO

Authors Samuel Ranellucci, Alain Tapp, Rasmus Zakarias

Publication date 6 January 2017

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

Full work available at URL https://doi.org/10.1007/978-3-319-49175-2_10

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Subquadratic zero-knowledge
• On the communication complexity of zero-knowledge proofs
• scientific article; zbMATH DE number 1559559
• An Equivalence Between Zero Knowledge and Commitments
• scientific article; zbMATH DE number 1302863

Cites work

• scientific article; zbMATH DE number 4191124 (Why is no real title available?)
• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 4037759 (Why is no real title available?)
• scientific article; zbMATH DE number 1030985 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• scientific article; zbMATH DE number 4185024 (Why is no real title available?)
• A simpler variant of universally composable security for standard multiparty computation
• Additively homomorphic UC commitments with optimal amortized overhead
• Compact VSS and efficient homomorphic UC commitments
• Minimum disclosure proofs of knowledge
• On the efficiency of bit commitment reductions
• Privacy-free garbled circuits with applications to efficient zero-knowledge
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Scalable Secure Multiparty Computation
• Secure multiparty computation and secret sharing
• Strictly-black-box zero-knowledge and efficient validation of financial transactions
• The Knowledge Complexity of Interactive Proof Systems

Cited in

(17)

• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
• scientific article; zbMATH DE number 1952907 (Why is no real title available?)
• Practical zero-knowledge proofs for circuit evaluation
• Zero-knowledge proofs for committed symmetric Boolean functions
• An Equivalence Between Zero Knowledge and Commitments
• Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
• Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
• Hybrid commitments and their applications to zero-knowledge proof systems
• Strictly-black-box zero-knowledge and efficient validation of financial transactions
• Commitments and efficient zero-knowledge proofs from learning parity with noise
• Encryption switching protocols
• Stacked garbling for disjunctive zero-knowledge proofs
• On zero-knowledge proofs (extended abstract)
• Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
• Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
• Slow motion zero knowledge identifying with colliding commitments
• scientific article; zbMATH DE number 1559559 (Why is no real title available?)

Describes a project that uses

Uses Software

• ZKBoo

This page was built for publication: Efficient generic zero-knowledge proofs from commitments (extended abstract)

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