Obfuscating pseudorandom functions is post-quantum complete
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 7650430 (Why is no real title available?)
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- Candidate iO from homomorphic encryption schemes
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate obfuscation via oblivious LWE sampling
- Candidate witness encryption from lattice techniques
- Counterexamples to new circular security assumptions underlying iO
- Factoring and pairings are not necessary for iO: circular-secure LWE suffices
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation from DDH-like assumptions on constant-degree graded encodings
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Indistinguishability obfuscation from circular security
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation with non-trivial efficiency
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Lattice-based post-quantum iO from circular security with random opening assumption
- On lattices, learning with errors, random linear codes, and cryptography
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Output-compressing randomized encodings and applications
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Protecting obfuscation against algebraic attacks
- Secure Obfuscation in a Weak Multilinear Map Model
- Simple and general counterexamples for private-coin evasive LWE
- Simultaneous-message and succinct secure computation
- Succinct LWE sampling, random polynomials, and obfuscation
- The pseudorandom oracle model and ideal obfuscation
- Towards general-purpose program obfuscation via local mixing
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
This page was built for publication: Obfuscating pseudorandom functions is post-quantum complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233194)
