IdMuS: An Efficient ID-Based Broadcast Multi-Signature Scheme from Lattices

Résumé fourni par la source

Multi-signature is a typical digital signature for signing one message by multiple signers. Its advantage is that the length of the signature is independent of the number of signers, even though multiple users sign the same message. It can therefore serve as a fundamental building block in many secure multiple computation scenarios, e.g., signing a transaction in blockchain applications, signing a routing message in routing discovery protocols, and so on. Nonetheless, most of the existing multi-signature schemes have been still based on traditional signatures over the hardness of number theory problems such as integer factoring or discrete logarithm, which may be insecure in future quantum computing environment. Besides, they impose the cost of public key infrastructure due to the authentication of public keys. Instead, identity-based (ID-based) signature can avoid such overhead due to the management of public keys by using a public identity as a public key. Therefore, in this paper we propose a broadcast multi-signature scheme that is ID-based and lattice-based (i.e., with the hardness assumption on solving lattice problems). Our scheme has the advantages from not only ID-based signatures but also lattice-based signatures. Moreover, the scheme is efficient as the signature length is short, which is suitable for length sensitive applications, e.g., signing transactions in a blockchain.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.