A multisignature scheme based on the SDLP and on the IFP

Authors:
R. Durán Díaz;L. Hernández Encinas;J. Muñoz Masqué
Affiliations:
Universidad de Alcalá, Spain;Instituto de Física Aplicada, CSIC, Madrid, Spain;Instituto de Física Aplicada, CSIC, Madrid, Spain
Venue:
CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
Year:
2011

Citing 8
Cited 0

A digital multisignature scheme using bijective public-key cryptosystems

ACM Transactions on Computer Systems (TOCS)
Some applications of multiple key ciphers

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Fail-Stop Signatures

SIAM Journal on Computing
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Weaknesses in some multisignature schemes for specified group of verifiers

Information Processing Letters
Two efficient RSA multisignature schemes

ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Multi-signatures in the plain public-Key model and a general forking lemma

Proceedings of the 13th ACM conference on Computer and communications security
Short fail-stop signature scheme based on factorization and discrete logarithm assumptions

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multisignature schemes are digital signature schemes that permit one to determine a unique signature for a given message, depending on the signatures of all the members of a specific group. In this work, we present a new semi-short multisignature scheme based on the Subgroup Discrete Logarithm Problem (SDLP) and on the Integer Factorization Problem (IFP). The scheme can be carried out in an on- and off-line basis, is efficient, and the bitlength of the multisignature does not depend on the number of signers.