ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation

DOI10.1007/978-3-662-46497-7_16zbMATH Open1319.94053OpenAlexW1026822280MaRDI QIDQ5261685FDOQ5261685

Authors: Nir Bitansky, Omer Paneth 

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

Recommendations

• Non-interactive Zaps and New Techniques for NIZK
• Statistical ZAP arguments
• Non-interactive zaps of knowledge
• Applied Cryptography and Network Security
• Zaps and Their Applications

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (38)

• On constructing one-way permutations from indistinguishability obfuscation
• Toward non-interactive zero-knowledge proofs for NP from LWE
• Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
• Verifiable functional encryption
• Non-malleable codes for bounded parallel-time tampering
• Compact NIZKs from standard assumptions on bilinear maps
• Output-compressing randomized encodings and applications
• Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
• Improved OR-composition of sigma-protocols
• Limits on the power of indistinguishability obfuscation and functional encryption
• Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
• An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge
• On constructing one-way permutations from indistinguishability obfuscation
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Separating computational and statistical differential privacy in the client-server model
• 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
• Non-interactive zaps of knowledge
• Simpler constructions of asymmetric primitives from obfuscation
• Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
• Applied Cryptography and Network Security
• Non-interactive Zaps and New Techniques for NIZK
• 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
• Witness semantic security
• A note on perfect correctness by derandomization
• Constructions for quantum indistinguishability obfuscation
• Robust Distributed Pseudorandom Functions for mNP Access Structures
• Structure versus hardness through the obfuscation lens
• Weak Zero-Knowledge beyond the Black-Box Barrier
• Robust additive randomized encodings from IO and pseudo-non-linear codes
• Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
• Indistinguishability obfuscation: from approximate to exact
• Robust transforming combiners from indistinguishability obfuscation to functional encryption

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)