Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
From MaRDI portal
Publication:2829226
DOI10.1007/978-3-662-53008-5_17zbMATH Open1391.94724OpenAlexW2482412562MaRDI QIDQ2829226FDOQ2829226
Authors: Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev, Prabhanjan 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
Recommendations
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- On Robust Combiners for Oblivious Transfer and Other Primitives
- Witness encryption with (weak) unique decryption and message indistinguishability: constructions and applications
- Robuster Combiners for Oblivious Transfer
- Theory of Cryptography
- Combiners for functional encryption, unconditionally
- Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
- Indistinguishability obfuscation with non-trivial efficiency
- Universally composable oblivious transfer from lossy encryption and the MceEliece assumptions
- Candidate indistinguishability obfuscation and functional encryption for all circuits
Cites Work
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
- Title not available (Why is that?)
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Foundations of Cryptography
- One way functions and pseudorandom generators
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Title not available (Why is that?)
- How to use indistinguishability obfuscation
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On Best-Possible Obfuscation
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2005
- Obfuscation of probabilistic circuits and applications
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Indistinguishability Obfuscation: From Approximate to Exact
- Cryptographic Assumptions: A Position Paper
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- Protecting obfuscation against algebraic attacks
- Two Round Multiparty Computation via Multi-key FHE
- Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
Cited In (22)
- From Minicrypt to Obfustopia via Private-Key Functional Encryption
- Obfuscating finite automata
- Information Security and Cryptology - ICISC 2005
- Offline witness encryption with semi-adaptive security
- Signatures Resilient to Uninvertible Leakage
- Title not available (Why is that?)
- Title not available (Why is that?)
- From minicrypt to obfustopia via private-key functional encryption
- On the complexity of compressing obfuscation
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Multi-input Functional Encryption with Unbounded-Message Security
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- Delegating RAM Computations with Adaptive Soundness and Privacy
- Secure Obfuscation in a Weak Multilinear Map Model
- Combiners for functional encryption, unconditionally
- From FE combiners to secure MPC and back
- Amplifying the security of functional encryption, unconditionally
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
- One-Way Functions and (Im)perfect Obfuscation
- Obfuscation Combiners
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software
- The Journey from NP to TFNP Hardness
This page was built for publication: Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829226)
