Candidate obfuscation via oblivious LWE sampling
From MaRDI portal
Publication:2056783
DOI10.1007/978-3-030-77883-5_5zbMath1479.94270OpenAlexW3089736144MaRDI QIDQ2056783
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_5
Related Items
Hidden cosets and applications to unclonable cryptography, Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration, Counterexamples to new circular security assumptions underlying iO, Cryptanalysis of candidate obfuscators for affine determinant programs, Incompressible cryptography, Optimal broadcast encryption and CP-ABE from evasive lattice assumptions, Multi-key and multi-input predicate encryption from learning with errors, Broadcast, trace and revoke with optimal parameters from polynomial hardness, Laconic function evaluation for Turing machines, Structure-preserving compilers from new notions of obfuscations, Functional encryption against probabilistic queries: definition, construction and applications, Witness encryption and null-iO from evasive LWE, Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \), Another round of breaking and making quantum money: how to not build it from lattices, and more, Candidate witness encryption from lattice techniques, Lockable obfuscation from circularly insecure fully homomorphic encryption, 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, Secure software leasing from standard assumptions, Succinct LWE sampling, random polynomials, and obfuscation, On the complexity of compressing obfuscation, Candidate iO from homomorphic encryption schemes, Obfustopia built on secret-key functional encryption, Secure software leasing, Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments, Non-interactive anonymous router
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum attacks against indistinguishablility obfuscators proved secure in the weak multilinear map model
- Return of GGH15: provable security against zeroizing attacks
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Private constrained PRFs (and more) from LWE
- Preventing CLT attacks on obfuscation with linear overhead
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Candidate iO from homomorphic encryption schemes
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Compressible FHE with applications to PIR
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Theory of cryptography. 12th theory of cryptography conference, TCC 2015, Warsaw, Poland, March 23--25, 2015. Proceedings, Part II
- Advances in cryptology -- CRYPTO 2019. 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2019. Proceedings. Part III
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Statistical zeroizing attack: cryptanalysis of candidates of BP obfuscation over GGH15 multilinear map
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Output-Compressing Randomized Encodings and Applications
- Indistinguishability Obfuscation with Non-trivial Efficiency
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Cryptanalysis of GGH15 Multilinear Maps
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Witness Encryption from Instance Independent Assumptions
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Cryptanalysis of the Multilinear Map over the Integers
- On Invertible Sampling and Adaptive Security
- Indistinguishability Obfuscation from Compact Functional Encryption
- On Best-Possible Obfuscation
- Indistinguishability Obfuscation from Functional Encryption
- Candidate Multilinear Maps from Ideal Lattices
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
- Graph-Induced Multilinear Maps from Lattices
- Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
- Cryptanalyses of Candidate Branching Program Obfuscators
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Attribute-based encryption for circuits
- Reusable garbled circuits and succinct functional encryption
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Two Round Multiparty Computation via Multi-key FHE
- On lattices, learning with errors, random linear codes, and cryptography
