Pages that link to "Item:Q2055603"
From MaRDI portal
The following pages link to Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603):
Displaying 27 items.
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps (Q831181) (← links)
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs (Q1675746) (← links)
- Obfuscation from low noise multilinear maps (Q1738067) (← links)
- Classical vs quantum random oracles (Q2056754) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- Counterexamples to new circular security assumptions underlying iO (Q2128580) (← links)
- Cryptanalysis of candidate obfuscators for affine determinant programs (Q2170024) (← links)
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions (Q2170046) (← links)
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation (Q2292644) (← links)
- Secure software leasing from standard assumptions (Q2695623) (← links)
- Succinct LWE sampling, random polynomials, and obfuscation (Q2697860) (← links)
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13 (Q2829233) (← links)
- Secure Obfuscation in a Weak Multilinear Map Model (Q3181029) (← links)
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13 (Q5738782) (← links)
- Unbounded predicate inner product functional encryption from pairings (Q6109084) (← links)
- A polynomial time algorithm for breaking NTRU encryption with multiple keys (Q6109713) (← links)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) (← links)
- Witness encryption and null-iO from evasive LWE (Q6135397) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)
- Watermarking PRFs and PKE against quantum adversaries (Q6536747) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions (Q6635746) (← links)
- Lower bounds for lattice-based compact functional encryption (Q6636507) (← links)
- Certified everlasting secure collusion-resistant functional encryption, and more (Q6637338) (← links)
- An algebraic algorithm for breaking NTRU with multiple keys (Q6651896) (← links)
