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 Computer Applications

Secret transferring protocol with non-repudiation based on domain-verifiable signcryption

Guohua Cui

Published Jan 1, 2007• 0 citations
OpenAlex

Abstract

Signcryption provides confidentiality and authenticity efficiently, and it can be used to design compact communication protocol. This paper analyzed the domain-verifiable signcryption which Wang proposed, and pointed out the redundant data and computation in his scheme. This paper advanced Wang's scheme and designed a new domain-verifiable signcryption scheme. Based on the signcryption scheme, this paper proposed a new secret transferring protocol. The new scheme provides integrity of ciphertext and correctness of plaintext by 3 steps, and it keeps confidentiality, fairness and non-repudiation. Meanwhile, performance analysis shows that the new scheme is more efficient.

Related papers

Multi-party Certified Mail Protocol Based on Signcryption

YU Cheng-zun

A new signcryption scheme is developed based on Domain-verifiable signcryption.The scheme simultaneously fulfills both signature and encryption in a single logical step at a lower computational cost.In particular,it can be used by certified mail protocol,and based on the scheme a multi-party certified mail protocol is proposed,its fairness and non-repudiation are proved.

Dianzi xuebao•Jan 1, 2005•1 citation

An authenticated key agreement protocol for cross-domain based on heterogeneous signcryption scheme

Caifen Wang, Chao Liu, Shufen Niu +2 more

In this paper, we present a new efficient authenticated key agreement protocol. Compared with other cross-domain protocols which are all in the same cryptosystem, our protocol is innovatively designed to shift between the Public Key Infrastructure (PKI) and the Identity-based Cryptosystem (IBC). This protocol combined with heterogeneous signcryption method is proved to satisfy confidentiality and unforgeability on the basis of the assumptions of Computational Diffie-Hellman problem (CDHP) and Bilinear Diffie-Hellman problem (BDHP) in the authentication phases, and it simultaneously guarantees the ciphertext anonymity. In addition, it can efficiently resist kinds of active attacks such as known-session key attack, key forge attack, and known-temporary secret key attack. Compared with other two-party authenticated key agreement protocols, the newly proposed key agreement protocol has better security, practicability and efficiency.

International Wireless Communications and Mobile Computing Conference (IWCMC)•Jun 1, 2017•15 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

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

Design and formal analysis of a new Fair Multi-Party Certified Mail Protocol

Yuexiang Gao, Daiyuan Peng, Lili Yan

Fair Multi-Party Certified Mail Protocol is a value service to deliver important data over internet with guaranteed receipt for each successful delivery. Therefore, the protocol needs to be Confidential, Non-repudiation and Fairness. This paper pointed out potential security concern for a current protocol, and also came out an offline third party fair multi-party certified Mail Protocol based on signcryption scheme. Through the analysis by Kailar logic, it is can be seen the protocol can achieve the non-repudiation, fairness. Furthermore, it has advantage of resisting the attacks as distort, replay and conspiracy.

International Conference on Machine Learning and Cybernetics•Jul 1, 2010•1 citation

Forward secure key agreement protocol based on signcryption

Zheng Lian-qing

Secure and efficient message delivery is one of the major aims of computer and communication security research. Based on the key agreement protocols using signcryption proposed by Zheng and Zhang chuan-rong, this paper proposed a forward secure key agreement protocol based on identity-signcyption. It combined the advantages of the identity-based public key system and signcryption technique. As compared to the existing schemes, the protocol is not only confidential, authenticated, but also forward secure.

Jisuanji yingyong yanjiu•Jan 1, 2010•0 citations
Signcryption provides confidentiality and authenticity efficiently, and it can be used to design compact communication protocol. This paper analyzed the domain-verifiable signcryption which Wang proposed, and pointed out the redundant data and computation in his scheme. This paper advanced Wang's scheme and designed a new domain-verifiable signcryption scheme. Based on the signcryption scheme, this paper proposed a new secret transferring protocol. The new scheme provides integrity of ciphertext and correctness of plaintext by 3 steps, and it keeps confidentiality, fairness and non-repudiation. Meanwhile, performance analysis shows that the new scheme is more efficient.
In this paper, we present a new efficient authenticated key agreement protocol. Compared with other cross-domain protocols which are all in the same cryptosystem, our protocol is innovatively designed to shift between the Public Key Infrastructure (PKI) and the Identity-based Cryptosystem (IBC). This protocol combined with heterogeneous signcryption method is proved to satisfy confidentiality and unforgeability on the basis of the assumptions of Computational Diffie-Hellman problem (CDHP) and Bilinear Diffie-Hellman problem (BDHP) in the authentication phases, and it simultaneously guarantees the ciphertext anonymity. In addition, it can efficiently resist kinds of active attacks such as known-session key attack, key forge attack, and known-temporary secret key attack. Compared with other two-party authenticated key agreement protocols, the newly proposed key agreement protocol has better security, practicability and efficiency.
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.
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.
Fair Multi-Party Certified Mail Protocol is a value service to deliver important data over internet with guaranteed receipt for each successful delivery. Therefore, the protocol needs to be Confidential, Non-repudiation and Fairness. This paper pointed out potential security concern for a current protocol, and also came out an offline third party fair multi-party certified Mail Protocol based on signcryption scheme. Through the analysis by Kailar logic, it is can be seen the protocol can achieve the non-repudiation, fairness. Furthermore, it has advantage of resisting the attacks as distort, replay and conspiracy.
Secure and efficient message delivery is one of the major aims of computer and communication security research. Based on the key agreement protocols using signcryption proposed by Zheng and Zhang chuan-rong, this paper proposed a forward secure key agreement protocol based on identity-signcyption. It combined the advantages of the identity-based public key system and signcryption technique. As compared to the existing schemes, the protocol is not only confidential, authenticated, but also forward secure.