ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
From MaRDI portal
Publication:5261685
DOI10.1007/978-3-662-46497-7_16zbMath1319.94053OpenAlexW1026822280MaRDI QIDQ5261685
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
Related Items (29)
Non-malleable codes for bounded parallel-time tampering ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Separating Computational and Statistical Differential Privacy in the Client-Server Model ⋮ Constructions for quantum indistinguishability obfuscation ⋮ A note on perfect correctness by derandomization ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ Verifiable Functional Encryption ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ On the complexity of compressing obfuscation ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ Output-Compressing Randomized Encodings and Applications ⋮ Perfect Structure on the Edge of Chaos ⋮ Improved OR-Composition of Sigma-Protocols ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ 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 ⋮ Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption ⋮ A Note on Perfect Correctness by Derandomization ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier
This page was built for publication: ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
