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

International Conference on Future Information Technology and Management Engineering

Security analysis on a verifiably encrypted signature scheme

Li Yong-qiang, Xin Xiang-jun

Published Oct 1, 2010• 0 citations
Publisher

Abstract

Recently, a randomized verifiably encrypted signature scheme without random oracle is proposed by Yang et al. However, according to the security analysis, it is found that given two signatures on a message, the adversary can forge a new signature on the same message. Therefore, their scheme has not the propriety of undenibility, which means that their scheme is insecure. Because a verifiably encrypted signature scheme is mainly used to construct the optimistic fair exchange protocols, it should have the strong unforgerity.

DOI
10.1109/fitme.2010.5654735

Related papers

New scheme of fair exchange of digital signatures

Yu Shang

Based on the verifiably encrypted signature scheme without random oracles recently proposed by Gorantla et al.,a new scheme of optimistic fair exchange of digital signatures is proposed in this paper.The two players firstly exchange their verifiably encrypted signature on agreed-upon messages then their ordinary signature after the verification of each other's verifiably encrypted signature.If one of them executes the protocol dishonestly,the other can resort to a trusted third party so as to get the purpose of fair exchange of signatures.The proposed scheme has properties of short signature,low computation and verification cost.It can realize exchange of digital signatures fairly and efficiently.

Computer Engineering and Applications Journal•Jan 1, 2008•1 citation

New Optimistic Fair Exchange Protocol Based on VE-RSA Signature

Lize Gu, Yanbin Sun

Recently, Zhou et al. proposed a verifiably encrypted RSA (VE-RSA) signature scheme, which was used to convince that an encrypted message is a certain party's signature on a message while without revealing the signature. In this paper, we propose a new optimistic fair exchange protocol based on the verifiably encrypted RSA signature scheme. In our scheme, both parties can contact the TTP and settle the argument before the deadline. Moreover, our new scheme achieves fairness and timeliness.

International Workshop on Education Technology and Computer Science•Jan 1, 2010•1 citation

Constructing Optimistic Fair Exchange Protocols from Committed Signatures.

Huafei Zhu

In PODC 2003, Park et al. [32] first introduce a connection between fair exchange and sequential two-party multi-signature scheme and provide a novel method of constructing fair exchange protocol by distributing the computation of RSA signature. This approach avoids the design of verifiable encryption scheme at the expense of having cosigner store a piece of prime signer's secret key. Dodis and Reyzin [20] showed that the protocol in [32] is totally breakable in the registration phase, then presented a remedy scheme which is provably secure in the random oracle model, by utilizing Boldyreva non-interactive two-party multi-signature scheme [8]. Security in the random oracle model does not imply security in the real world. In this paper, we provide the first two e#cient committed signatures which are provably secure in the standard complexity model from strong RSA assumption. Then we construct e#cient optimistic fair exchange protocols from those new primitives.

•Jan 1, 2003•4 citations

Certificate‐based verifiably encrypted RSA signatures

Zuhua Shao, Yipeng Gao

Abstract The RSA signature scheme is one of the most popular signature schemes to date. This paper proposes a certificate‐based verifiably encrypted RSA signature scheme that is the first to accomplish optimistic fair exchange of the standard RSA signatures. The main characteristic of this scheme is that the signer can unilaterally choose a certificate authority as his/her adjudicator in fair exchange. Then a certificate, or generally, a signature, acts not only as the binding of the public key and its holder but also as the certificate authority's guarantee against partiality in adjudication. We introduce a strong security model, in which there are three types of inside adversaries with more power than outside adversaries in previous verifiably encrypted RSA signature schemes. We then show that the proposed scheme is existentially unforgeable under the Discrete Logarithm (DL) assumption, the Computational Diffile‐Dellman (CDH) assumption, and the RSA assumption in the random oracle model. Because the proposed scheme can be directly used in the current Public‐Key Infrastructure (PKI) environment, it is more practical and trustworthy than the previous schemes in the real world. Copyright © 2013 John Wiley & Sons, Ltd.

Transactions on Emerging Telecommunications Technologies•Jan 10, 2013•8 citations

A Mixed Verifiably Encrypted Signature Scheme and It's Applications

Yuefei Zhu

ID-based public key cryptography can be a good alternative for certificate-based public key setting,especially when efficient key management and moderate security are required.This paper proposes a primitive called mixed verifiably encrypted signature scheme(MVESS) and presents an efficient MVESS based on the ID-based signature scheme due to Cheon,et.al.Then,we provide some theoretical discussions for the security model for MVESSs,and show that our new scheme can be proven to secure with the hardness assumption of the computational Diffie-Hellman problem of pairings in the random oracle model.Our new scheme can be used as blocks to build efficient ID-based optimistic fair signature exchange protocols,which can be widely used in signing digital contracts,e-payment and other electronic commerce.

