ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
From MaRDI portal
Publication:5261685
DOI10.1007/978-3-662-46497-7_16zbMATH Open1319.94053OpenAlexW1026822280MaRDI QIDQ5261685FDOQ5261685
Publication date: 6 July 2015
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_16
Cited In (34)
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- Indistinguishability Obfuscation: From Approximate to Exact
- On constructing one-way permutations from indistinguishability obfuscation
- Toward non-interactive zero-knowledge proofs for NP from LWE
- A Note on Perfect Correctness by Derandomization
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
- Non-malleable codes for bounded parallel-time tampering
- Compact NIZKs from standard assumptions on bilinear maps
- Structure Versus Hardness Through the Obfuscation Lens
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- On the complexity of compressing obfuscation
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- A note on perfect correctness by derandomization
- On Constructing One-Way Permutations from Indistinguishability Obfuscation
- Simpler constructions of asymmetric primitives from obfuscation
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Verifiable Functional Encryption
- Output-Compressing Randomized Encodings and Applications
- Perfect Structure on the Edge of Chaos
- Improved OR-Composition of Sigma-Protocols
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Compact NIZKs from standard assumptions on bilinear maps
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
- Witness semantic security
- Constructions for quantum indistinguishability obfuscation
- Robust Distributed Pseudorandom Functions for mNP Access Structures
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
- Weak Zero-Knowledge beyond the Black-Box Barrier
- Separating Computational and Statistical Differential Privacy in the Client-Server Model
- Robust additive randomized encodings from IO and pseudo-non-linear codes
- Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
This page was built for publication: ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261685)
