基于XTR体制的盲签名方案

陈晓峰; 高虎明; 王育民

基于XTR体制的盲签名方案

计量
- 文章访问数: 2064
- HTML全文浏览量: 71
- PDF下载量: 718
- 被引次数: 0
出版历程
- 收稿日期: 2002-01-28
- 修回日期: 2002-07-03
- 刊出日期: 2003-06-19

Blind Signature schemes based on XTR system

摘要

摘要: XTR是一种新的基于有限域的乘法群的子群中元素迹的紧致表示的公钥密码体制。与RSA和ECC相比较,同等安全程度下 XTR密钥长度远远小于 RSA,最多只是 ECC密钥长度的 2倍,但XTR参数和密钥选取的速度远远快于 ECC。利用基于离散对数问题的盲签名方案以及有限域中元素迹的快速算法,该文给出了两种基于 XTR体制的盲签名方案,其安全性等价于解 XTR-DL困难问题,但是传输的数据量只有原来方案的 1/3。
- XTR公钥体制; 盲签名; 迹表示
Abstract: XTR is a new public key system based on a method to represent elements of a subgroup of a multiplicative group of a finite field. Compared to RSA and ECC, XTR keys are much smaller than RSA keys of equivalent security, and at most twice as big as ECC keys, but parameter and key selection for XTR are much faster than ECC. Based on XTR system by using traditional blind signature schemes based on discrete logarithm problem and fast method for computing the trace of the elements in the finite field, two blind signature schemes are presented in this paper, the security of which is equivalence to solving XTR-DL problem while the datum is only as 1/3 as that of the previous schemes.

HTML全文

参考文献(1)

A.K. Lenstra, E. R. Verheul, The XTR public key system, Crypto2000, California, USA, LNCS 1880, Springer-Verlag 2000, 1-19.[2]A.E. Brouwer.[J].R. Pellikaan, E. R. Verheul, Doing more with fewer bits, Asiacrypt99, Singapore,LNCS 1716, Springer-Verlag.1999,:-[3]D. Chaum.[J].Blind signature for untraceable payments, Eurocrypt82, Burg Feuerstein, Germany, Plenum Press.1983,:-[4]M. Stadler.[J].J. M. Piveteau, Jan. Camenisch, Fair blind signatures, Eurocrypt95, St. Malo, France, LNCS 921, Springer-Verlag.1995,:-[5]J.L.C amenisch.[J].J. M. Piveteau, M. A. Stadler, Blind signature based on discrete logarithm problem, Eurocrypt94, Perugia, Italy, LNCS 950, Springer-Verlag.1994,:-[6]D. Pointcheval.[J].J. Stern, Provably secure blind signature schemes, Asiacrypt96, Kyongju, Korea,LNCS 1163, Springer-Verlag.1996,:-[7]A.K. Lenstra.[J].E. R. Verheul, Key improvements to XTR, Asiacrypt2000, Kyoto, Japan, LNCS1880, Springer-Verlag.2000,:-A. Menezes, Comparing the security of ECC and RSA, manuscript, 2000, available from www.carc.math.uwaterloo.ca/aj meneze/misc/cryptopramar tical.html.[8]E.R. Verheul.[J].Evidence that XTR is more secure than supersingular elliptic curve cryptosystems, Eurocrypt2001, Innsbruck, Austria, LNCS 2045, Springer-Verlag.2001,:-A. K Lenstra.[J].E.R. Verheul, Fast irreducibility and subgroup membership testing in XTR,PKC2001, Cheju Island, Korea, LNCS 1992, Springer-Verlag.2001,:-[9]A. Menezes, S. A. Vanstoe, ECSTR(XTR): Elliptic curve singular trace representation, RumpSession of Crypto2000.[10]M. Stam, A. K. Lenstra, Speeding up XTR, available from www.ecstr.com/.

施引文献

资源附件(0)

访问统计