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

Jisuanji yingyong yanjiu

Research of certificateless perfect concurrent signcryption

Yingyou Wen

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

Perfect concurrent signature was introduced as an efficient approach to solving the problem of fair exchange of signatures. Almost all fair exchange e-commerce protocols that have been proposed until now either do not provide message privacy protection or adopt the sign-then-encrypt scheme to provide confidentiality. However, confidentiality is an important requirement of e-commerce protocols. This paper proposed a new concept called perfect concurrent signcryption which combined the concepts of perfect concurrent signature and signcryption together to resolve the confidentiality problem in e-commerce systems. It also proposed a certificateless perfect concurrent signcryption scheme and proved its security in the random oracle model. The scheme published the two ambiguous signcryptions in any order. Compared with the sign-then-encrypt scheme, this scheme enjoys shorter message length and less operation cost, which makes the scheme has wide application prospects.

Related papers

Signcryption-based fair exchange protocol

Yingyou Wen

By introducing signcryption technology into concurrent signature,a signcryption-based concurrent signature scheme was presented,which was proven to have the existential unforgeability against adaptive chosen messages attacks under the random oracle model,Based on this scheme,a fair exchange protocol was proposed,which could be used to exchange digital goods.This protocol did not need secure communications channel,in which two parties generate sym-metrical ambiguous signatures and individual keystones were released by themselves,which ensured the properties of confidentiality,ambiguousness and fairness,which made our protocol could be used in e-commerce payment,e-contract signing,mail authentication,etc.

Journal of Communications•Jan 1, 2010•3 citations

Improved Fair Exchange Protocol Based on Signcryption-Based Concurrent Signature

Qing Ye, Hongfu Guo, Chunli Yang +1 more

Through analysis, we point out Luo et al.’s and Sun et al.’s signcryption-based concurrent signature schemes have the same defect in ambiguity and therefore the fair exchange protocols based on their schemes are not fair. Thus based on the notions of signcryption and concurrent signature, a new signcryption-based concurrent signature scheme from bilinear pairing is presented, and based on this scheme, a new fair exchange protocol is proposed. Since we adopt a new method to construct the new signcryption-based concurrent signature scheme, the new scheme redresses the flaw of Luo et al.’s and Sun et al.’s schemes, and the fair exchange protocol based on the new scheme is also fair. Besides, due to the new scheme’s independence of the ring signature and simplification of encryption operations, the new scheme has the advantage of short signatures and low computation cost. We improve Luo et al.’s definition of the security model of a signcryption-based concurrent signature scheme and prove the proposed scheme and protocol are secure under the computational Diffie-Hellman assumption in the random oracle model.

Journal of Software•Jul 1, 2013•1 citation

A Certificateless Fair Exchange Protocol

Changgen Peng

Fair exchange protocol is an important security protocol in E-commerce.A certificateless verifiably encrypted signature scheme is constructed based on certificateless cryptosystem.And based on verifiably encrypted signature scheme,a new certificateless fair exchange protocol is designed.The proposed protocol reduces the cost of the key-escrow and certificate management,and meets the validity,fairness,timeliness and optimization.

Journal of Guizhou University•Jan 1, 2011•0 citations

Certificateless Concurrent Signature Scheme

Zhenjie Huang, Xuanzhi Lin, Rufen Huang

Certificateless public key cryptography was introduced to remove the use of certificate to ensure the authentication of the user's public key in the traditional certificate-based public key cryptography and overcome he key escrow problem in the identity-based public key cryptography. Concurrent signatures were introduced as an alternative approach to solving the problem of fair exchange of signatures. Combining the concept of certificateless cryptography with the concept of concurrent signature, in this paper, we present a notion of certificateless concurrent signature with a formal security model and propose a provably secure scheme assuming the hardness of computational Diffie-Hellman Problem.

International Conference for Young Computer Scientists•Nov 1, 2008•2 citations

Novel fair exchange protocol based on concurrent signature

Yang Yi-xian

Based on perfect concurrent signature, a novel fair exchange protocol was presented. In this protocol anyone can’t identify who has signed which signature when two parties have exchanged their two ambiguous signatures and rela- tive data items. Not until the initial signer publishes a secret information, are the two signatures bound to respective signer concurrently. After that, the other party sends the key of decrypting goods, and thus the two parties can fairly get each other’s data items without the trusted third party (TTP), which avoids the possibility of two parties’ collusion and the bottleneck of the TTP involvement. Through analysis, this protocol well ensures some significant properties of fair ex- change, such as fairness, non-repudiation and abuse-free etc. What’s more, it only needs four messages between two par- ties and it is very simple and highly efficient.

Journal of Communications•Jan 1, 2008•2 citations

