The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Threshold-multisignature schemes combine the properties of threshold <it>group-oriented</it> signature schemes and <it>multisignature</it> schemes to yield a signature scheme that allows a threshold <tmath>(t)</tmath> or more group members to collaboratively sign an arbitrary message. In contrast to threshold <it>group</it> signatures, the individual signers do not remain anonymous, but are <it>publicly</it> identifiable from the information contained in the valid threshold-multisignature. The main objective of this paper is to propose such a secure and efficient threshold-multisignature scheme. The paper uniquely defines the fundamental properties of threshold-multisignature schemes and shows that the proposed scheme satisfies these properties and eliminates the latest attacks to which other similar schemes are subject. The efficiency of the proposed scheme is analyzed and shown to be superior to its counterparts. The paper also proposes a discrete logarithm based <it>distributed-key management infrastructure</it> (DKMI), which consists of a round optimal, publicly verifiable, distributed-key generation (DKG) protocol and a one round, publicly verifiable, distributed-key redistribution/updating (DKRU) protocol. The round optimal DKRU protocol solves a major problem with existing secret redistribution/updating schemes by giving group members a mechanism to identify malicious or faulty share holders in the first round, thus avoiding multiple protocol executions.</p>
Security and protection, distributed systems, group-oriented cryptography, threshold-multisignature, secret sharing, distributed-key management infrastructure, publicly verifiable distributed-key generation, publicly verifiable distributed-key update, publicly verifiable distributed-key redistribution.

J. van der Merwe, S. McDonald and D. S. Dawoud, "A Fully Distributed Proactively Secure Threshold-Multisignature Scheme," in IEEE Transactions on Parallel & Distributed Systems, vol. 18, no. , pp. 562-575, 2007.
87 ms
(Ver 3.3 (11022016))