CryptoDB
A New Short Signature Scheme Without Random Oracles from Bilinear Pairings
| Authors: | |
|---|---|
| Download: | |
| Abstract: | In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new complexity assumption called the $k$+1 square roots assumption. We also discuss the relationship between the $k$+1 square roots assumption and some related problems and provide some conjectures. Moreover, the $k$+1 square roots assumption can be used to construct shorter signatures under the random oracle model. As some applications, a new chameleon hash signature scheme and a on-line/off-line signature scheme and a new efficient anonymous credential scheme based on the proposed signature scheme are presented. |
BibTeX
@misc{eprint-2005-12720,
title={A New Short Signature Scheme Without Random Oracles from Bilinear Pairings},
booktitle={IACR Eprint archive},
keywords={Short signature, Bilinear pairings,Standard model, Random oracle, Anonymous credential},
url={http://eprint.iacr.org/2005/386},
note={ isszhfg@mail.sysu.edu.cn 13343 received 24 Oct 2005, last revised 14 Jul 2006},
author={Fangguo Zhang and Xiaofeng Chen and Willy Susilo and Yi Mu},
year=2005
}