Certificateless Authentication Protocol Without Pairing

Yumin Wang

A new certificateless signcryption scheme without using the bilinear pairings was presented based Discrete-Logarithm firstly,which was proved security in the random oracle model.Secondly,with the proposes signcryption scheme Canetti-Krawczyk model,the author proposes an efficient certificateless authentication and key exchange protocol without pairings.The security analysis of the proposed protocol in the implementation plan with the Canetti-Krawczyk model is presented in this paper.The results show that the proposed protocol is session-key secure with perfect forward secrecy.Moreover,the implementation of the protocol is just 1 encryption operation,3 exponent operations and twice communications.

Wuhan Daxue xuebao. Xinxi kexue ban•Jan 1, 2010•1 citation
Perfect concurrent signature was introduced as an efficient approach to solving the problem of fair exchange of signatures. Almost all fair exchange e-commerce protocols that have been proposed until now either do not provide message privacy protection or adopt the sign-then-encrypt scheme to provide confidentiality. However, confidentiality is an important requirement of e-commerce protocols. This paper proposed a new concept called perfect concurrent signcryption which combined the concepts of perfect concurrent signature and signcryption together to resolve the confidentiality problem in e-commerce systems. It also proposed a certificateless perfect concurrent signcryption scheme and proved its security in the random oracle model. The scheme published the two ambiguous signcryptions in any order. Compared with the sign-then-encrypt scheme, this scheme enjoys shorter message length and less operation cost, which makes the scheme has wide application prospects.
By introducing signcryption technology into concurrent signature,a signcryption-based concurrent signature scheme was presented,which was proven to have the existential unforgeability against adaptive chosen messages attacks under the random oracle model,Based on this scheme,a fair exchange protocol was proposed,which could be used to exchange digital goods.This protocol did not need secure communications channel,in which two parties generate sym-metrical ambiguous signatures and individual keystones were released by themselves,which ensured the properties of confidentiality,ambiguousness and fairness,which made our protocol could be used in e-commerce payment,e-contract signing,mail authentication,etc.
Through analysis, we point out Luo et al.’s and Sun et al.’s signcryption-based concurrent signature schemes have the same defect in ambiguity and therefore the fair exchange protocols based on their schemes are not fair. Thus based on the notions of signcryption and concurrent signature, a new signcryption-based concurrent signature scheme from bilinear pairing is presented, and based on this scheme, a new fair exchange protocol is proposed. Since we adopt a new method to construct the new signcryption-based concurrent signature scheme, the new scheme redresses the flaw of Luo et al.’s and Sun et al.’s schemes, and the fair exchange protocol based on the new scheme is also fair. Besides, due to the new scheme’s independence of the ring signature and simplification of encryption operations, the new scheme has the advantage of short signatures and low computation cost. We improve Luo et al.’s definition of the security model of a signcryption-based concurrent signature scheme and prove the proposed scheme and protocol are secure under the computational Diffie-Hellman assumption in the random oracle model.
Certificateless public key cryptography was introduced to remove the use of certificate to ensure the authentication of the user's public key in the traditional certificate-based public key cryptography and overcome he key escrow problem in the identity-based public key cryptography. Concurrent signatures were introduced as an alternative approach to solving the problem of fair exchange of signatures. Combining the concept of certificateless cryptography with the concept of concurrent signature, in this paper, we present a notion of certificateless concurrent signature with a formal security model and propose a provably secure scheme assuming the hardness of computational Diffie-Hellman Problem.
Based on perfect concurrent signature, a novel fair exchange protocol was presented. In this protocol anyone can’t identify who has signed which signature when two parties have exchanged their two ambiguous signatures and rela- tive data items. Not until the initial signer publishes a secret information, are the two signatures bound to respective signer concurrently. After that, the other party sends the key of decrypting goods, and thus the two parties can fairly get each other’s data items without the trusted third party (TTP), which avoids the possibility of two parties’ collusion and the bottleneck of the TTP involvement. Through analysis, this protocol well ensures some significant properties of fair ex- change, such as fairness, non-repudiation and abuse-free etc. What’s more, it only needs four messages between two par- ties and it is very simple and highly efficient.
A new certificateless signcryption scheme without using the bilinear pairings was presented based Discrete-Logarithm firstly,which was proved security in the random oracle model.Secondly,with the proposes signcryption scheme Canetti-Krawczyk model,the author proposes an efficient certificateless authentication and key exchange protocol without pairings.The security analysis of the proposed protocol in the implementation plan with the Canetti-Krawczyk model is presented in this paper.The results show that the proposed protocol is session-key secure with perfect forward secrecy.Moreover,the implementation of the protocol is just 1 encryption operation,3 exponent operations and twice communications.