CryptoDB
One-Round ID-Based Blind Signature Scheme without ROS Assumption
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2007-13289, title={One-Round ID-Based Blind Signature Scheme without ROS Assumption}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / ID-based Signatures, Blind signatures, Bilinear Pairings.}, url={http://eprint.iacr.org/2007/007}, note={ sdgaowei@yahoo.com.cn 13518 received 5 Jan 2007}, author={Wei Gao and Xueli Wang and Guilin Wang and Fei Li}, year=2007 }