An improved discrete logarithm-based multisignature scheme

Authors:
Lian Jie Wang;Jonathan Jen-Rong Chen
Affiliations:
Department of Information Management, Vanung University, ChungLi, TaoYuan 32061, Taiwan;Department of Information Management, Vanung University, ChungLi, TaoYuan 32061, Taiwan
Venue:
Security and Communication Networks
Year:
2012

Citing 13
Cited 0

A digital multisignature scheme using bijective public-key cryptosystems

ACM Transactions on Computer Systems (TOCS)
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
ElGamal-like digital signature and multisignature schemes using self-certified public keys

Journal of Systems and Software
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Cryptography and Network Security (4th Edition)

Cryptography and Network Security (4th Edition)
Some Observations on the Theory of Cryptographic Hash Functions

Designs, Codes and Cryptography
Improvement of identity-based proxy multi-signature scheme

Journal of Systems and Software
An ID-based multisignature scheme without reblocking and predetermined signing order

Computer Standards & Interfaces
A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack

Journal of Cryptology
Using hash functions as a hedge against chosen ciphertext attack

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Improvement of an Efficient ID-Based RSA Multisignature

CISIS '10 Proceedings of the 2010 International Conference on Complex, Intelligent and Software Intensive Systems
Identity-Based aggregate and multi-signature schemes based on RSA

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
A public key cryptosystem and a signature scheme based on discrete logarithms

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many researchers have investigated the Rivest, Shamir, and Adleman (RSA) and ElGamal algorithms for digital multisignatures. Computational and communicational costs increase rapidly after a series of signings; these methods are unsuitable for organizations with multiple geographic locations. Because these methods require many online tasks, problems such as theft, data falsification, and masquerading often occur. This study therefore proposes a digital multisignature scheme that decreases computational costs and achieves quick validation. Copyright © 2011 John Wiley & Sons, Ltd.