Candidate obfuscation via oblivious LWE sampling
From MaRDI portal
Publication:2056783
DOI10.1007/978-3-030-77883-5_5zbMATH Open1479.94270OpenAlexW3089736144MaRDI QIDQ2056783FDOQ2056783
Authors: Hoeteck Wee, Daniel Wichs 
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_5
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
- On lattices, learning with errors, random linear codes, and cryptography
- Title not available (Why is that?)
- Leveled fully homomorphic signatures from standard lattices
- Attribute-based encryption for circuits
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- On Best-Possible Obfuscation
- Candidate Multilinear Maps from Ideal Lattices
- Reusable garbled circuits and succinct functional encryption
- Cryptanalysis of the multilinear map over the integers
- Title not available (Why is that?)
- Adaptively secure, universally composable, multiparty computation in constant rounds
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Quantum attacks against indistinguishablility obfuscators proved secure in the weak multilinear map model
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Statistical zeroizing attack: cryptanalysis of candidates of BP obfuscation over GGH15 multilinear map
- Cryptanalysis of GGH15 multilinear maps
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from functional encryption
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
- Graph-induced multilinear maps from lattices
- Cryptanalyses of Candidate Branching Program Obfuscators
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Return of GGH15: provable security against zeroizing attacks
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Private constrained PRFs (and more) from LWE
- Output-compressing randomized encodings and applications
- Indistinguishability obfuscation with non-trivial efficiency
- Witness encryption from instance independent assumptions
- Two round multiparty computation via multi-key FHE
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Advances in cryptology -- CRYPTO 2019. 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2019. Proceedings. Part III
- 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
- Preventing CLT attacks on obfuscation with linear overhead
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Theory of cryptography. 12th theory of cryptography conference, TCC 2015, Warsaw, Poland, March 23--25, 2015. Proceedings, Part II
- Candidate iO from homomorphic encryption schemes
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Compressible FHE with applications to PIR
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- On Invertible Sampling and Adaptive Security
- Title not available (Why is that?)
Cited In (43)
- 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} \)
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions
- Structure-preserving compilers from new notions of obfuscations
- Candidate iO from homomorphic encryption schemes
- Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
- Hidden cosets and applications to unclonable cryptography
- Multi-key and multi-input predicate encryption from learning with errors
- Non-interactive anonymous router with quasi-linear router computation
- Revocable cryptography from learning with errors
- Counterexamples to new circular security assumptions underlying iO
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- Lockable obfuscation from circularly insecure fully homomorphic encryption
- Distributed broadcast encryption from bilinear groups
- Registered (inner-product) functional encryption
- On the complexity of compressing obfuscation
- Laconic function evaluation for Turing machines
- Candidate witness encryption from lattice techniques
- Instantiability of classical random-oracle-model encryption transforms
- Constant input attribute based (and predicate) encryption from evasive and tensor LWE
- Tracing quantum state distinguishers via backtracking
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions
- Obfustopia built on secret-key functional encryption
- Cryptanalysis of candidate obfuscators for affine determinant programs
- Incompressible cryptography
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Candidate iO from homomorphic encryption schemes
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- Non-interactive anonymous router
- Secure software leasing
- 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
- Secure software leasing from standard assumptions
- How to construct quantum FHE, generically
- Succinct LWE sampling, random polynomials, and obfuscation
- Time-lock puzzles from lattices
- Obfuscation of pseudo-deterministic quantum circuits
- Witness encryption and null-iO from evasive LWE
- Broadcast, trace and revoke with optimal parameters from polynomial hardness
- Watermarking PRFs and PKE against quantum adversaries
- Functional encryption against probabilistic queries: definition, construction and applications
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)
