Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract)

DOI10.1007/978-3-319-49175-2_10zbMath1407.94148OpenAlexW2553513278MaRDI QIDQ2953816

Rasmus Zakarias, Samuel Ranellucci, Alain Tapp

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)

Related Items (2)

Stacked garbling for disjunctive zero-knowledge proofs ⋮ Encryption Switching Protocols

Uses Software

• ZKBoo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum disclosure proofs of knowledge
• Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions
• Compact VSS and Efficient Homomorphic UC Commitments
• Additively Homomorphic UC Commitments with Optimal Amortized Overhead
• Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
• On the Efficiency of Bit Commitment Reductions
• A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
• The Knowledge Complexity of Interactive Proof Systems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Secure Multiparty Computation and Secret Sharing
• Scalable Secure Multiparty Computation

This page was built for publication: Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract)