Candidate iO from homomorphic encryption schemes
From MaRDI portal
(Redirected from Publication:6109075)
Candidate iO from homomorphic encryption schemes (scientific article; zbMATH DE number 7719404)
Candidate iO from homomorphic encryption schemes (scientific article; zbMATH DE number 7719404)
Recommendations
- Candidate iO from homomorphic encryption schemes
- Candidate obfuscation via oblivious LWE sampling
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from constant-degree graded encoding schemes
Cites work
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
- Amplifying the security of functional encryption, unconditionally
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Bounded key-dependent message security
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate Multilinear Maps from Ideal Lattices
- Candidate obfuscation via oblivious LWE sampling
- Counterexamples to new circular security assumptions underlying iO
- Cryptanalyses of Candidate Branching Program Obfuscators
- Cryptanalysis of GGH map
- Cryptanalysis of the multilinear map over the integers
- Faster Bootstrapping with Polynomial Error
- From cryptomania to obfustopia through secret-key functional encryption
- Fully homomorphic encryption using ideal lattices
- Graph-induced multilinear maps from lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic time-lock puzzles and applications
- How to Garble Arithmetic Circuits
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 1583797 (Why is no real title available?)
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Indistinguishability obfuscation from circular security
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation with non-trivial efficiency
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Lattice-based FHE as secure as PKE
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- On lattices, learning with errors, random linear codes, and cryptography
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Practical multilinear maps over the integers
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Protecting obfuscation against algebraic attacks
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Reusable garbled circuits and succinct functional encryption
- Sanitization of FHE ciphertexts
- Secure Obfuscation in a Weak Multilinear Map Model
- Succinct LWE sampling, random polynomials, and obfuscation
- Sum-of-squares meets program obfuscation, revisited
- Two-round secure MPC from indistinguishability obfuscation
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
Cited in
(6)- Candidate iO from homomorphic encryption schemes
- Candidate obfuscation via oblivious LWE sampling
- Time-lock puzzles from lattices
- Gap MCSP is not (Levin) NP-complete in obfustopia
- A meta-complexity theoretic approach to indistinguishability obfuscation and witness pseudo-canonicalization
- Lower bounds on the overhead of indistinguishability obfuscation
This page was built for publication: Candidate iO from homomorphic encryption schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6109075)
