GDL

Journal from gdlhub / 2019-07-25 14:31:50
Oleh : Duc Nguyen Tan, Hai Nguyen Nam, Minh Nguyen Hieu, Telkomnika
Dibuat : 2019-07-25, dengan 1 file

Keyword : blind signature, blind multi-signature, digital signature, discrete logarithm problem, integer factorization problem
Url : http://journal.uad.ac.id/index.php/TELKOMNIKA/article/view/10525
Sumber pengambilan dokumen : WEB

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.

Beri Komentar ?#(0) | Bookmark

Properti	Nilai Properti
ID Publisher	gdlhub
Organisasi	Telkomnika
Nama Kontak	Herti Yani, S.Kom
Alamat	Jln. Jenderal Sudirman
Kota	Jambi
Daerah	Jambi
Negara	Indonesia
Telepon	0741-35095
Fax	0741-35093
E-mail Administrator	elibrarystikom@gmail.com
E-mail CKO	elibrarystikom@gmail.com