Lower bounds for non-black-box zero knowledge
From MaRDI portal
Recommendations
- Lower Bounds for Non-interactive Zero-Knowledge
- Private coins versus public coins in zero-knowledge proof systems
- On the existence of three round zero-knowledge proofs
- Round-optimal zero-knowledge proofs of knowledge for NP
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
Cites work
- scientific article; zbMATH DE number 1722687 (Why is no real title available?)
- scientific article; zbMATH DE number 4191106 (Why is no real title available?)
- scientific article; zbMATH DE number 4170086 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 176566 (Why is no real title available?)
- scientific article; zbMATH DE number 3489106 (Why is no real title available?)
- scientific article; zbMATH DE number 1302862 (Why is no real title available?)
- scientific article; zbMATH DE number 1304087 (Why is no real title available?)
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- scientific article; zbMATH DE number 2009949 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- scientific article; zbMATH DE number 1759795 (Why is no real title available?)
- scientific article; zbMATH DE number 1775426 (Why is no real title available?)
- scientific article; zbMATH DE number 861531 (Why is no real title available?)
- scientific article; zbMATH DE number 883898 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- A complete problem for statistical zero knowledge
- A note on negligible functions
- A uniform-complexity treatment of encryption and zero-knowledge
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Bit commitment using pseudorandomness
- Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
- Computing with Very Weak Random Sources
- Concurrent and resettable zero-knowledge in poly-logarithmic rounds
- Definitions and properties of zero-knowledge proof systems
- Derandomizing Arthur-Merlin games using hitting sets
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Efficient signature generation by smart cards
- Factoring Polynomials Over Large Finite Fields
- Foundations of Cryptography
- Foundations of Cryptography
- Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to construct constant-round zero-knowledge proof systems for NP
- Lower bounds for non-black-box zero knowledge
- On Approximation Algorithms for # P
- On interactive proofs with a laconic prover
- On pseudorandomness and resource-bounded measure
- On the Composition of Zero-Knowledge Proof Systems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Random generation of combinatorial structures from a uniform distribution
- Randomness is linear in space
- Resettable zero-knowledge (extended abstract)
- Security proofs for signature schemes
- Strict polynomial-time in simulation and extraction
- The Knowledge Complexity of Interactive Proof Systems
- Uniform generation of NP-witnesses using an NP-oracle
- Zaps and Their Applications
Cited in
(35)- On the implausibility of constant-round public-coin zero-knowledge proofs
- Strict Polynomial-Time in Simulation and Extraction
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- The Knowledge Complexity of Interactive Proof Systems
- Concurrent knowledge extraction in public-key models
- Round-optimal black-box secure computation from two-round malicious OT
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Weak zero-knowledge beyond the black-box barrier
- Theory of Cryptography
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fiat-Shamir for highly sound protocols is instantiable
- On the correlation intractability of obfuscated pseudorandom functions
- A note on perfect correctness by derandomization
- Augmented random oracles
- Private coins versus public coins in zero-knowledge proof systems
- On the round complexity of zero-knowledge proofs based on one-way permutations
- The journey from NP to TFNP hardness
- Nearly simultaneously resettable black-box zero knowledge
- Three-round public-coin bounded-auxiliary-input zero-knowledge arguments of knowledge
- Lower Bounds for Non-interactive Zero-Knowledge
- Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
- Lower bounds for non-black-box zero knowledge
- Existence of 3-round zero-knowledge proof systems for NP
- One-Time Programs
- Weak Zero-Knowledge beyond the Black-Box Barrier
- Round-optimal zero-knowledge proofs of knowledge for NP
- Multikey fully homomorphic encryption and applications
- Which Languages Have 4-Round Zero-Knowledge Proofs?
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
- Post-quantum resettably-sound zero knowledge
- On the existence of extractable one-way functions
- Which languages have 4-round zero-knowledge proofs?
- Composition of zero-knowledge proofs with efficient provers
- Standard security does not imply indistinguishability under selective opening
- Strong proofs of knowledge
This page was built for publication: Lower bounds for non-black-box zero knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490264)
