Candidate obfuscation via oblivious LWE sampling
From MaRDI portal
Publication:2056783
Recommendations
- Succinct LWE sampling, random polynomials, and obfuscation
- Candidate iO from homomorphic encryption schemes
- Candidate iO from homomorphic encryption schemes
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
Cites work
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 7650430 (Why is no real title available?)
- Adaptively secure, universally composable, multiparty computation in constant rounds
- Advances in cryptology -- CRYPTO 2019. 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2019. Proceedings. Part III
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Attribute-based encryption for circuits
- Candidate Multilinear Maps from Ideal Lattices
- Candidate iO from homomorphic encryption schemes
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Compressible FHE with applications to PIR
- Cryptanalyses of Candidate Branching Program Obfuscators
- Cryptanalysis of GGH15 multilinear maps
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
- Cryptanalysis of the multilinear map over the integers
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Graph-induced multilinear maps from lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- 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
- Leveled fully homomorphic signatures from standard lattices
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On Best-Possible Obfuscation
- On Invertible Sampling and Adaptive Security
- On lattices, learning with errors, random linear codes, and cryptography
- Output-compressing randomized encodings and applications
- Preventing CLT attacks on obfuscation with linear overhead
- Private constrained PRFs (and more) from LWE
- Quantum attacks against indistinguishablility obfuscators proved secure in the weak multilinear map model
- Return of GGH15: provable security against zeroizing attacks
- Reusable garbled circuits and succinct functional encryption
- Statistical zeroizing attack: cryptanalysis of candidates of BP obfuscation over GGH15 multilinear map
- Theory of cryptography. 12th theory of cryptography conference, TCC 2015, Warsaw, Poland, March 23--25, 2015. Proceedings, Part II
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Two round multiparty computation via multi-key FHE
- Witness encryption from instance independent assumptions
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
Cited in
(43)- Broadcast, trace and revoke with optimal parameters from polynomial hardness
- Structure-preserving compilers from new notions of obfuscations
- Witness encryption and null-iO from evasive LWE
- Secure software leasing from standard assumptions
- Succinct LWE sampling, random polynomials, and obfuscation
- Functional encryption against probabilistic queries: definition, construction and applications
- How to construct quantum FHE, generically
- Time-lock puzzles from lattices
- Laconic function evaluation for Turing machines
- Candidate iO from homomorphic encryption schemes
- Hidden cosets and applications to unclonable cryptography
- Multi-key and multi-input predicate encryption from learning with errors
- Obfuscation of pseudo-deterministic quantum circuits
- Candidate iO from homomorphic encryption schemes
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- Non-interactive anonymous router
- Secure software leasing
- Non-interactive anonymous router with quasi-linear router computation
- Distributed broadcast encryption from bilinear groups
- Registered (inner-product) functional encryption
- Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
- Watermarking PRFs and PKE against quantum adversaries
- Dynamic collusion functional encryption and multi-authority attribute-based encryption
- SoK: learning with errors, circular security, and fully homomorphic encryption
- Time-lock puzzles with efficient batch solving
- Software with certified deletion
- Another round of breaking and making quantum money: how to not build it from lattices, and more
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Counterexamples to new circular security assumptions underlying iO
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- On the complexity of compressing obfuscation
- Lockable obfuscation from circularly insecure fully homomorphic encryption
- Candidate witness encryption from lattice techniques
- Instantiability of classical random-oracle-model encryption transforms
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions
- Obfustopia built on secret-key functional encryption
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions
- Constant input attribute based (and predicate) encryption from evasive and tensor LWE
- Tracing quantum state distinguishers via backtracking
- Cryptanalysis of candidate obfuscators for affine determinant programs
- Incompressible cryptography
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Revocable cryptography from learning with errors
This page was built for publication: Candidate obfuscation via oblivious LWE sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056783)
