Blind Signature Based on Discrete Logarithm Type Cryptosystem

被引:0
|
作者
Zhou, Xuanwu [1 ]
Fu, Yan [1 ]
机构
[1] Tianjin Univ, Tianjin 300072, Peoples R China
关键词
discrete logarithm problem; scheme generalization; blind signature; elliptic curves; security analyses; PARALLEL INTERFERENCE CANCELLATION; DS-CDMA;
D O I
10.4028/www.scientific.net/AMR.204-210.1318
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Discrete logarithm problem is an important trapdoor function to design asymmetric cryptosystem, and some fast public key cryptosystems have been designed based on it. In the paper, we introduced fast asymmetric cryptosystem into the designing and analyzing of blind signature, and presented improved blind signature schemes based on ECC (Elliptic Curves Cryptosystem). The trapdoor function of the blind signatures is based on ECDLP (Elliptic Curves Discrete Logarithm Problem), and the algorithms of the scheme make full use of the superiority of ECC, such as high efficiency and short key length. The improved blind signature schemes can achieve the same security level with less storing space, smaller communication band-width and less overheads regarding software and hardware application. Furthermore, the algorithms in the schemes can be generalized into other public key cryptosystems based on discrete logarithm problem without any influence to efficiency or security.
引用
收藏
页码:1318 / 1321
页数:4
相关论文
共 50 条
  • [1] A BLIND SIGNATURE BASED ON DISCRETE LOGARITHM PROBLEM
    Shen, Victor R. L.
    Chung, Yu Fang
    Chen, Tzer Shyong
    Lin, Yu An
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2011, 7 (09): : 5403 - 5416
  • [2] A new blind signature based on the discrete logarithm problem for untraceability
    Lee, CC
    Hwang, MS
    Yang, WP
    APPLIED MATHEMATICS AND COMPUTATION, 2005, 164 (03) : 837 - 841
  • [3] Blind collective signature protocol based on Discrete logarithm problem
    Moldovyan, Nikolay A.
    Moldovyan, Alexander A.
    International Journal of Network Security, 2010, 11 (02) : 106 - 113
  • [4] Untraceable blind signature schemes based on discrete logarithm problem
    Lee, CC
    Yang, WP
    Hwang, MS
    FUNDAMENTA INFORMATICAE, 2003, 55 (3-4) : 307 - 320
  • [5] Provable security for blind signature on discrete logarithm
    Zhou, Xuanwu
    Fu, Yan
    Jin, Zhigang
    Fu, Zhenqiang
    Qin, Lianmin
    Journal of Information and Computational Science, 2010, 7 (14): : 3133 - 3140
  • [6] Comment: A new blind signature based on the discrete logarithm problem for untraceability
    Wu, T
    Wang, JR
    APPLIED MATHEMATICS AND COMPUTATION, 2005, 170 (02) : 999 - 1005
  • [7] Blind Signature Schemes Based on the Elliptic Curve Discrete Logarithm Problem
    Popescu, Constantin
    STUDIES IN INFORMATICS AND CONTROL, 2010, 19 (04): : 397 - 402
  • [8] New Blind Signature Schemes Based on the (Elliptic Curve) Discrete Logarithm Problem
    Mala, Hamid
    Nezhadansari, Nafiseh
    PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE 2013), 2013, : 196 - 201
  • [9] A Novel Untraceable Blind Signature Based on Elliptic Curve Discrete Logarithm Problem
    Jena, Debasish
    Jena, Sanjay Kumar
    Majhi, Banshidhar
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2007, 7 (06): : 269 - 275
  • [10] An Efficient Blind Signature Scheme Based on the Elliptic Curve Discrete Logarithm Problem
    Nikooghadam, Morteza
    Zakerolhosseini, Ali
    ISECURE-ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2009, 1 (02): : 125 - 131