Hybrid commitments and their applications to zero-knowledge proof systems
type: Item
instance of: scholarly article
title: Hybrid commitments and their applications to zero-knowledge proof systems
zbMATH Open document ID: 1162.94408
author: Dario Catalano
author: Ivan Visconti
published in: Theoretical Computer Science
publication date: 2009-06-22T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 5567396
zbMATH Keywords: commitment schemes
zbMATH Keywords: zero-knowledge proofs
MaRDI profile type: Publication
full work available at URL: j.tcs.2007.01.007
OpenAlex ID: W1970917292
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Q3826476
cites work: Noninteractive Zero-Knowledge
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Does co-NP have short interactive proofs ?
cites work: Minimum disclosure proofs of knowledge
cites work: Advances in Cryptology - ASIACRYPT 2003
cites work: Q4783717
cites work: Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
cites work: Universally composable two-party and multi-party secure computation
cites work: Theory of Cryptography
cites work: Automata, Languages and Programming
cites work: Mercurial Commitments with Applications to Zero-Knowledge Sets
cites work: The complexity of theorem-proving procedures
cites work: Q4940695
cites work: Non-interactive and reusable non-malleable commitment schemes
cites work: Q2724587
cites work: Q4409144
cites work: Q3374926
cites work: Q4783745
cites work: Q4542531
cites work: Q2778839
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Nonmalleable Cryptography
cites work: Q4542559
cites work: Q4249349
cites work: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
cites work: Q3210166
cites work: Q4472067
cites work: Q4536816
cites work: Q4434875
cites work: Concurrent zero-knowledge with timing, revisited
cites work: How to construct constant-round zero-knowledge proof systems for NP
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
cites work: Reducing Complexity Assumptions for Statistically-Hiding Commitment
cites work: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
cites work: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
cites work: Q4434873
cites work: Bit commitment using pseudorandomness
cites work: Q4249647
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: Q4434874
cites work: Q4250778
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: Efficient signature generation by smart cards
cites work: Efficient Zero Knowledge on the Internet
DOI: 10.1016/J.TCS.2007.01.007
Recommended article: Q4250897
Recommended article: Automata, Languages and Programming
Recommended article: Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
Recommended article: An Equivalence Between Zero Knowledge and Commitments
Recommended article: Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract)
Recommended article: Mercurial Commitments with Applications to Zero-Knowledge Sets
Recommended article: Q4434873
Recommended article: Q4038698
Recommended article: On the Composition of Zero-Knowledge Proof Systems
Recommended article: Mercurial commitments with applications to zero-knowledge sets
description: scientific article; zbMATH DE number 5567396