Quantitative Analysis of a Probabilistic Non-repudiation Protocol through Model Checking

  title={Quantitative Analysis of a Probabilistic Non-repudiation Protocol through Model Checking},
  author={I. Saha and Debapriyay Mukhopadhyay},
In the probabilistic non-repudiation protocol without a trusted third party as presented in [5], the recipient of a service can cheat the originator of the service with some probability. This probability indicates the degree of fairness of the protocol and is referred as *** -fairness. In this paper, we analyze the protocol quantitatively through probabilistic model checking. The *** -fairness is quantitatively measured by modeling the protocol in PRISM model checker and verifying appropriate… 

A Detection and Mitigation Model for PTP Delay Attack in an IEC 61850 Substation

This paper proposes detection and mitigation mechanisms against the known PTP delay attack and applies model checking to quantify the effect of the delay attack, and results support the usefulness of the mechanism in detecting the delay attacks targeting PTP, and preserving the system functionality.

Model Checking the Kaminsky DNS Cache-Poisoning Attack Using PRISM

Of the Thesis Model Checking the Kaminsky DNS Cache-Poisoning attack using PRISM and how the model changed after being exposed to PRISM data.

Detection and Mitigation of Cyber Attacks on Time Synchronization Protocols for the Smart Grid

This thesis focuses on the substation, a basic block of the smart grid system, along with its recommended time synchronization mechanism - the Precision Time Protocol (PTP) - in order to address threats associated with PTP, and proposes practical and efficient detection, prevention, mitigation techniques and methodologies that will harden and enhance the security and usability of PTP in a substation.



Automatic Analysis of a Non-Repudiation Protocol

Security Analysis of a Probabilistic Non-repudiation Protocol

The analysis, conducted by resorting to a definition of probabilistic non-interference in the context of process algebras, confirms that a solely nondeterministic approach to the information flow theory is not enough to study the security guarantees of cryptographic protocols.

A Game-based Verification of Non-repudiation and Fair Exchange Protocols

A verification method based on the idea that non-repudiation protocols are best modeled as games is proposed, which uses alternating transition systems and alternating temporal logic, a game based logic, to express requirements that the protocols must ensure.

On Quantitative Analysis of Probabilistic Protocols

Probabilistic Non-Repudiation without Trusted Third Party

It is shown that in order to achieve complete nonrepudiation during an information transfer a trusted third party is often needed, obtaining an acknowledgement from the recipient being the current major problem.

PRISM: A Tool for Automatic Verification of Probabilistic Systems

This paper presents an overview of all the main features of PRISM, a probabilistic model checking tool which has already been successfully deployed in a wide range of application domains, from real-time communication protocols to biological signalling pathways.

Observations on Non-repudiation

The selective receipt problem and the generation of time evidence are examined, the current state of the ISO/IEC 13888 drafts on non-repudiation mechanisms are analysed, and a fair non- repudiation protocol including time evidence is presented to promote the development of these drafts.

A Temporal Logic of Nested Calls and Returns

This work introduces a temporal logic of calls and returns (CaRet) for specification and algorithmic verification of correctness requirements of structured programs and presents a tableau construction that reduces the model checking problem to the emptiness problem for a Buchi pushdown system.

Bigraphical Reactive Systems

A behavioural theory is established, using the categorical notion of relative pushout, that allows labelled transition systems to be derived uniformly for a wide variety of BRSs, in such a way that familiar behavioural preorders and equivalences, in particular bisimilarity, are congruential.

Advances in Cryptology — ASIACRYPT '96