Obfuscating compute-and-compare programs under LWE
From MaRDI portal
Cited in
(23)- Dynamic decentralized functional encryption: generic constructions with strong security
- Multi-client attribute-based and predicate encryption from standard assumptions
- Multi-authority functional encryption with bounded collusions from standard assumptions
- Unbounded leakage-resilience and intrusion-detection in a quantum world
- Key-homomorphic and aggregate verifiable random functions
- Indistinguishability obfuscation from well-founded assumptions
- Obfuscation of evasive algebraic set membership
- Succinct witness encryption for batch languages and applications
- Fully-homomorphic encryption from lattice isomorphism
- Zeroizing attacks against evasive and circular evasive LWE
- Foundations of single-decryptor encryption
- One-time memories secure against depth-bounded quantum circuits
- Lattice-based post-quantum iO from circular security with random opening assumption
- Pseudorandom obfuscation and applications
- Fully anonymous secret sharing
- A note on adaptive security in hierarchical identity-based encryption
- PKE and ABE with collusion-resistant secure key leasing
- Optimal traitor tracing from pairings
- Secret sharing with publicly verifiable deletion
- On quantum money and evasive obfuscation
- Universal computational extractors and multi-bit AIPO from lattice assumptions
- Post-quantum PKE from unstructured noisy linear algebraic assumptions: beyond LWE and Alekhnovich's LPN
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
This page was built for publication: Obfuscating compute-and-compare programs under LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946325)
