A process algebra for reasoning about quantum security

DOI10.1016/J.ENTCS.2006.12.009zbMATH Open1277.68157DBLPjournals/entcs/AdaoM07OpenAlexW2149748279WikidataQ59196682 ScholiaQ59196682MaRDI QIDQ2864166FDOQ2864166

Paulo Mateus, P. Adão

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)

Cites Work

• A calculus for cryptographic protocols: The spi calculus
• Weakly complete axiomatization of exogenous quantum propositional logic
• Time bounded random access machines
• A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols
• CONCUR 2003 - Concurrency Theory
• Communicating quantum processes
• Logics in Artificial Intelligence

Cited In (2)

• Distributed quantum programming
• Semi-automated verification of security proofs of quantum cryptographic protocols

   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 👍 👎

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)