Practical strong designated verifier signature schemes based on double discrete logarithms

Authors:
Raylin Tso;Takeshi Okamoto;Eiji Okamoto
Affiliations:
Department of Risk Engineering, Graduate School of Systems and Information Engineering, University of Tsukuba, Ibaraki, Japan;Department of Risk Engineering, Graduate School of Systems and Information Engineering, University of Tsukuba, Ibaraki, Japan;Department of Risk Engineering, Graduate School of Systems and Information Engineering, University of Tsukuba, Ibaraki, Japan
Venue:
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
Year:
2005

Citing 4
Cited 4

An Efficient Protocol for Authenticated Key Agreement

Designs, Codes and Cryptography
Short Signatures from the Weil Pairing

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Designated verifier proofs and their applications

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
One-Way and two-party authenticated ID-Based key agreement protocols using pairing

MDAI'05 Proceedings of the Second international conference on Modeling Decisions for Artificial Intelligence

Interpolation of the Double Discrete Logarithm

WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
Strong designated verifier signature in a multi-user setting

AISC '09 Proceedings of the Seventh Australasian Conference on Information Security - Volume 98
Non-delegatable strong designated verifier signature on elliptic curves

ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Designated verifier signature: definition, framework and new constructions

UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We notice that a strong designated verifier signature (SDVS) scheme can easily be realized by any secure one-way and two-party authenticated key agreement scheme. So any SDVS scheme without lower communication/computation cost or enhanced security comparing to these one-way and two-party authenticated key agreement schemes may have less advantage in practical use. In this paper, we introduce an SDVS scheme which realizes low communication/computation cost and is more efficient than current one-way key agreement schemes and SDVS schemes. In addition, we show how to remove a hash function used in this scheme where in this modified scheme, an enhanced security will be provided such that the consistency of a signature cannot be ascertained by any third party even if the signer’s private key is revealed. We will prove the security of our schemes using random oracle models.