Candidate iO from homomorphic encryption schemes
From MaRDI portal
Publication:6109075
DOI10.1007/s00145-023-09471-5zbMath1518.94048OpenAlexW3029767824WikidataQ122962963 ScholiaQ122962963MaRDI QIDQ6109075
Giulio Malavolta, Nico Döttling, Sanjam Garg, Zvika Brakerski
Publication date: 26 July 2023
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-023-09471-5
Cites Work
- Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Candidate obfuscation via oblivious LWE sampling
- Amplifying the security of functional encryption, unconditionally
- Counterexamples to new circular security assumptions underlying iO
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Homomorphic time-lock puzzles and applications
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Sum-of-squares meets program obfuscation, revisited
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Succinct LWE sampling, random polynomials, and obfuscation
- Indistinguishability Obfuscation with Non-trivial Efficiency
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Sanitization of FHE Ciphertexts
- Cryptanalysis of GGH Map
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Practical Multilinear Maps over the Integers
- Faster Bootstrapping with Polynomial Error
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Cryptanalysis of the Multilinear Map over the Integers
- Lattice-based FHE as secure as PKE
- Secure Obfuscation in a Weak Multilinear Map Model
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- Bounded Key-Dependent Message Security
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Indistinguishability Obfuscation from Functional Encryption
- Candidate Multilinear Maps from Ideal Lattices
- Pseudorandomness of ring-LWE for any ring and modulus
- Fully homomorphic encryption using ideal lattices
- How to use indistinguishability obfuscation
- Graph-Induced Multilinear Maps from Lattices
- Cryptanalyses of Candidate Branching Program Obfuscators
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Protecting Obfuscation against Algebraic Attacks
- How to Garble Arithmetic Circuits
- Reusable garbled circuits and succinct functional encryption
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Two-Round Secure MPC from Indistinguishability Obfuscation
- On lattices, learning with errors, random linear codes, and cryptography
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation from circular security
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Candidate iO from homomorphic encryption schemes
