A classical proof of quantum knowledge for multi-prover interactive proof systems
IACR Communications in Cryptology · 04.05.2026 · 3 (1)
DOI: 10.62056/a0txomja5 ↗Kurz gefasst
Fachartikel in der Zeitschrift IACR Communications in Cryptology, online erschienen am 04.05.2026. Verfasst von Anne Broadbent und 3 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 38 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
In a proof of knowledge (PoK), a verifier becomes convinced that a prover possesses privileged information. In combination with zero-knowledge proof systems, PoKs play an important role in security protocols such as in digital signatures and authentication schemes, as they enable a prover to demonstrate possession of certain information (such as a private key or a credential), without revealing it. A PoK is formally defined via the existence of an extractor, which is capable of reconstructing the key information that makes a verifier accept, given oracle access to any accepting prover. We extend this concept to the setting of a single classical verifier and multiple quantum provers and present the first statistical zero-knowledge (ZK) PoK proof system for problems in QMA. To achieve this, we establish the PoK property for the ZK protocol of Broadbent, Mehta, and Zhao (TQC 2024), which applies to the local Hamiltonian problem. More specifically, we construct an extractor which, given oracle access to a provers' strategy that leads to high acceptance probability, is able to reconstruct the ground state of a local Hamiltonian. Our result can be seen as a new form of self-testing, where, in addition to certifying a pre-shared entangled state, the verifier also certifies that provers have access to a quantum system, in particular, a ground state; this indicates a new level of verification for a proof of quantumness.
Zitieren
APA
Broadbent, A., Grilo, A., Hara, N., & Mehta, A. (2026). A classical proof of quantum knowledge for multi-prover interactive proof systems. IACR Communications in Cryptology, 3(1). https://doi.org/10.62056/a0txomja5
Vancouver
Broadbent A, Grilo A, Hara N, Mehta A. A classical proof of quantum knowledge for multi-prover interactive proof systems. IACR Communications in Cryptology. 2026;3(1). doi:10.62056/a0txomja5
BibTeX
@article{Broadbent2026,
author = {Broadbent, Anne and Grilo, Alex and Hara, Nagisa and Mehta, Arthur},
title = {A classical proof of quantum knowledge for multi-prover interactive proof systems},
journal = {IACR Communications in Cryptology},
year = {2026},
volume = {3},
number = {1},
doi = {10.62056/a0txomja5}
}
EUVIMED