Fairness analysis of extra-gain guilty of a non-repudiation protocol

Abstract

Many traditional applications can be refined thanks to the development of blockchain technology. One of these services is non-repudiation, in which participants in a communication process cannot deny their involvement. Due to the vulnerabilities of the non-repudiation protocols, one of the parties involved in the communication can often avoid non-repudiation rules and obtain the expected information to the detriment of the interests of the other party, resulting in adverse effects. This paper studies the fairness guarantee quantitatively through probabilistic model checking. E-fairness is measured by modeling the protocol in probabilistic timed automata and verifying the appropriate property specified in the probabilistic computation tree logic. Furthermore, our analysis proposes insight for choosing suitable values for different parameters associated with the protocol so that a certain degree of fairness can be obtained. Therefore, the reverse question—for a certain degree of fairness ε , how can the protocol parameters be specified to ensure fairness—is answered.

A Formal Model for Analyzing Fair Exchange Protocols Based on Event Logic

“…In [15], a formal verification method of fair exchange protocol based on channel credibility was proposed, and the impact of channel errors on the fairness of the protocol was analyzed. Guo [16] proposed a modeling method of fair exchange protocols based on probabilistic timed automata, and uses prism, a probabilistic model checker, to quantitatively study the fairness of protocols. In the above research, general model checkers are used to verify the protocol model.…”