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

Journal of the Graduate School of the Chinese Academy of Sciences

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

Li Yan

Published Jan 1, 2004• 0 citations
OpenAlex

Abstract

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.

Related papers

An undeniable cryptographic protocol for both thesender and the receiver

Jianzhong Zhang

We survey the state of non-repudiation cryptographic protocols, almost all of which have weaknesses. The paper proposes a perfect protocol which can be used to realize the strong fairness and non-repudiation of both parties even if the channels are not reliable. Usually the protocol only needs three interactions of participants and the transferring data remain confidential for others but the sender and the receiver, who are unknown to others. The Trusted Third Party(TTP) acts as a notary rather than a delivery and its bottleneck problem is solved completely. Finally the security of the protocol is analysed in detail.

Journal of Xidian University•Jan 1, 2004•0 citations

A New Mutually Undeniable Cryptographic Protocol and Its Formal Analysis

Jiwen Zeng

Non-repudiation service is the foundation of security on which important data and sensitive news are conveyed on the Internet in ecommerce.Non-repudiation protocol is a special network protocol which provides non-repudiation service.But real non-repudiation protocol is relatively few.In this paper,a new mutually undeniable cryptographic protocol was proposed.The protocol not only prevents some possible types of attack(for example,Middle-in-Attack,Replay attack,Impersonation Attack et al.),but also avoids the trusted third party being the bottleneck problem,and ensures the confidentiality and the integrity of transferring data,real non-repudiation of the sender and the receiver.The new protocol is of mutually undeniable property.

Journal of Xiamen University•Jan 1, 2008•0 citations

Analysis and Improvement of a Mutually Undeniable Cryptographic Protocol

Yanping Li

Non-repudiation service is the foundation of security on which important data and sensitive news are conveyed on the Internet in e-commerce. Non-repudiation protocol is a special network protocol which provides non-repudiation service. Because of the importance of non-repudiation to electronic commerce activities and the fact that non-repudiation protocol is relatively few, this paper adopts the modern cryptographic algorithms and techniques and designs a mutually undeniable cryptographic protocol. Analyses show that the improved protocol avoids the trusted third party being the bottleneck problem, and also realizes the confidentiality of transferring data, and the fairness and non-repudiation of the sender and the receiver.

Journal of Huaihai Institute of Technology•Jan 1, 2006•0 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

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

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 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.
We survey the state of non-repudiation cryptographic protocols, almost all of which have weaknesses. The paper proposes a perfect protocol which can be used to realize the strong fairness and non-repudiation of both parties even if the channels are not reliable. Usually the protocol only needs three interactions of participants and the transferring data remain confidential for others but the sender and the receiver, who are unknown to others. The Trusted Third Party(TTP) acts as a notary rather than a delivery and its bottleneck problem is solved completely. Finally the security of the protocol is analysed in detail.
Non-repudiation service is the foundation of security on which important data and sensitive news are conveyed on the Internet in ecommerce.Non-repudiation protocol is a special network protocol which provides non-repudiation service.But real non-repudiation protocol is relatively few.In this paper,a new mutually undeniable cryptographic protocol was proposed.The protocol not only prevents some possible types of attack(for example,Middle-in-Attack,Replay attack,Impersonation Attack et al.),but also avoids the trusted third party being the bottleneck problem,and ensures the confidentiality and the integrity of transferring data,real non-repudiation of the sender and the receiver.The new protocol is of mutually undeniable property.
Non-repudiation service is the foundation of security on which important data and sensitive news are conveyed on the Internet in e-commerce. Non-repudiation protocol is a special network protocol which provides non-repudiation service. Because of the importance of non-repudiation to electronic commerce activities and the fact that non-repudiation protocol is relatively few, this paper adopts the modern cryptographic algorithms and techniques and designs a mutually undeniable cryptographic protocol. Analyses show that the improved protocol avoids the trusted third party being the bottleneck problem, and also realizes the confidentiality of transferring data, and the fairness and non-repudiation of the sender and the receiver.
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.
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.
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.