Full Text:   <511>

CLC number: 

On-line Access: 2022-04-22

Received: 2021-08-29

Revision Accepted: 2021-12-17

Crosschecked: 0000-00-00

Cited: 0

Clicked: 721

Citations:  Bibtex RefMan EndNote GB/T7714

-   Go to

Article info.
Open peer comments

Journal of Zhejiang University SCIENCE C 1998 Vol.-1 No.-1 P.

http://doi.org/10.1631/FITEE.2100413


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


Author(s):  Xu GUO

Affiliation(s):  Department of electronics and information Shanghai Dianji University, Shanghai 201306, China

Corresponding email(s):   guox@sdju.edu.cn

Key Words:  Non-repudiation, fairness analysis, Probabilistic model checking, PRISM


Xu GUO. Fairness analysis of extra-gain guilty of a non-repudiation protocol[J]. Frontiers of Information Technology & Electronic Engineering, 1998, -1(-1): .

@article{title="Fairness analysis of extra-gain guilty of a non-repudiation protocol",
author="Xu GUO",
journal="Frontiers of Information Technology & Electronic Engineering",
volume="-1",
number="-1",
pages="",
year="1998",
publisher="Zhejiang University Press & Springer",
doi="10.1631/FITEE.2100413"
}

%0 Journal Article
%T Fairness analysis of extra-gain guilty of a non-repudiation protocol
%A Xu GUO
%J Journal of Zhejiang University SCIENCE C
%V -1
%N -1
%P
%@ 2095-9184
%D 1998
%I Zhejiang University Press & Springer
%DOI 10.1631/FITEE.2100413

TY - JOUR
T1 - Fairness analysis of extra-gain guilty of a non-repudiation protocol
A1 - Xu GUO
J0 - Journal of Zhejiang University Science C
VL - -1
IS - -1
SP -
EP -
%@ 2095-9184
Y1 - 1998
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/FITEE.2100413


Abstract: 
Many traditional applications can be refined thanks to the development of Blockchain technologies. One of these services is non-repudiation in which participants in a communications process cannot deny their involvement. Due to the vulnerabilities of the non-repudiation protocols, one of the parties involved in communication can often avoid the 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 Probabilistic Computation Tree Logic (PCTL). 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, and therefore answers the reverse question: For a certain degree of fairness, ε, how can the protocol parameters be specified to ensure fairness?

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - 2022 Journal of Zhejiang University-SCIENCE