Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
From MaRDI portal
Publication:2829226
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
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- scientific article; zbMATH DE number 1303118 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Cryptographic assumptions: a position paper
- Foundations of Cryptography
- How to use indistinguishability obfuscation
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Indistinguishability obfuscation: from approximate to exact
- Multi-identity and multi-key leveled FHE from learning with errors
- Obfuscation of probabilistic circuits and applications
- On Best-Possible Obfuscation
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- One way functions and pseudorandom generators
- Protecting obfuscation against algebraic attacks
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Topics in Cryptology – CT-RSA 2005
- Two round multiparty computation via multi-key FHE
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
Cited in
(22)- Delegating RAM computations with adaptive soundness and privacy
- Obfuscation combiners
- Combiners for functional encryption, unconditionally
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- From Minicrypt to Obfustopia via private-key functional encryption
- Signatures Resilient to Uninvertible Leakage
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- Obfuscating finite automata
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- The journey from NP to TFNP hardness
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- From FE combiners to secure MPC and back
- Amplifying the security of functional encryption, unconditionally
- From minicrypt to obfustopia via private-key functional encryption
- Secure Obfuscation in a Weak Multilinear Map Model
- One-Way Functions and (Im)perfect Obfuscation
- scientific article; zbMATH DE number 7650430 (Why is no real title available?)
- Multi-input functional encryption with unbounded-message security
- Information Security and Cryptology - ICISC 2005
- On the complexity of compressing obfuscation
- Offline witness encryption with semi-adaptive security
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
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)
