Automatic Analysis of a Non-Repudiation Protocol

We define a probabilistic model for the analysis of a Non-Repudiation protocol that guarantees fairness, without resorting to a trusted third party, by means of a probabilistic algorithm. By using the PRISM model checker, we estimate the probability for a malicious user to break the non-repudiation property, depending on various parameters of the protocol.

[1]  Andrea Bianco,et al.  Model Checking of Probabalistic and Nondeterministic Systems , 1995, FSTTCS.

[2]  Danièle Beauquier On probabilistic timed automata , 2003, Theor. Comput. Sci..

[3]  Marta Kwiatkowska,et al.  Verifying Quantitative Properties of Continuous Probabilistic Real-Time Graphs , 2000 .

[4]  Marta Z. Kwiatkowska,et al.  Verifying Quantitative Properties of Continuous Probabilistic Timed Automata , 2000, CONCUR.

[5]  Olivier Markowitch,et al.  Probabilistic Non-Repudiation without Trusted Third Party , 1999 .

[6]  Marta Z. Kwiatkowska,et al.  Model checking for probability and time: from theory to practice , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[7]  Marta Z. Kwiatkowska,et al.  Automatic verification of real-time systems with discrete probability distributions , 1999, Theor. Comput. Sci..

[8]  Rajeev Alur,et al.  Verifying Automata Specifications of Probabilistic Real-time Systems , 1991, REX Workshop.

[9]  Andrea Maggiolo-Schettini,et al.  Weak bisimulation for probabilistic timed automata and applications to security , 2003, First International Conference onSoftware Engineering and Formal Methods, 2003.Proceedings..

[10]  R. Segala,et al.  Automatic Verification of Real-Time Systems with Discrete Probability Distributions , 1999, ARTS.

[11]  Christel Baier,et al.  Model checking for a probabilistic branching time logic with fairness , 1998, Distributed Computing.

[12]  Roberto Gorrieri,et al.  Security Analysis of a Probabilistic Non-repudiation Protocol , 2002, PAPM-PROBMIV.

[13]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.