Security analysis of a probabilistic non-repudiation protocol

DOI10.1007/3-540-45605-8_3MaRDI QIDQ4813196zbMATH OpenFDO

Authors Alessandro Aldini, Roberto Gorrieri

Publication date 13 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2399/23990017.htm

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On quantitative analysis of probabilistic protocols
• Automatic analysis of a non-repudiation protocol
• Computational probabilistic non-interference
• Non interference for the analysis of cryptographic protocols
• scientific article; zbMATH DE number 1497862

Cited in

(9)

• Non-repudiation analysis using \textsc{LySa} with annotations
• A framework for analyzing probabilistic protocols and its application to the partial secrets exchange
• Non interference for the analysis of cryptographic protocols
• On quantitative analysis of probabilistic protocols
• Towards verification of non-repudiation protocols
• scientific article; zbMATH DE number 1497862 (Why is no real title available?)
• Computational probabilistic non-interference
• A spectrum of approximate probabilistic bisimulations
• Parametric probabilistic transition systems for system design and analysis

This page was built for publication: Security analysis of a probabilistic non-repudiation protocol

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