Publicly-verifiable deletion via target-collapsing functions

DOI10.1007/978-3-031-38554-4_4arXiv2303.08676OpenAlexW4385654135MaRDI QIDQ6190132

James Bartusek, Alexander Poremba, Dakshita Khurana

Publication date: 6 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.08676

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum cryptography: public key distribution and coin tossing
• Reducing complexity assumptions for statistically-hiding commitment
• Secure software leasing
• Quantum encryption with certified deletion
• Revisiting post-quantum Fiat-Shamir
• Collapse-Binding Quantum Commitments Without Random Oracles
• Revocable Quantum Timed-Release Encryption
• Long-Term Security and Universal Composability
• Efficient Public Key Encryption Based on Ideal Lattices
• Computationally Binding Quantum Commitments
• Certified everlasting zero-knowledge proof for QMA
• The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
• Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication

This page was built for publication: Publicly-verifiable deletion via target-collapsing functions