Zeroizing attacks against evasive and circular evasive LWE
From MaRDI portal
Cites work
- Adaptively secure attribute-based encryption from witness encryption
- Adaptively sound zero-knowledge SNARKs for UP
- Attribute based encryption for Turing machines from lattices
- Attribute-based encryption for circuits of unbounded depth from lattices
- Candidate witness encryption from lattice techniques
- Counterexamples to new circular security assumptions underlying iO
- Evasive LWE assumptions: definitions, classes, and counterexamples
- Faster ABE for Turing machines from circular evasive LWE
- Lattice-based post-quantum iO from circular security with random opening assumption
- Lockable obfuscation
- Lossy Trapdoor Functions and Their Applications
- Multi-authority ABE from lattices without random oracles
- Obfuscating compute-and-compare programs under LWE
- On lattices, learning with errors, random linear codes, and cryptography
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Private constrained PRFs (and more) from LWE
- Pseudorandom functions and lattices
- Simple and general counterexamples for private-coin evasive LWE
- Stronger security for reusable garbled circuits, general definitions and attacks
- Witness encryption and its applications
- Witness encryption and null-iO from evasive LWE
This page was built for publication: Zeroizing attacks against evasive and circular evasive LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233196)