On quantitative analysis of probabilistic protocols

MaRDI QIDQ2849850zbMATH OpenFDO

Authors Alessandro Aldini, Alessandra Di Pierro

Publication date 20 September 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066104052466

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) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• scientific article; zbMATH DE number 2090701
• Automatic analysis of a non-repudiation protocol
• scientific article; zbMATH DE number 1692932
• A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
• Trustworthy Global Computing

Cited in

(10)

• Abstractions of non-interference security: probabilistic versus possibilistic
• Assumption-based analysis of distance-bounding protocols with \textsc{cpsa}
• Probabilistic annotations for protocol models. Dedicated to Joshua Guttman
• A framework for analyzing probabilistic protocols and its application to the partial secrets exchange
• A quantitative study of two attacks
• Automatic analysis of a non-repudiation protocol
• Compositional closure for Bayes risk in probabilistic noninterference
• scientific article; zbMATH DE number 2090701 (Why is no real title available?)
• Trustworthy Global Computing
• Quantitative aspects of programming languages and systems over the past 2⁴ years and beyond

This page was built for publication: On quantitative analysis of probabilistic protocols

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