Revocable cryptography from learning with errors
From MaRDI portal
Publication:6587947
DOI10.1007/978-3-031-48624-1_4zbMATH Open1545.94049MaRDI QIDQ6587947
Prabhanjan Ananth, Vinod Vaikuntanathan, Alexander Poremba
Publication date: 15 August 2024
Artificial neural networks and deep learning (68T07) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum cryptography: public key distribution and coin tossing
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Secure software leasing
- Candidate obfuscation via oblivious LWE sampling
- Quantum encryption with certified deletion
- New approaches for quantum copy-protection
- Hidden cosets and applications to unclonable cryptography
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
- Secure software leasing from standard assumptions
- Secure software leasing without assumptions
- Unclonable encryption, revisited
- Succinct LWE sampling, random polynomials, and obfuscation
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Pseudorandom Functions and Lattices
- Public-Key Encryption Schemes with Auxiliary Inputs
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient Public Key Encryption Based on Ideal Lattices
- 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
- Classical Verification of Quantum Computations
- Fully homomorphic encryption using ideal lattices
- A single quantum cannot be cloned
- Revocable Quantum Timed-Release Encryption
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits
- On lattices, learning with errors, random linear codes, and cryptography
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation from circular security
- Certified everlasting zero-knowledge proof for QMA
- On the feasibility of unclonable encryption, and more
- Collusion resistant copy-protection for watermarkable functionalities
- Functional encryption with secure key leasing
- Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication
- Constructive post-quantum reductions
- Publicly-verifiable deletion via target-collapsing functions
- Cryptography with certified deletion
Related Items (1)
This page was built for publication: Revocable cryptography from learning with errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587947)
