Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Non-Interactive Zero-Knowledge Arguments with Certified Deletion

Kasra Abbaszadeh, Jonathan I. Katz

Published Dec 7, 2025• 0 citations
Publisher
DOI
10.1007/978-981-95-5125-5_13

Related papers

Non-interactive Zero-Knowledge Arguments for QMA, with Preprocessing

Andrea Coladangelo, Thomas Vidick, Tina Zhang

Lecture notes in computer science•Jan 1, 2020•28 citations

Cryptography with Certified Deletion

James Bartusek, Dakshita Khurana

arXiv:2207.01754•Lecture notes in computer science•Jan 1, 2023•28 citations

Software with Certified Deletion

James Bartusek, Vipul Goyal, Dakshita Khurana +3 more

Lecture notes in computer science•Jan 1, 2024•13 citations

Secret Sharing with Certified Deletion

James Bartusek, Justin Raizes

arXiv:2405.08117•Lecture notes in computer science•Jan 1, 2024•7 citations

Quantum Encryption with Certified Deletion

Anne Broadbent, Rabib Islam

arXiv:1910.03551•Lecture notes in computer science•Jan 1, 2020•47 citations

Semi-Quantum Cryptography with Certified Deletion

Yael Tauman Kalai, Justin Raizes

Certified deletion allows a client to upload encrypted data to a server as a quantum state, then later request that the server delete their data and detect whether the server complies. If verification passes, then the data on the server will remain hidden even if the decryption key is later leaked. In publicly verifiable certified deletion, the verification key is published so that anyone may check for deletion compliance. In this work, we give a general compiler to publicly verifiable certified deletion that allows the client to initially upload the *quantum* ciphertext using purely *classical* communication, assuming the post-quantum hardness of LWE in the plain model. Our approach can be applied to a wide variety of primitives, including commitments and public-key, attribute-based, identity-based, and fully-homomorphic encryption. Moreover, our constructions allow the client to classically manage the encrypted data beyond just verifying its deletion. The classical client may non-destructively audit the ciphertext via a Proof of No Intrusion to check whether it has been leaked to a third party. The classical client may also retrieve the data while simultaneously verifying its deletion from the server. Thus, they do not have to choose between retrieving the data and protecting it against future key leakage. As our core technical contribution, we give a classical-communication protocol and simulation technique that allows adapting purification-based security arguments for BB84-style states which are prepared through classical interaction. It makes the required purification available in a hybrid experiment, despite the classical transcript uniquely determining the prepared state in a real execution.

cs.CRCross-listedarXiv:2609.38915•Oct 1, 2026•0 citations
Certified deletion allows a client to upload encrypted data to a server as a quantum state, then later request that the server delete their data and detect whether the server complies. If verification passes, then the data on the server will remain hidden even if the decryption key is later leaked. In publicly verifiable certified deletion, the verification key is published so that anyone may check for deletion compliance. In this work, we give a general compiler to publicly verifiable certified deletion that allows the client to initially upload the *quantum* ciphertext using purely *classical* communication, assuming the post-quantum hardness of LWE in the plain model. Our approach can be applied to a wide variety of primitives, including commitments and public-key, attribute-based, identity-based, and fully-homomorphic encryption. Moreover, our constructions allow the client to classically manage the encrypted data beyond just verifying its deletion. The classical client may non-destructively audit the ciphertext via a Proof of No Intrusion to check whether it has been leaked to a third party. The classical client may also retrieve the data while simultaneously verifying its deletion from the server. Thus, they do not have to choose between retrieving the data and protecting it against future key leakage. As our core technical contribution, we give a classical-communication protocol and simulation technique that allows adapting purification-based security arguments for BB84-style states which are prepared through classical interaction. It makes the required purification available in a hybrid experiment, despite the classical transcript uniquely determining the prepared state in a real execution.