Hybrid commitments and their applications to zero-knowledge proof systems

DOI10.1016/j.tcs.2007.01.007zbMath1162.94408OpenAlexW1970917292MaRDI QIDQ1022606

Ivan Visconti, Dario Catalano

Publication date: 22 June 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.01.007

zbMATH Keywords

zero-knowledge proofscommitment schemes

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (7)

Confidential and efficient asset proof for bitcoin exchanges ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ A generic transform from multi-round interactive proof to NIZK ⋮ On constant-round concurrent non-malleable proof systems ⋮ Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model ⋮ A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles ⋮ Improved OR-Composition of Sigma-Protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bit commitment using pseudorandomness
• Does co-NP have short interactive proofs ?
• Minimum disclosure proofs of knowledge
• Efficient signature generation by smart cards
• How to construct constant-round zero-knowledge proof systems for NP
• Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
• Universally composable two-party and multi-party secure computation
• Concurrent zero-knowledge with timing, revisited
• Non-interactive and reusable non-malleable commitment schemes
• Efficient Zero Knowledge on the Internet
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• The Knowledge Complexity of Interactive Proof Systems
• Noninteractive Zero-Knowledge
• A method for obtaining digital signatures and public-key cryptosystems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Nonmalleable Cryptography
• Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
• Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Reducing Complexity Assumptions for Statistically-Hiding Commitment
• Mercurial Commitments with Applications to Zero-Knowledge Sets
• Advances in Cryptology - CRYPTO 2003
• The complexity of theorem-proving procedures
• Automata, Languages and Programming
• Automata, Languages and Programming
• Theory of Cryptography
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Hybrid commitments and their applications to zero-knowledge proof systems