Strong Designated Verifier Signature Schemes with Undeniable Property and Their Applications

Hu, Xiaoming; Tan, Wenan; Xu, Hongtao; Wang, Jian; Ma, Chuang

doi:10.1155/2017/7921782

Cited by 8 publications

(10 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the signer needs to store all previous signature data to identify the real generator in a signature, and the judgment process needs the help of the signer. To improve the fairness of the judgment, Hu et al [14] designed two undeniable SDVS schemes in which the arbiter can independently identify the real signer in a disputed signature. However, Yang et al's scheme [12] and Hu et al's schemes [14] were provably secure in the random oracle model.…”

Section: Related Workmentioning

confidence: 99%

“…To improve the fairness of the judgment, Hu et al [14] designed two undeniable SDVS schemes in which the arbiter can independently identify the real signer in a disputed signature. However, Yang et al's scheme [12] and Hu et al's schemes [14] were provably secure in the random oracle model. Unfortunately, there is no strongly unforgeable SDVS scheme with the undeniable property in the standard model.…”

Section: Related Workmentioning

confidence: 99%

“…In this section, we design a strongly unforgeable SDVS scheme with undeniable property on the basis of a variant of Waters' scheme [28]. Although a few SDVS schemes [12][13][14] satisfy undeniability, their security depends on ideal random oracles, which might be insecure in reality. Most of the SDVS schemes [17,18] without random oracles are malleable, so they cannot achieve strong unforgeability.…”

Section: The Sdvs-usu Schemementioning

confidence: 99%

“…The SDVS-USU scheme is compared with other SDVS schemes [14,18,20] in terms of performance and security properties. In Tables 1 and 2, the Size, Sign and Verify columns represent the size of a signature, and the computational cost of signature generation and signature verification, respectively.…”

Section: Comparisonmentioning

confidence: 99%

“…In this scenario, the undeniability property is very essential for SDVS. There are a few SDVS schemes with undeniability, and they were proved to be secure in the random oracle model [12][13][14]. Unfortunately, Canetti et al [15] showed that the cryptographic scheme in the random oracle model may be insecure when the random oracle is instantiated by a concrete hash function.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

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

Yang

Chen

et al. 2019

Applied Sciences

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: The Sdvs-usu Schemementioning

confidence: 99%

Section: Comparisonmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

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

Yang

Chen

et al. 2019

Applied Sciences

View full text Add to dashboard Cite

show abstract

Strong Designated Verifier Signature Based on the Rank Metric

Assidi¹,

Souidi²

2020

Information Security Theory and Practice

View full text Add to dashboard Cite

Strong designated verifier signatures (SDVS) allows users to produce signatures that are not publicly verifiable, such that no one other than the signer and the designated verifier can check the validity of a given signature, which preserves the privacy of the signer. This cryptographic primitive is very useful in different real life scenarios such as e-voting and e-bidding. In this paper, we propose a strong designated verifier signature scheme (SDVS) based on rank metric error correcting codes. Our construction makes a trade-off between efficiency and security requirements, for instance we achieve a signature of size 3510 bits and a public key of size equal to 23088 bits for the 80 security level. Furthermore, our proposal is quantum computer resistant since it is based on coding theory.

show abstract

A Certificateless Verifiable Strong Designated Verifier Signature Scheme

et al. 2019

View full text Add to dashboard Cite

Certificateless strong designated verifier signature schemes have realized the merit of CL-PKC against the traditional strong designated verifier signatures. However, when the signer and the designated verifier disagree with the signature, existing schemes cannot distinguish the original signature from the signature transcript. In addition, errors or malicious actions introduced by the designated verifier may lead to the failure of signature verification. To solve these issues, we propose a certificateless verifiable strong designated verifier signature scheme. When disputes arise between the signer and the verifier, the scheme can effectively prevent the signer from denying the signature generated by the signer, as well as the designated verifier from denying valid signatures or invalid ones. Our scheme does not rely on bilinear pairings. The proposed scheme satisfies the requirements of verifiability, unforgeability, non-delegability, non-transferability and signer ambiguity. We also provide formal security proof in the random oracle model for the proposed scheme. INDEX TERMS Certificateless signature, strong designated verifier signature, ECDLP, verifiable.

show abstract

Strong Designated Verifier Signature Schemes with Undeniable Property and Their Applications

Cited by 8 publications

References 20 publications

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

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

Strong Designated Verifier Signature Based on the Rank Metric

A Certificateless Verifiable Strong Designated Verifier Signature Scheme

Contact Info

Product

Resources

About