On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
From MaRDI portal
Publication:3449562
DOI10.1137/130928236zbMath1380.94075OpenAlexW2238262329MaRDI QIDQ3449562
Publication date: 4 November 2015
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/100819
Related Items
Multi-theorem designated-verifier NIZK for QMA ⋮ New approaches for quantum copy-protection ⋮ The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ One-message zero knowledge and non-malleable commitments ⋮ Certifying trapdoor permutations, revisited ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Pattern matching on encrypted streams ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ COA-secure obfuscation and applications ⋮ Distributed (correlation) samplers: how to remove a trusted dealer in one round ⋮ Explainable arguments ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Non-black-box simulation in the fully concurrent setting, revisited ⋮ Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ More efficient verifiable functional encryption ⋮ Individual simulations ⋮ Post-quantum resettably-sound zero knowledge ⋮ Statistical ZAPs from group-based assumptions ⋮ Non-interactive secure computation from one-way functions ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Statistical ZAPR arguments from bilinear maps ⋮ Non-interactive zero knowledge from sub-exponential DDH ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust ⋮ Pseudorandom Functions: Three Decades Later ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- Bit commitment using pseudorandomness
- How to construct constant-round zero-knowledge proof systems for NP
- Public-coin parallel zero-knowledge for NP
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
- On the round complexity of covert computation
- Simultaneously Resettable Arguments of Knowledge
- On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge
- Resettable zero-knowledge (extended abstract)
- Concurrent Nonmalleable Commitments
- Strict polynomial-time in simulation and extraction
- New and Improved Constructions of Nonmalleable Cryptographic Protocols
- Resettably Secure Computation
- Universal Arguments and their Applications
- The Knowledge Complexity of Interactive Proof Systems
- 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
- Foundations of Cryptography
- On the Composition of Zero-Knowledge Proof Systems
- Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
- Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
- Fully homomorphic encryption using ideal lattices
- Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
- Zaps and Their Applications
- Stateless Cryptographic Protocols
- Non-black-box simulation in the fully concurrent setting
- Non-black-box simulation from one-way functions and applications to resettable security
- On the impossibility of approximate obfuscation and applications to resettable cryptography
- 4-Round Resettably-Sound Zero Knowledge
- On the Composition of Public-Coin Zero-Knowledge Protocols
