Candidate iO from homomorphic encryption schemes
From MaRDI portal
Publication:2055602
DOI10.1007/978-3-030-45721-1_4zbMath1479.94137OpenAlexW3012960191MaRDI QIDQ2055602
Sanjam Garg, Zvika Brakerski, Nico Döttling, Giulio Malavolta
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45721-1_4
cryptographic hash functionFHE schemelinearly homomorphic encryption schemesplit fully-homomorphic encryption
Related Items
One-Way Functions and (Im)perfect Obfuscation ⋮ Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Counterexamples to new circular security assumptions underlying iO ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Incompressible cryptography ⋮ COA-secure obfuscation and applications ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Structure-preserving compilers from new notions of obfuscations ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Witness encryption and null-iO from evasive LWE ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Candidate witness encryption from lattice techniques ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Tracing quantum state distinguishers via backtracking ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ On the complexity of compressing obfuscation ⋮ Obfustopia built on secret-key functional encryption ⋮ Secure software leasing ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ An optimized GHV-type HE scheme: simpler, faster, and more versatile ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- When does functional encryption imply obfuscation?
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- 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
- 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
- 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
