Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)

A fair non-repudiation security protocol with off-line TTP

Xi Wang, Xiangming Wen, Ye Liu, Xinqi Lin, Ying Wang

Published Jul 1, 2009• 1 citation
Publisher

Abstract

A fair non-repudiation security protocol can provide non-repudiation proof for two parts of the exchange at the same time, or both get nothing. But many protocols performed weak in logical analysis. In this paper, a group of new protocols(with 3 sub-protocols) with off-line The Third Party(TTP) are presented. We analysis them with a new Kailar logic analytical method. Finally, the proposed protocols are proved to satisfy the fairness, non-repudiation and efficiency from the theory. And they propose some protections for the networks which have merely physical securities such as Internet, and provide some realistic reference values to the establishment of security mobile ad-hoc networks.

DOI
10.1109/soli.2009.5203925

Related papers

A Fair Non-Repudiation Protocol without TTP Based on Entity′s Computing Power

Xingfu Wang

With the development of e-commence and other utilities on internet,a new security service——fair non-repudiation becomes more important and crucial.But,most current protocols depend on trusted third party(TTP),so a fair non-repudiation protocol without TTP is needed.But the existing fair protocols don't have equal security for message originator and receiver,and they can not assure the security of the message originator.In this paper,a new protocol is designed for the prior security of the originator,and a fair non-repudiation protocol without TTP based on entity's computing power is proposed to get rid of the dependence on TTP,to solve the security problems that exist when message originator and receiver's computing power are not equal.

Dianzi xuebao•Jan 1, 2006•0 citations

Generic non-repudiation protocols supporting transparent off-line TTP

Guilin Wang

A non-repudiation protocol enables the fair exchange of an electronic message and an irrefutable digital receipt between two mistrusting parties over the Internet. That is, at the end of any execution instance of such a protocol, either both parties obtain their expected items or neither party does . In this paper, we first argue that it is really meaningful in practice to exploit generic fair non-repudiation protocols with transparent off-line trusted third party (TTP). Namely, in those protocols, each involved party could use any secure digital signature algorithm to produce non-repudiation evidences; and the issued evidences are the same regardless of whether the TTP is involved or not. Then, we present such a fair non-repudiation protocol to overcome some limitations and shortcomings in previous schemes. Technical discussions are provided to show that our protocol is not only secure but also the most efficient solution, compared with existing non-repudiation protocols. In addition, some potential extensions are also pointed out.

Journal of Computer Security•Nov 8, 2006•29 citations

Formal Analysis Of Multi-party Non-repudiation Protocols Without TTP

Xiaoqiong Wang, Xueming Wang

Non-repudiation service is crucial to electronic commerce. Now multi-party non-repudiation is a new focus of research. This paper presents a multi-party non-repudiation protocol, based on a group encryption scheme. A multi-party non-repudiation problem is defined in this paper. This definition and the resulting protocol are more general than the other comparable work. At last, an example of fair multi-party non-repudiation protocol without a trusted third party (TTP) is given out, which uses formal method of SVO logic to analyze the protocol and prove its correctness.

International Conference on Communications and Intelligence Information Security (ICCIIS)•Oct 1, 2010•1 citation

Design and verification of a non-repudiation protocol based on receiver-side smart card

Jiajia Liu, Laurent Vigneron

All the existing non-repudiation protocols ensuring strong fairness have to assume that the communication channel between trusted third party (TTP) and each player is resilient at least. Where only unreliable channel can be guaranteed, all these protocols become impractical. In this study, based on smart card on the receiver side, the authors design a fair non-repudiation protocol that needs no assumptions on the communication channel. The smart card takes over the role of an online TTP server. Without a dedicated TTP server, this protocol is ideal for some ad hoc scenarios where no infrastructure is available. This protocol can also be easily modified to support fair exchange of time-sensitive data. Compared with other traditional security protocols, automatic formal verification of fair non-repudiation protocols is much harder to achieve. The authors use meta-reasoning method to prove that the fair exchange property of this protocol can be reduced to three secrecy properties that fall into the scope of today's most automatic verification tools and therefore can be easily verified. The authors also use a recently proposed automatic method to verify the non-repudiation properties and fairness property of our protocol.

IET Information Security•Jan 6, 2010•7 citations

A Hybrid Cryptosystem-Based Non-Repudiation Protocol and Its Formal Analysis

Li Yan

A non-repudiation cryptographic protocol based on hybrid cryptosystem is proposed and it is a more perfect protocol.It can realize the true fairness and non-repudiation of both parties even the channels are unreliable and insecure.Usually the protocol only needs three interactions of participants and the transferring data keep confidential for others except for the sender and the receiver,whose transactions are protected.The Trusted Third Party(TTP) performs evidences verification,generation and publication and its bottleneck problem is solved completely.Finally,we give its formal analysis and prove the protocol's fairness,correctness and security.

