Semi-automated verification of security proofs of quantum cryptographic protocols

DOI10.1016/j.jsc.2015.05.001zbMath1336.68164OpenAlexW1430738455WikidataQ113869841 ScholiaQ113869841MaRDI QIDQ491263

Takahiro Kubota, Yoshihiko Kakutani, Go Kato, Hideki Sakurada, Yasuhito Kawano

Publication date: 24 August 2015

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2015.05.001

zbMATH Keywords

formal methodsprocess calculiquantum key distributionquantum protocolssemi-automated verification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (6)

On well-founded and recursive coalgebras ⋮ Unnamed Item ⋮ Toward automatic verification of quantum programs ⋮ Verifying quantum communication protocols with ground bisimulation ⋮ Symbolic Bisimulation for Quantum Processes ⋮ verifier

Uses Software

• PRISM
• QPL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic bisimulations for quantum processes
• A Process Algebra for Reasoning About Quantum Security
• Open Bisimulation for Quantum Processes
• An algebra of quantum processes
• Quantum Computation and Quantum Information
• Unconditional security in quantum cryptography
• New directions in cryptography
• Quantum cryptography using any two nonorthogonal states
• Towards a quantum programming language
• Equivalence Checking of Quantum Protocols
• Bisimulation for quantum processes
• Relations among quantum processes: bisimilarity and congruence
• Automata, Languages and Programming

This page was built for publication: Semi-automated verification of security proofs of quantum cryptographic protocols