Paper 2009/499

Underlying Assumptions and Designated Verifier Signatures

Chifumi Sato, Takeshi Okamoto, and Eiji Okamoto

Abstract

In this paper, we define an underlying computational problem and its decisional problem. As an application of their problems, we propose an efficient designated verifier signature (DVS) scheme without random oracles (related to symmetric pairings). We formally redefine the (Strong) Privacy of Signature's Identity, and prove our DVS scheme satisfying security based on the difficulty of the problems. Also we prove that the difficulty of the computational problem is tightly equivalent to the Strong Unforgeability of our proposed conventional signature scheme (without random oracles) related to asymmetric pairings. We believe that our underlying problems are profitable to propose many efficient cryptographic schemes.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Designated verifier signaturesDigital signaturesStandard model
Contact author(s)
c-sato @ sbins co jp
History
2009-10-30: revised
2009-10-14: received
See all versions
Short URL
https://ia.cr/2009/499
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2009/499,
      author = {Chifumi Sato and Takeshi Okamoto and Eiji Okamoto},
      title = {Underlying Assumptions and Designated Verifier Signatures},
      howpublished = {Cryptology ePrint Archive, Paper 2009/499},
      year = {2009},
      note = {\url{https://eprint.iacr.org/2009/499}},
      url = {https://eprint.iacr.org/2009/499}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.