Cryptology ePrint Archive: Report 2007/007

One-Round ID-Based Blind Signature Scheme without ROS Assumption

Wei Gao and Xueli Wang and Guilin Wang and Fei Li

Abstract: In this paper, we propose a new ID-based blind signature scheme based on bilinear pairings from scratch (i.e. without using existing ID-based signature schemes, and without using existing computational assumptions). First, the round complexity of our ID-based blind signature scheme is optimal. Namely, each interactive signature generation requires the requesting user and the signer to transmit only one message each. Second, the proposed scheme is provably secure against generic parallel attack without using the ROS assumption. Indeed, the security of the proposed scheme is based on a new formalized assumption called one-more bilinear Diffie-Hellman Inversion (1m-BDHI) assumption.

Category / Keywords: public-key cryptography / ID-based Signatures, Blind signatures, Bilinear Pairings.

Date: received 5 Jan 2007

Contact author: sdgaowei at yahoo com cn

Available format(s): PDF | BibTeX Citation

Version: 20070107:115522 (All versions of this report)

Short URL: ia.cr/2007/007