Paper 2007/007
One-Round ID-Based Blind Signature Scheme without ROS Assumption
Wei Gao, Xueli Wang, 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.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- ID-based SignaturesBlind signaturesBilinear Pairings.
- Contact author(s)
- sdgaowei @ yahoo com cn
- History
- 2007-01-07: received
- Short URL
- https://ia.cr/2007/007
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/007,
author = {Wei Gao and Xueli Wang and Guilin Wang and Fei Li},
title = {One-Round ID-Based Blind Signature Scheme without ROS Assumption},
howpublished = {Cryptology ePrint Archive, Paper 2007/007},
year = {2007},
note = {\url{https://eprint.iacr.org/2007/007}},
url = {https://eprint.iacr.org/2007/007}
}