Journal of the Graduate School of the Chinese Academy of Sciences•Jan 1, 2004•0 citations

Non-repudiation protocol based on conditional trusted third party

Chun Chen

The idea of TTP was developed on the basis semi-trusted TTP. The term of conditional trusted third means that on the condition of third party satisfying the pre-conditions, if he behaves right, then he is trusted, else his behavior can be checked by participators of the protocol. A new protocol adopting off-line and TTP was put forward. Compared with available non-repudiation protocols, this one progresses further in reducing intervention of TTP in fair exchange.

Journal of Zhejiang University(Engineering Science)•Jan 1, 2004•0 citations
A fair non-repudiation security protocol can provide non-repudiation proof for two parts of the exchange at the same time, or both get nothing. But many protocols performed weak in logical analysis. In this paper, a group of new protocols(with 3 sub-protocols) with off-line The Third Party(TTP) are presented. We analysis them with a new Kailar logic analytical method. Finally, the proposed protocols are proved to satisfy the fairness, non-repudiation and efficiency from the theory. And they propose some protections for the networks which have merely physical securities such as Internet, and provide some realistic reference values to the establishment of security mobile ad-hoc networks.
With the development of e-commence and other utilities on internet,a new security service——fair non-repudiation becomes more important and crucial.But,most current protocols depend on trusted third party(TTP),so a fair non-repudiation protocol without TTP is needed.But the existing fair protocols don't have equal security for message originator and receiver,and they can not assure the security of the message originator.In this paper,a new protocol is designed for the prior security of the originator,and a fair non-repudiation protocol without TTP based on entity's computing power is proposed to get rid of the dependence on TTP,to solve the security problems that exist when message originator and receiver's computing power are not equal.
A non-repudiation protocol enables the fair exchange of an electronic message and an irrefutable digital receipt between two mistrusting parties over the Internet. That is, at the end of any execution instance of such a protocol, either both parties obtain their expected items or neither party does . In this paper, we first argue that it is really meaningful in practice to exploit generic fair non-repudiation protocols with transparent off-line trusted third party (TTP). Namely, in those protocols, each involved party could use any secure digital signature algorithm to produce non-repudiation evidences; and the issued evidences are the same regardless of whether the TTP is involved or not. Then, we present such a fair non-repudiation protocol to overcome some limitations and shortcomings in previous schemes. Technical discussions are provided to show that our protocol is not only secure but also the most efficient solution, compared with existing non-repudiation protocols. In addition, some potential extensions are also pointed out.
Non-repudiation service is crucial to electronic commerce. Now multi-party non-repudiation is a new focus of research. This paper presents a multi-party non-repudiation protocol, based on a group encryption scheme. A multi-party non-repudiation problem is defined in this paper. This definition and the resulting protocol are more general than the other comparable work. At last, an example of fair multi-party non-repudiation protocol without a trusted third party (TTP) is given out, which uses formal method of SVO logic to analyze the protocol and prove its correctness.
All the existing non-repudiation protocols ensuring strong fairness have to assume that the communication channel between trusted third party (TTP) and each player is resilient at least. Where only unreliable channel can be guaranteed, all these protocols become impractical. In this study, based on smart card on the receiver side, the authors design a fair non-repudiation protocol that needs no assumptions on the communication channel. The smart card takes over the role of an online TTP server. Without a dedicated TTP server, this protocol is ideal for some ad hoc scenarios where no infrastructure is available. This protocol can also be easily modified to support fair exchange of time-sensitive data. Compared with other traditional security protocols, automatic formal verification of fair non-repudiation protocols is much harder to achieve. The authors use meta-reasoning method to prove that the fair exchange property of this protocol can be reduced to three secrecy properties that fall into the scope of today's most automatic verification tools and therefore can be easily verified. The authors also use a recently proposed automatic method to verify the non-repudiation properties and fairness property of our protocol.
A non-repudiation cryptographic protocol based on hybrid cryptosystem is proposed and it is a more perfect protocol.It can realize the true fairness and non-repudiation of both parties even the channels are unreliable and insecure.Usually the protocol only needs three interactions of participants and the transferring data keep confidential for others except for the sender and the receiver,whose transactions are protected.The Trusted Third Party(TTP) performs evidences verification,generation and publication and its bottleneck problem is solved completely.Finally,we give its formal analysis and prove the protocol's fairness,correctness and security.