A BLIND SIGNATURE BASED ON DISCRETE LOGARITHM PROBLEM

被引：0

作者：

Shen, Victor R. L. ^{[1
]}

Chung, Yu Fang ^{[3
]}

Chen, Tzer Shyong ^{[4
]}

Lin, Yu An ^{[2
]}

机构：

[1] Natl Taipei Univ, Dept Comp Sci & Informat Engn, New Taipei City 23741, Taiwan

[2] Natl Taipei Univ, Grad Inst Elect Engn, New Taipei City 23741, Taiwan

[3] Tunghai Univ, Dept Elect Engn, Taichung 40704, Taiwan

[4] Tunghai Univ, Dept Informat Management, Taichung 40704, Taiwan

来源：

INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL | 2011年 / 7卷 / 09期

关键词：

Blind signature; Digital signature; Discrete logarithm problem; SCHEME; EFFICIENT; CRYPTANALYSIS;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The concept of a blind signature scheme deals with the request that the signer should sign on a blind message. The characteristic of blind signatures is that the requester enables to derive the signature but the signer disables to link a pair of signatures when the requester releases the signature pair in public. This study proposes a new blind signature scheme based on the discrete logarithm problem and the generalized ElGamal-type digital signature scheme by Hare. With high security, the proposed blind signature scheme meets the requirements like correctness, blindness, unforgeability and untraceability.

引用

页码：5403 / 5416

页数：14

共 50 条

[31] Security Analysis and The Improvement of the sequential multi-signature scheme based on discrete logarithm [J].

Zhang, Xinghua .

2013 3RD INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS, COMMUNICATIONS AND NETWORKS (CECNET), 2013, :581-584

[32] ON THE DISCRETE LOGARITHM PROBLEM IN CLASS GROUPS OF CURVES [J].

Diem, Claus .

MATHEMATICS OF COMPUTATION, 2011, 80 (273) :443-475

[33] On the discrete logarithm problem in elliptic curves II [J].

Diem, Claus .

ALGEBRA & NUMBER THEORY, 2013, 7 (06) :1281-1323

[34] A deterministic algorithm for the discrete logarithm problem in a semigroup [J].

Tinani, Simran ;

Rosenthal, Joachim .

JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2022, 16 (01) :141-155

[35] An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem [J].

Meshram, Chandrashekhar .

INFORMATION PROCESSING LETTERS, 2015, 115 (02) :351-358

[36] BASE OF EXPONENT REPRESENTATION MATTERS-MORE EFFICIENT REDUCTION OF DISCRETE LOGARITHM PROBLEM AND ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM TO THE QUBO PROBLEM [J].

Wroński, Michal ;

Dzierzkowski, Lukasz .

Quantum Information and Computation, 2024, 24 (7-8) :541-564

[37] An ID-Based Public key Cryptosystem based on the Double Discrete Logarithm Problem [J].

Meshram, Chandrashekhar ;

Agrawal, Shyam Sundar .

INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2010, 10 (07) :8-13

[38] Cubic Sieve Congruence of the Discrete Logarithm Problem, and fractional part sequences [J].

Vivek, Srinivas ;

Madhavan, C. E. Veni .

JOURNAL OF SYMBOLIC COMPUTATION, 2014, 64 :22-34

[39] The discrete logarithm problem in Bergman's non-representable ring [J].

Banin, Matan ;

Tsaban, Boaz .

JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2012, 6 (02) :171-182

[40] A Secure Anonymous E-Voting System based on Discrete Logarithm Problem [J].

Chen, Chin-Ling ;

Chen, Yu-Yi ;

Jan, Jinn-Ke ;

Chen, Chih-Cheng .

APPLIED MATHEMATICS & INFORMATION SCIENCES, 2014, 8 (05) :2571-2578

← 1 2 3 4 5 →