Succinct LWE sampling, random polynomials, and obfuscation
From MaRDI portal
Publication:2697860
DOI10.1007/978-3-030-90453-1_9OpenAlexW3212190103MaRDI QIDQ2697860
Hoeteck Wee, Lalita Devadas, Willy Quach, Vinod Vaikuntanathan, Daniel Wichs
Publication date: 13 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90453-1_9
Related Items (8)
Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ COA-secure obfuscation and applications ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Witness encryption and null-iO from evasive LWE ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Constant input attribute based (and predicate) encryption from evasive and tensor LWE ⋮ Tracing quantum state distinguishers via backtracking ⋮ Candidate iO from homomorphic encryption schemes
Cites Work
- Functional encryption for bounded collusions, revisited
- Private constrained PRFs (and more) from LWE
- Candidate iO from homomorphic encryption schemes
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Candidate obfuscation via oblivious LWE sampling
- Counterexamples to new circular security assumptions underlying iO
- 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
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Sum-of-squares meets program obfuscation, revisited
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Indistinguishability Obfuscation with Non-trivial Efficiency
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Faster Bootstrapping with Polynomial Error
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Succinct Randomized Encodings and their Applications
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Indistinguishability Obfuscation from Compact Functional Encryption
- On Best-Possible Obfuscation
- A Framework for Efficient and Composable Oblivious Transfer
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Public-key cryptosystems from the worst-case shortest vector problem
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Two Round Multiparty Computation via Multi-key FHE
- On lattices, learning with errors, random linear codes, and cryptography
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation from circular security
This page was built for publication: Succinct LWE sampling, random polynomials, and obfuscation
