Weak Zero-Knowledge beyond the Black-Box Barrier
From MaRDI portal
Publication:5026393
DOI10.1137/20M1319565OpenAlexW4210493335MaRDI QIDQ5026393
Nir Bitansky, Omer Paneth, Dakshita Khurana
Publication date: 8 February 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/20m1319565
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth projective hashing and two-message oblivious transfer
- Which languages have 4-round zero-knowledge proofs?
- Bit commitment using pseudorandomness
- Statistical zero-knowledge languages can be recognized in two rounds
- Probabilistic encryption
- Definitions and properties of zero-knowledge proof systems
- One-message zero knowledge and non-malleable commitments
- Two-message statistically sender-private OT from LWE
- On the existence of three round zero-knowledge proofs
- Distinguisher-dependent simulation in two rounds and its applications
- From obfuscation to the security of Fiat-Shamir for proofs
- On secure two-party computation in three rounds
- A generic approach to constructing and proving verifiable random functions
- The hunting of the SNARK
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- On perfect correctness in (lockable) obfuscation
- Mr NISC: multiparty reusable non-interactive secure computation
- Advances in cryptology -- CRYPTO 2017. 37th annual international cryptology conference, Santa Barbara, CA, USA, August 20--24, 2017. Proceedings. Part II
- Limits of Extractability Assumptions with Distributional Auxiliary Input
- Contention in Cryptoland: Obfuscation, Leakage and UCE
- Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Secure Computation against Adaptive Auxiliary Information
- Point Obfuscation and 3-Round Zero-Knowledge
- Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input
- Black-Box Constructions of Protocols for Secure Computation
- 3-Message Zero Knowledge Against Human Ignorance
- Resettable zero-knowledge (extended abstract)
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
- Magic Functions
- On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
- A public key cryptosystem and a signature scheme based on discrete logarithms
- The Knowledge Complexity of Interactive Proof Systems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- A Pseudorandom Generator from any One-way Function
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- On the Composition of Zero-Knowledge Proof Systems
- Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
- Fully homomorphic encryption using ideal lattices
- Multi-collision resistance: a paradigm for keyless hash functions
- On the existence of extractable one-way functions
- From Weak to Strong Zero-Knowledge and Applications
- ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
- Derandomization in Cryptography
- New Techniques for Noninteractive Zero-Knowledge
- Zaps and Their Applications
- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Non-black-box simulation in the fully concurrent setting
- Witness encryption and its applications
- On lattices, learning with errors, random linear codes, and cryptography
- Theory of Cryptography
This page was built for publication: Weak Zero-Knowledge beyond the Black-Box Barrier
