Semi-automated verification of security proofs of quantum cryptographic protocols

DOI Web Site Web Site 参考文献26件

書誌事項

公開日
2016-03
資源種別
journal article
権利情報
  • https://www.elsevier.com/tdm/userlicense/1.0/
  • https://www.elsevier.com/legal/tdmrep-license
  • http://www.elsevier.com/open-access/userlicense/1.0/
DOI
  • 10.1016/j.jsc.2015.05.001
公開者
Elsevier BV

この論文をさがす

説明

This paper presents a formal framework for semi-automated verification of security proofs of quantum cryptographic protocols. We simplify the syntax and operational semantics of quantum process calculus qCCS so that verification of weak bisimilarity of configurations becomes easier. In addition, we generalize qCCS to handle security parameters and quantum states symbolically. We then prove the soundness of the proposed framework. A software tool, named the verifier, is implemented and applied to the verification of Shor and Preskill's unconditional security proof of BB84. As a result, we succeed in verifying the main part in Shor and Preskill's unconditional security proof of BB84 against an unlimited adversary's attack semi-automatically, i.e., it is automatic except for giving user-defined equations.

収録刊行物

参考文献 (26)*注記

もっと見る

関連プロジェクト

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