Digital Library
Close Browse articles from a journal
 
<< previous   
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 8 of 8 found articles
 
 
  Untraceable Blind Signature Schemes Based on Discrete Logarithm Problem
 
 
Title: Untraceable Blind Signature Schemes Based on Discrete Logarithm Problem
Author: Cheng-Chi Lee
Wei-Pang Yang
Min-Shiang Hwang
Appeared in: Fundamenta informaticae
Paging: Volume 55 (2003) nr. 3-4 pages 307-320
Year: 2003-09-02
Contents: With the help of a blind signature scheme, a requester can obtain a signature on a message from a signer such that the signer knows nothing about the content of the messages and is unable to link the resulting message-signature pair; namely, a blind signature scheme can achieve both blindness and untraceability. Due to the above properties, the blind signature scheme can be used in cryptographic applications such as electronic voting systems and cash payment systems. So far, most of the proposed blind signature schemes are based on the difficulty of solving the factoring problem and quadratic residues. In this paper, the authors intend to propose two new untraceable blind signature schemes based on the difficulty of solving the discrete logarithm problem. The two blind signature schemes are two variations of the DSA signature scheme and can fully satisfy all of the properties a blind signature scheme can have.
Publisher: IOS Press
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 8 of 8 found articles
 
<< previous   
 
 Koninklijke Bibliotheek - National Library of the Netherlands