TELKOMNIKA (Telecommunication Computing Electronics and Control)
Vol 17, No 5: October 2019

Blind multi-signature scheme based on factoring and discrete logarithm problem

Duc Nguyen Tan (Posts and Telecommunication Institute of Technology)
Hai Nguyen Nam (Academy of Cryptography Techniques)
Minh Nguyen Hieu (Academy of Cryptography Techniques)



Article Info

Publish Date
01 Oct 2019

Abstract

One of the important objectives of information security systems is providing authentication of the electronic documents and messages. In that, blind signature schemes are an important solution to protect the privacy of users in security electronic transactions by highlighting the anonymity of participating parties. Many studies have focused on blind signature schemes, however, most of the studied schemes are based on single computationally difficult problem. Also digital signature schemes from two difficult problems were proposed but the fact is that only finding solution to single hard problem then these digital signature schemes are breakable. In this paper, we propose a new signature schemes base on the combination of the RSA and Schnorr signature schemes which are based on two hard problems: IFP and DLP. Then expanding to propose a single blind signature scheme, a blind multi-signature scheme, which are based on new baseline schemes.

Copyrights © 2019






Journal Info

Abbrev

TELKOMNIKA

Publisher

Subject

Computer Science & IT

Description

Submitted papers are evaluated by anonymous referees by single blind peer review for contribution, originality, relevance, and presentation. The Editor shall inform you of the results of the review as soon as possible, hopefully in 10 weeks. Please notice that because of the great number of ...