Revocable cryptography from learning with errors

DOI10.1007/978-3-031-48624-1_4zbMATH Open1545.94049MaRDI QIDQ6587947FDOQ6587947

Authors: Prabhanjan Ananth, Alexander Poremba, Vinod Vaikuntanathan 

Publication date: 15 August 2024

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

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)

Cites Work

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

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)