How to construct constant-round zero-knowledge proof systems for NP
From MaRDI portal
Publication:1924196
zbMath0855.68085MaRDI QIDQ1924196
Publication date: 14 October 1996
Published in: Journal of Cryptology (Search for Journal in Brave)
Related Items
A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ On the concurrent composition of quantum zero-knowledge ⋮ How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition ⋮ Efficient set intersection with simulation-based security ⋮ Concurrent knowledge extraction in public-key models ⋮ Round-optimal fully black-box zero-knowledge arguments from one-way permutations ⋮ Round optimal black-box ``commit-and-prove ⋮ Constant-round leakage-resilient zero-knowledge from collision resistance ⋮ On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing ⋮ Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge ⋮ A note on the Dwork-Naor timed deniable authentication ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ Polynomial runtime and composability ⋮ Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model ⋮ Round-optimal zero-knowledge proofs of knowledge for NP ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems ⋮ On the power of rewinding simulators in functional encryption ⋮ A note on constant-round zero-knowledge proofs of knowledge ⋮ On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits ⋮ Signatures and Efficient Proofs on Committed Graphs and NP-Statements ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Statistical security in two-party computation revisited ⋮ Doubly adaptive zero-knowledge proofs ⋮ Lower bounds and impossibility results for concurrent self composition ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Reverse firewalls for oblivious transfer extension and applications to zero-knowledge ⋮ Existence of 3-round zero-knowledge proof systems for NP ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Fully-Simulatable Oblivious Set Transfer ⋮ Which languages have 4-round zero-knowledge proofs? ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Steganography-free zero-knowledge ⋮ Constant-round adaptive zero-knowledge proofs for NP ⋮ Round-optimal black-box MPC in the plain model ⋮ Public-coin parallel zero-knowledge for NP ⋮ Efficient set operations in the presence of malicious adversaries ⋮ Post-quantum resettably-sound zero knowledge ⋮ The round complexity of quantum zero-knowledge ⋮ On expected polynomial runtime in cryptography ⋮ Concurrent zero knowledge, revisited ⋮ Cryptographic reverse firewalls for interactive proof systems ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ Efficient one-sided adaptively secure computation ⋮ The Knowledge Complexity of Interactive Proof Systems ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Lower bounds for non-black-box zero knowledge ⋮ On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits ⋮ One-Time Programs ⋮ An Equivalence Between Zero Knowledge and Commitments ⋮ The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization ⋮ Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security ⋮ On the enumeration of minimal non-pairwise compatibility graphs ⋮ Efficient Fully-Simulatable Oblivious Transfer ⋮ On the power of secure two-party computation ⋮ Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits ⋮ Post-quantum multi-party computation ⋮ Handling expected polynomial-time strategies in simulation-based security proofs ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model ⋮ On publicly-accountable zero-knowledge and small shuffle arguments ⋮ Reducing complexity assumptions for statistically-hiding commitment ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ New approaches for deniable authentication ⋮ Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model ⋮ Composition of Zero-Knowledge Proofs with Efficient Provers ⋮ Private Coins versus Public Coins in Zero-Knowledge Proof Systems ⋮ Constant-Round Nonmalleable Commitments from Any One-Way Function ⋮ New efficient and secure protocols for verifiable signature sharing and other applications ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ Black-box transformations from passive to covert security with public verifiability ⋮ An efficient protocol for secure two-party computation in the presence of malicious adversaries ⋮ How to Simulate It – A Tutorial on the Simulation Proof Technique ⋮ Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
