Lattice-based post-quantum iO from circular security with random opening assumption
From MaRDI portal
Cites work
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate iO from homomorphic encryption schemes
- Candidate Multilinear Maps from Ideal Lattices
- Candidate obfuscation via oblivious LWE sampling
- Candidate witness encryption from lattice techniques
- Counterexamples to new circular security assumptions underlying iO
- Cryptanalysis of GGH map
- Cryptanalysis of the multilinear map over the integers
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Evasive LWE assumptions: definitions, classes, and counterexamples
- Factoring and pairings are not necessary for iO: circular-secure LWE suffices
- Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures
- Fully homomorphic encryption using ideal lattices
- Graph-induced multilinear maps from lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to Generate and Use Universal Samplers
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 7650430 (Why is no real title available?)
- Indistinguishability obfuscation and UCEs: the case of computationally unpredictable sources
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Indistinguishability obfuscation from circular security
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Indistinguishability obfuscation from DDH-like assumptions on constant-degree graded encodings
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- 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 maps: attacks and fixes for noisy linear FE
- 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 post-quantum iO from circular security with random opening assumption
- Lockable obfuscation
- Multi-input functional encryption
- New Multilinear Maps Over the Integers
- Obfuscating compute-and-compare programs under LWE
- Obfuscation from low noise multilinear maps
- On the cryptographic hardness of finding a Nash equilibrium
- One-Time Programs
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits
- Practical multilinear maps over the integers
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Protecting obfuscation against algebraic attacks
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
- Succinct LWE sampling, random polynomials, and obfuscation
- Sum-of-squares meets program obfuscation, revisited
- Towards general-purpose program obfuscation via local mixing
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Watermarking cryptographic capabilities
- Witness encryption and null-iO from evasive LWE
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
Cited in
(11)- Simple and general counterexamples for private-coin evasive LWE
- Lattice-based obfuscation from NTRU and equivocal LWE
- Lattice-based post-quantum iO from circular security with random opening assumption
- Pseudorandom obfuscation and applications
- Fully adaptive decentralized MA-ABE: simplified, optimized, ASP supported
- Succinct witness encryption for batch languages and applications
- Obfuscating pseudorandom functions is post-quantum complete
- Pseudorandom FE, iO and applications
- Zeroizing attacks against evasive and circular evasive LWE
- Distributed monotone-policy encryption for DNFs from lattices
- A note on obfuscation-based attacks on private-coin evasive LWE
This page was built for publication: Lattice-based post-quantum iO from circular security with random opening assumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862544)
