Up to now, all the proposed schemes consider only threshold structures: the tolerated subsets of corrupted players as well as the subsets of players who can sign a message are defined according to their cardinality.
We propose a framework that is more general than the threshold one, considering a general access structure of players allowed to sign and a general family of dishonest players that the scheme can tolerate. If these general structures satisfy some combinatorial conditions, we can design a distributed and secure RSA signature scheme for this setting. Our construction is based on the threshold scheme of Shoup.
Category / Keywords: cryptographic protocols / Distributed digital signatures, RSA signatures, secret sharing schemes Date: received 22 Mar 2002, withdrawn 11 Apr 2002 Contact author: jherranz at mat upc es Available format(s): (-- withdrawn --) Version: 20020411:091112 (All versions of this report) Short URL: ia.cr/2002/038 Discussion forum: Show discussion | Start new discussion