scholarly journals Attacks on One Designated Verifier Proxy Signature Scheme

2012 ◽  
Vol 2012 ◽  
pp. 1-6 ◽  
Author(s):  
Baoyuan Kang
Keyword(s):  
Standard Model ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Proxy Signature ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Random Oracles ◽  
The Standard Model ◽  
New Construction ◽  
Designated Verifier

In a designated verifier proxy signature scheme, there are three participants, namely, the original signer, the proxy signer, and the designated verifier. The original signer delegates his or her signing right to the proxy signer, then the proxy signer can generate valid signature on behalf of the original signer. But only the designated verifier can verify the proxy signature. Several designated verifier proxy signature schemes have been proposed. However, most of them were proven secure in the random oracle model, which has received a lot of criticism since the security proofs in the random oracle model are not sound with respect to the standard model. Recently, by employing Water's hashing technique, Yu et al. proposed a new construction of designated verifier proxy signature. They claimed that the new construction is the first designated verifier proxy signature, whose security does not rely on the random oracles. But, in this paper, we will show some attacks on Yu et al.'s scheme. So, their scheme is not secure.

A Provably Secure ID-Based Designated Verifier Proxy Signature Scheme Based on DLP

2013 ◽  
Vol 411-414 ◽  
pp. 721-724 ◽  
Author(s):  
Bao Dian Wei
Keyword(s):  
Discrete Logarithm ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Proxy Signature ◽  
Signature Scheme ◽  
Signature Schemes ◽  
The Common ◽  
Designated Verifier ◽  
Provably Secure

Most of the existing ID-based designated verifier proxy signature schemes are implemented with pairings. The computation of parings is still much more expensive than the common modular multiplications and exponentiations. To obtain better efficiency, we construct an efficient ID-based DVPS scheme without pairings. The scheme is designed based on the hardness of the discrete logarithm problems. It is proven secure against adaptively chosen message attacks, in the random oracle model.

scholarly journals Strong Designated Verifier Signature Scheme with Undeniability and Strong Unforgeability in the Standard Model

2019 ◽  
Vol 9 (10) ◽  
pp. 2062
Author(s):  
Xiaodong Yang ◽  
Guilan Chen ◽  
Ting Li ◽  
Rui Liu ◽  
Meiding Wang ◽  
...  
Keyword(s):  
Standard Model ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Private Key ◽  
Random Oracles ◽  
Computational Overhead ◽  
The Standard Model ◽  
Designated Verifier ◽  
Designated Verifier Signature ◽  
Strong Unforgeability

Strong designated verifier signature can provide an efficient way to protect the identity privacy of the signer and the integrity of the data transmitted over the public channel. These characteristics make it very useful in outsourcing computing, electronic voting, electronic bidding, electronic auction and other fields. However, most strong designated verifier signature schemes are unable to identify the real signature generator when the signer and the designated verifier dispute a signature. In addition, the existing strong designated verifier signature schemes in the standard model rarely satisfy strong unforgeability, and thus cannot prevent the attacker from forging a valid signature on any previously signed message. Therefore, designing a strong designated verifier signature scheme without random oracles that satisfies strong unforgeability and undeniability is very attractive in both practice and theory. Motivated by these concerns, we design the first undeniable strong designated verifier signature scheme without random oracles, in which the arbiter can independently perform the judgment procedure to prove whether a controversial signature is generated by the signer or the designated verifier. Under standard assumptions, the scheme is proved to be strongly unforgeable in standard model. Furthermore, it not only achieves non-transferability and privacy of the signer’s identity but also satisfies the undeniable property of traditional digital signature schemes. Performance analysis results show that the length of the signer’s private key, the designated verifier’s private key and signature length are 40 bits, 40 bits and 384 bits, respectively. Compared with he related schemes, the proposed scheme has higher performance in signature length, private key size and computational overhead. Finally, we show how to apply it to implement outsourcing computation in cloud computing.

Key Replacement Attack on Two Certificateless Signature Schemes without Random Oracles

2010 ◽  
Vol 439-440 ◽  
pp. 1606-1611 ◽  
Author(s):  
Qi Xia ◽  
Chun Xiang Xu ◽  
Yong Yu
Keyword(s):  
Standard Model ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
The Public ◽  
Random Oracles ◽  
The Standard Model ◽  
Replacement Attack ◽  
Certificateless Signature

Liu et al. proposed the first certificateless signature scheme without random oracles in 2007. However, Xiong et al. showed that Liu et al.'s scheme is insecure against a malicious-but-passive KGC attack and proposed an improved scheme. In ISA 2009, Yuan et al. also proposed a new certificateless signature scheme without random oracles. Although they claimed that the two schemes are secure in the standard model, this paper shows that both Xiong et al.'s improved scheme and Yuan et al.'s new scheme are vulnerable to key replacement attack, where an adversary, obtaining a signature on a message and replacing the public key of a signer, can forge valid signatures on the same message under the replaced public key. We also give the corresponding modifications of the two schemes to resist key replacement attack.

scholarly journals A Generic Framework for Accountable Optimistic Fair Exchange Protocol

Symmetry ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 285
Author(s):  
Jia-Ch’ng Loh ◽  
Swee-Huay Heng ◽  
Syh-Yuan Tan
Keyword(s):  
Standard Model ◽  
Random Oracle Model ◽  
Building Blocks ◽  
Random Oracle ◽  
Fair Exchange ◽  
Generic Framework ◽  
The Standard Model ◽  
Security Properties ◽  
Optimistic Fair Exchange ◽  
The One

Optimistic Fair Exchange protocol was designed for two parties to exchange in a fair way where an arbitrator always remains offline and will be referred only if any dispute happens. There are various optimistic fair exchange protocols with different security properties in the literature. Most of the optimistic fair exchange protocols satisfy resolution ambiguity where a signature signed by the signer is computational indistinguishable from the one resolved by the arbitrator. Huang et al. proposed the first generic framework for accountable optimistic fair exchange protocol in the random oracle model where it possesses resolution ambiguity and is able to reveal the actual signer when needed. Ganjavi et al. later proposed the first generic framework in the standard model. In this paper, we propose a new generic framework for accountable optimistic fair exchange protocol in the standard model using ordinary signature, convertible undeniable signature, and ring signature scheme as the underlying building blocks. We also provide an instantiation using our proposed generic framework to obtain an efficient pairing-based accountable optimistic fair exchange protocol with short signature.

Identity-Based Convertible Limited Verifier Signature Scheme in the Standard Model

2011 ◽  
Vol 48-49 ◽  
pp. 599-602 ◽  
Author(s):  
Xiao Qin Shen ◽  
Yang Ming
Keyword(s):  
Standard Model ◽  
Digital Signatures ◽  
Random Oracle ◽  
Signature Scheme ◽  
Security Proofs ◽  
The Standard Model ◽  
Identity Based ◽  
Public Verification

A convertible limited verifier signature (CLVS) can be used to solve conflicts between authenticity and privacy in the digital signatures. In a CLVS scheme, the signature can be verified by a limited verifier. When necessary, the limited verifier can provide a proof to convince a judge that the signer has indeed generated the signature. However, the judge cannot transfer this proof to convince any other party. Also, the limited verifier signature should be converted into an ordinary one for public verification if required. In this paper, we proposed firstly identity-based converible limited verifier signature scheme in the standard model. We give the security proofs of our scheme and show that Our scheme achieved the desired security notions in the standard model (without random oracle).

Sign in / Sign up

Export Citation Format

Share Document