Dianzi xuebao•Jan 1, 2006•0 citations

Security Analysis of Zhu-Bao's Verifiably Committed Signature

Dae Hyun Yum, Pil Joong Lee

A fair exchange scheme is a protocol by which two parties Alice and Bob swap items or services without allowing either party to gain an advantage by quitting prematurely or otherwise misbehaving. Verifiably committed signature is a generalized and unified model for non-interactive optimistic fair exchange scheme. The state-of-the-art verifiably committed signature that enjoys the off-line, setup-free and stand-alone properties is due to Zhu and Bao [1]. In this article, we show that the Zhu-Bao's verifiably committed signature is insecure in the multi-user setting and then consider possible countermeasures.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Dec 1, 2007•1 citation
Recently, a randomized verifiably encrypted signature scheme without random oracle is proposed by Yang et al. However, according to the security analysis, it is found that given two signatures on a message, the adversary can forge a new signature on the same message. Therefore, their scheme has not the propriety of undenibility, which means that their scheme is insecure. Because a verifiably encrypted signature scheme is mainly used to construct the optimistic fair exchange protocols, it should have the strong unforgerity.
Based on the verifiably encrypted signature scheme without random oracles recently proposed by Gorantla et al.,a new scheme of optimistic fair exchange of digital signatures is proposed in this paper.The two players firstly exchange their verifiably encrypted signature on agreed-upon messages then their ordinary signature after the verification of each other's verifiably encrypted signature.If one of them executes the protocol dishonestly,the other can resort to a trusted third party so as to get the purpose of fair exchange of signatures.The proposed scheme has properties of short signature,low computation and verification cost.It can realize exchange of digital signatures fairly and efficiently.
In PODC 2003, Park et al. [32] first introduce a connection between fair exchange and sequential two-party multi-signature scheme and provide a novel method of constructing fair exchange protocol by distributing the computation of RSA signature. This approach avoids the design of verifiable encryption scheme at the expense of having cosigner store a piece of prime signer's secret key. Dodis and Reyzin [20] showed that the protocol in [32] is totally breakable in the registration phase, then presented a remedy scheme which is provably secure in the random oracle model, by utilizing Boldyreva non-interactive two-party multi-signature scheme [8]. Security in the random oracle model does not imply security in the real world. In this paper, we provide the first two e#cient committed signatures which are provably secure in the standard complexity model from strong RSA assumption. Then we construct e#cient optimistic fair exchange protocols from those new primitives.
Abstract The RSA signature scheme is one of the most popular signature schemes to date. This paper proposes a certificate‐based verifiably encrypted RSA signature scheme that is the first to accomplish optimistic fair exchange of the standard RSA signatures. The main characteristic of this scheme is that the signer can unilaterally choose a certificate authority as his/her adjudicator in fair exchange. Then a certificate, or generally, a signature, acts not only as the binding of the public key and its holder but also as the certificate authority's guarantee against partiality in adjudication. We introduce a strong security model, in which there are three types of inside adversaries with more power than outside adversaries in previous verifiably encrypted RSA signature schemes. We then show that the proposed scheme is existentially unforgeable under the Discrete Logarithm (DL) assumption, the Computational Diffile‐Dellman (CDH) assumption, and the RSA assumption in the random oracle model. Because the proposed scheme can be directly used in the current Public‐Key Infrastructure (PKI) environment, it is more practical and trustworthy than the previous schemes in the real world. Copyright © 2013 John Wiley & Sons, Ltd.
ID-based public key cryptography can be a good alternative for certificate-based public key setting,especially when efficient key management and moderate security are required.This paper proposes a primitive called mixed verifiably encrypted signature scheme(MVESS) and presents an efficient MVESS based on the ID-based signature scheme due to Cheon,et.al.Then,we provide some theoretical discussions for the security model for MVESSs,and show that our new scheme can be proven to secure with the hardness assumption of the computational Diffie-Hellman problem of pairings in the random oracle model.Our new scheme can be used as blocks to build efficient ID-based optimistic fair signature exchange protocols,which can be widely used in signing digital contracts,e-payment and other electronic commerce.
A fair exchange scheme is a protocol by which two parties Alice and Bob swap items or services without allowing either party to gain an advantage by quitting prematurely or otherwise misbehaving. Verifiably committed signature is a generalized and unified model for non-interactive optimistic fair exchange scheme. The state-of-the-art verifiably committed signature that enjoys the off-line, setup-free and stand-alone properties is due to Zhu and Bao [1]. In this article, we show that the Zhu-Bao's verifiably committed signature is insecure in the multi-user setting and then consider possible countermeasures.