Cryptology ePrint Archive: Report 2009/499

Underlying Assumptions and Designated Verifier Signatures

Chifumi Sato and 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.

Category / Keywords: public-key cryptography / Designated verifier signatures, Digital signatures, Standard model

Date: received 13 Oct 2009, last revised 30 Oct 2009

Contact author: c-sato at sbins co jp

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20091030:121407 (All versions of this report)

Short URL: ia.cr/2009/499

Discussion forum: Show discussion | Start new discussion