A Multisignature Scheme Based on the SDLP and on the IFP

Abstract

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.

Lattice-Based Multi-Signature Schemes

“…In recent years, many lattice-based cryptosystems such as lattice-based group signature scheme [6], lattice-based blind signature scheme [7], lattice-based ring signature scheme [8], lattice-based threshold ring signature scheme [9], lattice-based proxy signature schemes [10,11,12], verifiably encrypted signature scheme [13] and strong designate verifier signature scheme [14] are proposed successively. However, most existing digital multi-signature schemes [15,16,17] are designed on the Integer Factorization Problem, the Discrete Logarithm Problem and so on.…”

Insider Forgery Cryptanalysis of Two Post-Quantum Multi-Signature Schemes

“…A multi-signature scheme allows a group of signers to sign the same message cooperatively and anyone can verify the validity of the signature. Up to date, most existing digital multi-signature schemes [12,13,14] are designed on the Integer Factorization Problem, the Discrete Logarithm Problem, Bilinear pairings and so on. In 2010, Mohammed Meziani and Pierre-Louis Cayrel [15] proposed two post-quantum multi-signature schemes based on the so-called CFS signature scheme [11] and the KKS signature scheme [10].…”