Score: 0

Computational Certified Deletion Property of Magic Square Game and its Application to Classical Secure Key Leasing

Published: October 6, 2025 | arXiv ID: 2510.04529v2

By: Yuki Takeuchi, Duo Xu

Potential Business Impact:

Lets computers prove secrets were deleted.

Business Areas:
Quantum Computing Science and Engineering

We present the first construction of a computational Certified Deletion Property (CDP) achievable with classical communication, derived from the compilation of the non-local Magic Square Game (MSG). We leverage the KLVY compiler to transform the non-local MSG into a 2-round interactive protocol, rigorously demonstrating that this compilation preserves the game-specific CDP. Previously, the quantum value and rigidity of the compiled game were investigated. We emphasize that we are the first to investigate CDP (local randomness in [Fu and Miller, Phys. Rev. A 97, 032324 (2018)]) for the compiled game. Then, we combine this CDP with the framework [Kitagawa, Morimae, and Yamakawa, Eurocrypt 2025] to construct Secure Key Leasing with classical Lessor (cSKL). SKL enables the Lessor to lease the secret key to the Lessee and verify that a quantum Lessee has indeed deleted the key. In this paper, we realize cSKL for PKE, PRF, and digital signature. Compared to prior works for cSKL, we realize cSKL for PRF and digital signature for the first time. In addition, we succeed in weakening the assumption needed to construct cSKL.

Country of Origin
πŸ‡―πŸ‡΅ Japan

Page Count
55 pages

Category
Computer Science:
Cryptography and Security