Composition of cryptographic protocols in a probabilistic polynomial-time process calculus.

DOI10.1007/B11938MaRDI QIDQ5900575zbMATH OpenOpenAlexFDO

Authors

Publication date 30 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11938

zbMATH Keywords

composition theoremcomputational securitycryptographic protocolsprobabilistic process calculus

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cryptography (94A60)

Recommendations

• A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• scientific article; zbMATH DE number 1692932
• scientific article; zbMATH DE number 1487486
• A calculus for cryptographic protocols: The spi calculus

Cited in

(16)

• Analyzing security protocols using time-bounded task-PIOAs
• Task-structured probabilistic I/O automata
• A simple framework for real-time cryptographic protocol analysis with compositional proof rules
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• scientific article; zbMATH DE number 1692932 (Why is no real title available?)
• Simulation and analysis of cryptographic protocols
• Probabilistic Termination and Composability of Cryptographic Protocols
• A process algebra for reasoning about quantum security
• On using probabilistic Turing machines to model participants in cryptographic protocols
• scientific article; zbMATH DE number 2009954 (Why is no real title available?)
• scientific article; zbMATH DE number 1487486 (Why is no real title available?)
• A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
• scientific article; zbMATH DE number 7300321 (Why is no real title available?)
• Trustworthy Global Computing
• Compositional Methods for Information-Hiding
• A computational interpretation of Dolev-Yao adversaries

This page was built for publication: Composition of cryptographic protocols in a probabilistic polynomial-time process calculus.

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