Weakening assumptions for publicly-verifiable deletion

DOI10.1007/978-3-031-48624-1_7MaRDI QIDQ6587952zbMATH OpenFDO

Authors James Bartusek, Dakshita Khurana, Giulio Malavolta, Alexander Poremba, Michael Walter

Publication date 15 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48624-1_7

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• Certified everlasting zero-knowledge proof for QMA
• Coding theorem and strong converse for quantum channels
• scientific article; zbMATH DE number 7701522 (Why is no real title available?)
• Pseudorandom quantum states
• Public key encryption with secure key leasing
• Publicly-verifiable deletion via target-collapsing functions
• Quantum commitments and signatures without one-way functions
• Quantum cryptography in Algorithmica
• Quantum encryption with certified deletion
• Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication
• Reducing complexity assumptions for statistically-hiding commitment
• Revocable Quantum Timed-Release Encryption

Cited in

(7)

• Secret sharing with certified deletion
• Revocable quantum digital signatures
• Secret sharing with publicly verifiable deletion
• A simple framework for secure key leasing
• Non-interactive zero-knowledge arguments with certified deletion
• Publicly verifiable deletion: general compilers from minimal assumptions
• Collusion-resistant quantum secure key leasing beyond decryption

This page was built for publication: Weakening assumptions for publicly-verifiable deletion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587952)