analiza aiqbench
This research presents a compiler for publicly verifiable certified deletion, enabling clients to upload quantum ciphertexts via classical communication while ensuring data remains hidden even if decryption keys are later compromised. The protocol allows for non-destructive auditing and simultaneous data retrieval with deletion verification, leveraging post-quantum hardness assumptions like LWE to secure diverse encryption primitives against future key leaks.
Semi-Quantum Cryptography with Certified Deletion
arXiv:2609.38915v1 Announce Type: cross Abstract: 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.
Abstract: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.
Cryptography and Security (cs.CR); Quantum Physics (quant-ph)
arXiv:2609.38915 [cs.CR]
(or arXiv:2609.38915v1 [cs.CR] for this version)
https://doi.org/10.48550/arXiv.2609.38915 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 351 cuvinte
Subiecte conexe

Quantum randomness confirmed on a chip with 10-sigma certainty
Quantum Zeitgeist · 5 aug. 2026
Researchers Certify High-Speed Randomness from Semiconductor Noise
Quantum Zeitgeist · 10 sept. 2026
Randomness can be certified in energy-constrained semi-device-independent scenarios
arXiv · 28 aug. 2026
Computational Certified Deletion Property of Magic Square Game and its Application to Classical Secure Key Leasing
arXiv · 15 sept. 2026