Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption

DOI10.1007/978-3-662-53008-5_17zbMath1391.94724OpenAlexW2482412562MaRDI QIDQ2829226

Moni Naor, Eylon Yogev, Amit Sahai, Aayush Jain, Prabhanjan V. Ananth

Publication date: 27 October 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53008-5_17

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (19)

One-Way Functions and (Im)perfect Obfuscation ⋮ Obfuscating finite automata ⋮ The Journey from NP to TFNP Hardness ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Secure Obfuscation in a Weak Multilinear Map Model ⋮ From minicrypt to obfustopia via private-key functional encryption ⋮ From FE combiners to secure MPC and back ⋮ Multi-input Functional Encryption with Unbounded-Message Security ⋮ Offline witness encryption with semi-adaptive security ⋮ On the complexity of compressing obfuscation ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ From Minicrypt to Obfustopia via Private-Key Functional Encryption ⋮ Combiners for functional encryption, unconditionally ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ Signatures Resilient to Uninvertible Leakage ⋮ Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption ⋮ Obfuscation Combiners ⋮ Amplifying the security of functional encryption, unconditionally ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• One way functions and pseudorandom generators
• Indistinguishability Obfuscation: From Approximate to Exact
• Cryptographic Assumptions: A Position Paper
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
• Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
• Multi-identity and Multi-key Leveled FHE from Learning with Errors
• i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
• On Best-Possible Obfuscation
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• Foundations of Cryptography
• How to use indistinguishability obfuscation
• ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
• Obfuscation of Probabilistic Circuits and Applications
• On Robust Combiners for Oblivious Transfer and Other Primitives
• Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Protecting Obfuscation against Algebraic Attacks
• Topics in Cryptology – CT-RSA 2005
• Two Round Multiparty Computation via Multi-key FHE

This page was built for publication: Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption