Verification of Quantum Protocols with a Probabilistic Model-Checker

Tavala, Amir M.; Nazem, Soroosh; Babaei-Brojeny, Ali A.

doi:10.1016/j.entcs.2011.01.016

Cited by 2 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several papers verify the security of the BB84 quantum key distribution (QKD) protocol. [28,44] show security against a very simple, specific intercept-resend attack (that measures all qubits in a random basis), [34,35] verify one step of the Shor-Preskill proof [41] for QKD. It is not clear whether these approaches can scale to the full proof of QKD.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Quantum relational Hoare logic

Unruh

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We present a logic for reasoning about pairs of interactive quantum programs -quantum relational Hoare logic (qRHL). This logic follows the spirit of probabilistic relational Hoare logic (Barthe et al. 2009) and allows us to formulate how the outputs of two quantum programs relate given the relationship of their inputs. Probabilistic RHL was used extensively for computer-verified security proofs of classical cryptographic protocols. Since pRHL is not suitable for analyzing quantum cryptography, we present qRHL as a replacement, suitable for the security analysis of post-quantum cryptography and quantum protocols. The design of qRHL poses some challenges unique to the quantum setting, e.g., the definition of equality on quantum registers. Finally, we implemented a tool for verifying proofs in qRHL and developed several example security proofs in it.

show abstract

Section: Related Workmentioning

confidence: 99%

“…That is, we invoke Claim 7 with V c := V c,mc , V d := V d,m d , V e := V e,me (as defined on page 57), ρ cd :=ρ cd,mcm d ,ρ de :=ρ de,m d me (defined in (41), (43)),ρ d :=ρ d,mcm d me (from Claim 6). The assumptions of Claim 7 where shown in (42), (44), and Claim 6. Then by Claim 7, there exists a separableρ cd,…”

Section: Proof Of Claimmentioning

confidence: 99%