Abstract
Cryptography is increasingly used in E-commerce, especially in untraceable payment system and electronic voting system. Protocols for these systems require anonymous digital signing, and blind signature is the answer to it. Chaum stated that every blind signature protocol should hold two fundamental properties, blindness and intractableness. All blind signature schemes proposed so far are based on one of the following: integer factorization problem, discrete logarithm problem, and quadratic residues. However, Lee et al. declared that none of the schemes is able to meet the two fundamental properties above. This paper proposes an elliptic curve based blind signature scheme that possesses both the above properties.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
