Semi-automated verification of security proofs of quantum cryptographic protocols
DOI10.1016/J.JSC.2015.05.001zbMATH Open1336.68164OpenAlexW1430738455WikidataQ113869841 ScholiaQ113869841MaRDI QIDQ491263FDOQ491263
Authors: Takahiro Kubota, Yoshihiko Kakutani, Go Kato, Y. Kawano, Hideki Sakurada 
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
Recommendations
- Toward automatic verification of quantum cryptographic protocols
- Security analysis of semi-quantum cryptography protocols by model checking
- Specification and verification of quantum protocols
- A formal approach to unconditional security proofs for quantum key distribution
- Model checking quantum Markov chains
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)
Cites Work
- Quantum computation and quantum information. 10th anniversary edition
- Unconditional security in quantum cryptography
- New directions in cryptography
- Title not available (Why is that?)
- Quantum cryptography using any two nonorthogonal states
- Towards a quantum programming language
- Automata, Languages and Programming
- Title not available (Why is that?)
- Probabilistic bisimulations for quantum processes
- A process algebra for reasoning about quantum security
- Open bisimulation for quantum processes
- An algebra of quantum processes
- Proof of unconditional security of six-state quantum key distribution scheme
- Analysis of a quantum error correcting code using quantum process calculus
- Equivalence checking of quantum protocols
- Bisimulation for quantum processes
- Relations among quantum processes: bisimilarity and congruence
Cited In (9)
- Toward automatic verification of quantum cryptographic protocols
- Verifying quantum communication protocols with ground bisimulation
- On well-founded and recursive coalgebras
- Automated verification of quantum protocols using \textsc{mcmas}
- verifier
- Symbolic bisimulation for quantum processes
- Security analysis of semi-quantum cryptography protocols by model checking
- Bisimulations for probabilistic and quantum processes (invited paper)
- Toward automatic verification of quantum programs
Uses Software
This page was built for publication: Semi-automated verification of security proofs of quantum cryptographic protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491263)
