A framework for non-interactive instance-dependent commitment schemes (NIC)

DOI10.1016/J.TCS.2015.05.031zbMATH Open1331.94056OpenAlexW2155834001MaRDI QIDQ500985FDOQ500985

Venkatesh Srinivasan, Bruce M. Kapron, Lior Malka

Publication date: 8 October 2015

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

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

Recommendations

• A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
• An Equivalence Between Zero Knowledge and Commitments
• Non-malleable instance-dependent commitment in the standard model
• Independent Zero-Knowledge Sets
• scientific article

zbMATH Keywords

cryptographyzero knowledgeinstant-dependent commitment schemes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Cites Work

• Zero-knowledge against quantum attacks
• A study of statistical zero-knowledge proofs (to appear)
• A Pseudorandom Generator from any One-way Function
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• An Unconditional Study of Computational Zero Knowledge
• Bit commitment using pseudorandomness
• Efficient signature generation by smart cards
• Title not available (Why is that?)
• Title not available (Why is that?)
• Foundations of Cryptography
• Title not available (Why is that?)
• Title not available (Why is that?)
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• Does co-NP have short interactive proofs ?
• The complexity of promise problems with applications to public-key cryptography
• The Knowledge Complexity of Interactive Proof Systems
• Statistical zero-knowledge languages can be recognized in two rounds
• A complete problem for statistical zero knowledge
• Advances in Cryptology - CRYPTO 2003
• Title not available (Why is that?)
• An Equivalence Between Zero Knowledge and Commitments
• On relationships between statistical zero-knowledge proofs
• The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives
• Local zero knowledge
• Title not available (Why is that?)
• Title not available (Why is that?)
• Super-Perfect Zero-Knowledge Proofs
• A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
• How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
• Theory of Cryptography
• A language-dependent cryptographic primitive

Cited In (2)

• Zero knowledge and circuit minimization
• The Untold Story of $$\mathsf {SBP}$$

This page was built for publication: A framework for non-interactive instance-dependent commitment schemes (NIC)

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