A Process Algebra for Reasoning About Quantum Security

DOI10.1016/j.entcs.2006.12.009zbMath1277.68157OpenAlexW2149748279WikidataQ59196682 ScholiaQ59196682MaRDI QIDQ2864166

Paulo Mateus, Pedro 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)

Related Items (2)

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

Cites Work

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

This page was built for publication: A Process Algebra for Reasoning About Quantum Security