Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17] [ 18] [ 19]

@

Journal of Information Science and Engineering, Vol. 30 No. 6, pp. 2003-2017 (November 2014)


An Anonymous Signature Scheme in the Standard Model*


BIN WANG1 AND XIAOJING HONG2
1Information Engineering College
Yangzhou University
Jiangsu Province, 225127 P.R. China
2Yangzhou Jianghai Polytechnic College
Jiangsu Province, 225101 P.R. China

Bellare et al. provided new definitions of anonymous signature and several constructions that meet the new definitions. They also presented a generic method to transform any standard signature scheme into an anonymous signature scheme by commitment functionality. Their generic transform yields anonymous signature schemes in the standard model. When applying this generic transform to Waters signature scheme, some additional communication overhead are incurred since one has to commit a long bit-string which is the concatenation of a standard signature and the corresponding public key. To address this efficiency issue, we directly transform Waters signature scheme into an efficient anonymous signature scheme. We prove that our construction meets the new definitions by use of code-based games.

Keywords: digital signature, anonymous signature, commitment, code-based games, standard model

Full Text () Retrieve PDF document (201411_18.pdf)

Received December 11, 2012; revised March 22 & March 29, 2013; accepted May 2, 2013.
Communicated by Xuejia Lai.
* This work is supported by Natural Science Foundation of Higher Education Institutions, in Jiangsu Province office of education, P.R. China (Grant No. 10KJD520005).