Counterexamples to new circular security assumptions underlying iO
From MaRDI portal
Publication:2128580
DOI10.1007/978-3-030-84245-1_23zbMath1486.94109OpenAlexW3173807823MaRDI QIDQ2128580
Sam Hopkins, Huijia Lin, Aayush Jain
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_23
Related Items (8)
Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Witness encryption and null-iO from evasive LWE ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Secure software leasing from standard assumptions ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Candidate iO from homomorphic encryption schemes ⋮ Obfustopia built on secret-key functional encryption
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Four round secure computation without setup
- 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
- Candidate obfuscation via oblivious LWE sampling
- 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}\)
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- New Circular Security Counterexamples from Decision Linear and Learning with Errors
- (Leveled) fully homomorphic encryption without bootstrapping
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- New Definitions and Separations for Circular Security
- Obfuscation ⇒ (IND-CPA Security $\not\Rightarrow$ Circular Security)
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Candidate One-Way Functions Based on Expander Graphs
- Secure Obfuscation in a Weak Multilinear Map Model
- Cryptographic Agility and Its Relation to Circular Encryption
- A Framework for Efficient and Composable Oblivious Transfer
- Secure Arithmetic Computation with No Honest Majority
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- On the Circular Security of Bit-Encryption
- Fully homomorphic encryption using ideal lattices
- Separations in Circular Security for Arbitrary Length Key Cycles
- Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- 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: Counterexamples to new circular security assumptions underlying iO
