A process algebra for reasoning about quantum security

DOI10.1016/J.ENTCS.2006.12.009MaRDI QIDQ2864166zbMATH OpenOpenAlexDBLPWikidataFDO

Authors P. Adão, Paulo Mateus

Publication date 6 December 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2006.12.009

zbMATH Keywords

quantum polynomial-time machinesquantum process algebrasquantum zero-knowledge proofs

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)

Recommendations

• Classical knowledge for quantum security
• An algebra of quantum processes
• Toward automatic verification of quantum cryptographic protocols
• Bisimulation for quantum processes
• Equational reasoning about quantum protocols

Cites work

• A calculus for cryptographic protocols: The spi calculus
• A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
• Communicating quantum processes
• Composition of cryptographic protocols in a probabilistic polynomial-time process calculus.
• Logics in Artificial Intelligence
• Time bounded random access machines
• Weakly complete axiomatization of exogenous quantum propositional logic

Cited in

(5)

• An algebra of quantum processes
• Programming with quantum communication
• Distributed quantum programming
• Semi-automated verification of security proofs of quantum cryptographic protocols
• Classical knowledge for quantum security

This page was built for publication: A process algebra for reasoning about quantum security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864166)