2026-08-16T17:01:27Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5393 2024-03-06T10:36:33Z ddc:004 open_access

Toward Automatic Verification of Quantum Cryptographic Protocols Feng, Yuan Ying, Mingsheng Quantum cryptographic protocols Verification Bisimulation Security Several quantum process algebras have been proposed and successfully applied in verification of quantum cryptographic protocols. All of the bisimulations proposed so far for quantum processes in these process algebras are state-based, implying that they only compare individual quantum states, but not a combination of them. This paper remedies this problem by introducing a novel notion of distribution-based bisimulation for quantum processes. We further propose an approximate version of this bisimulation that enables us to prove more sophisticated security properties of quantum protocols which cannot be verified using the previous bisimulations. In particular, we prove that the quantum key distribution protocol BB84 is sound and (asymptotically) secure against the intercept-resend attacks by showing that the BB84 protocol, when executed with such an attacker concurrently, is approximately bisimilar to an ideal protocol, whose soundness and security are obviously guaranteed, with at most an exponentially decreasing gap. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Yuan Feng and Mingsheng Ying 2015 Is Part Of LIPIcs, Volume 42, 26th International Conference on Concurrency Theory (CONCUR 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CONCUR.2015.441 urn:nbn:de:0030-drops-53936 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.441 eng https://creativecommons.org/licenses/by/3.0/legalcode