Indistinguishability obfuscation from circular security
From MaRDI portal
Cited in
(53)- 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
- COA-secure obfuscation and applications
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Secure software leasing from standard assumptions
- Succinct LWE sampling, random polynomials, and obfuscation
- Circular-Secure Encryption from Decision Diffie-Hellman
- How to use indistinguishability obfuscation
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- On the complexity of compressing obfuscation
- Obfustopia built on secret-key functional encryption
- Multi-key and multi-input predicate encryption from learning with errors
- Broadcast, trace and revoke with optimal parameters from polynomial hardness
- Structure-preserving compilers from new notions of obfuscations
- Functional encryption against probabilistic queries: definition, construction and applications
- Candidate iO from homomorphic encryption schemes
- Witness encryption and null-iO from evasive LWE
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Generic constructions of master-key KDM secure attribute-based encryption
- Instantiability of classical random-oracle-model encryption transforms
- Constant input attribute based (and predicate) encryption from evasive and tensor LWE
- Obfuscation of pseudo-deterministic quantum circuits
- Watermarking PRFs and PKE against quantum adversaries
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions
- Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
- Non-interactive anonymous router with quasi-linear router computation
- Revocable cryptography from learning with errors
- Registered (inner-product) functional encryption
- Distributed broadcast encryption from bilinear groups
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions
- Dynamic collusion functional encryption and multi-authority attribute-based encryption
- SoK: learning with errors, circular security, and fully homomorphic encryption
- Time-lock puzzles with efficient batch solving
- Software with certified deletion
- Time-lock puzzles from lattices
- Lattice-based obfuscation from NTRU and equivocal LWE
- Lattice-based post-quantum iO from circular security with random opening assumption
- Pseudorandom obfuscation and applications
- Key-homomorphic computations for RAM: fully succinct randomised encodings and more
- Gap MCSP is not (Levin) NP-complete in obfustopia
- Towards accountability in CRS generation
- Perfect indistinguishability obfuscation for Boolean polynomial vector spaces via learning
- Towards general-purpose program obfuscation via local mixing
- Indistinguishability obfuscation from well-founded assumptions
- A meta-complexity theoretic approach to indistinguishability obfuscation and witness pseudo-canonicalization
- Obfuscating pseudorandom functions is post-quantum complete
- Pseudorandom FE, iO and applications
- Attribute-based encryption for circuits of unbounded depth from lattices: garbled circuits of optimal size, laconic functional evaluation, and more
- Lower bounds on the overhead of indistinguishability obfuscation
- On circuit private, multikey and threshold approximate homomorphic encryption
- Circular insecure encryption: from long cycles to short cycles
This page was built for publication: Indistinguishability obfuscation from circular security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087040)
