A systematic method to design strong designated verifier signature without random oracles

Summary Strong Designated Verifier Signature (SDVS) provides authentication for the signer and the verifier such that the signer is assured that what s/he has signed, is only verified by the designated verifier. Currently, the security of most of the SDVS schemes is based on hard problems in the number theory. As it is proved that all kinds of cryptosystems which are based on the number theory will not tolerate quantum attacks, here, an SDVS scheme based on hard problems in coding theory is presented. We have proved that the suggested scheme is unforgeable under a chosen message attack in Random Oracle Model. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

“…The cbSDVS in comparison with other SDVSs which use exponential computation in

{double-struckZ}_{q}

or pairing, such as is very fast particularly in the verification stage as it only uses binary operations.…”

Section: Our Proposed Schemementioning

confidence: 99%

“…The cbSDVS in comparison with other SDVSs which use exponential computation in Z q or pairing, such as [25,[36][37][38][39] is very fast particularly in the verification stage as it only uses binary operations. It is possible to apply the parallel-CFS [40] to our scheme.…”

Section: Efficiency Analysismentioning

confidence: 99%

Provably secure strong designated verifier signature scheme based on coding theory

Shooshtari

Ahmadian-Attari

Aref

2016

Int J Communication

View full text Add to dashboard Cite

show abstract

“…In this section, based on Tian et al's strong designed verifier signature scheme [13], we present an efficient identity-based signature scheme. Then we give a detailed security analysis of the proposed scheme.…”

Section: Our Identity-based Signature Schemementioning

confidence: 99%

“…We adopt the similar proof method as Tian et al [13] and Kang et al [14] to analyze the security of our identity-based signature scheme. Proof Assume that (g, g a , g b ) is an instance of the CDH problem which is given to the simulator (challenger) B.…”

Section: Security Analysis Of Our Schemementioning

confidence: 99%

See 1 more Smart Citation

An Efficient Identity-Based Proxy Signature Scheme in the Standard Model with Tight Reduction

et al. 2015

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Identity-based proxy signature (IDPS) is a special signature. It has many applications, such as distribution networks, mobile communication, etc. Numerous IDPS schemes have been proposed. However, most existing IDPS schemes suffer the following shortcoming: loose security reduction. This problem is very important because loose security reduction weakens the security of IDPS and makes IDPS more vulnerable to attack. In this study, based on Kang et al.'s proof technical, we propose a new identity-based proxy signature scheme with a detailed security proof in the standard model. We also reduce the security of our scheme to the hardness assumption of computational Diffie-Hellman. In order to present the advance of our scheme, we make a theory comparison between our scheme with other identity-based proxy signature schemes in terms of security reduction and computational cost. The comparison shows that our scheme has tightest security reduction. What's more, our scheme needs less computational cost that is almost half of other schemes.Keywords Information security ⋅ Identity-based signature ⋅ Identity-based proxy signature ⋅ Tight reduction ⋅ CDH InstructionIn 1984, Shamir [1] first proposed the concept of identity-based cryptography that can simplify the key management process in certificate-based public key settings. IDPS scheme is a special identity-based signature (IBS) scheme [2][3][4], which can

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 systematic method to design strong designated verifier signature without random oracles

Cited by 11 publications

References 6 publications

Provably secure strong designated verifier signature scheme based on coding theory

Provably secure strong designated verifier signature scheme based on coding theory

An Efficient Identity-Based Proxy Signature Scheme in the Standard Model with Tight Reduction

Strong Designated Verifier Signature Based on the Rank Metric

Contact Info

Product

Resources

About