Revocable cryptography from learning with errors

DOI10.1007/978-3-031-48624-1_4MaRDI QIDQ6587947zbMATH OpenFDO

Authors Prabhanjan Ananth, Alexander Poremba, Vinod Vaikuntanathan

Publication date 15 August 2024

zbMATH Keywords

quantum cryptographypseudorandom functions

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• On Quantum Chosen-Ciphertext Attacks and Learning with Errors
• Post-quantum insecurity from LWE
• Quantum cryptography beyond quantum key distribution
• Revocable Quantum Timed-Release Encryption
• Revocable quantum timed-release encryption

Cites work

• scientific article; zbMATH DE number 5009201 (Why is no real title available?)
• scientific article; zbMATH DE number 3825698 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1256784 (Why is no real title available?)
• scientific article; zbMATH DE number 2086396 (Why is no real title available?)
• scientific article; zbMATH DE number 7651031 (Why is no real title available?)
• 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
• A single quantum cannot be cloned
• Candidate obfuscation via oblivious LWE sampling
• Certified everlasting zero-knowledge proof for QMA
• Classical verification of quantum computations
• Collusion resistant copy-protection for watermarkable functionalities
• Constructive post-quantum reductions
• Cryptography with certified deletion
• Efficient fully homomorphic encryption from (standard) LWE
• Efficient public key encryption based on ideal lattices (extended abstract)
• Fully homomorphic encryption using ideal lattices
• Functional encryption with secure key leasing
• GGH15 beyond permutation branching programs: proofs, attacks, and candidates
• Hidden cosets and applications to unclonable cryptography
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Indistinguishability obfuscation from circular security
• Indistinguishability obfuscation from well-founded assumptions
• New approaches for quantum copy-protection
• On lattices, learning with errors, random linear codes, and cryptography
• On the feasibility of unclonable encryption, and more
• Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits
• Pseudorandom functions and lattices
• Public-key encryption schemes with auxiliary inputs
• Publicly-verifiable deletion via target-collapsing functions
• Quantum cryptography: public key distribution and coin tossing
• Quantum encryption with certified deletion
• Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication
• Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
• Revocable quantum timed-release encryption
• Secure software leasing
• Secure software leasing from standard assumptions
• Secure software leasing without assumptions
• Succinct LWE sampling, random polynomials, and obfuscation
• Trapdoors for hard lattices and new cryptographic constructions
• Unclonable encryption, revisited
• Uncloneable encryption

Cited in

(1)

• A modular approach to unclonable cryptography

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)