Abstract. This paper addresses how to use public-keys of several different signature schemes to generate 1-out-of-n signatures. Previously known constructions are for either RSA-keys only or DL-type keys only. We present a widely applicable method to construct a 1-out-of-n signature scheme that allows mixture use of different flavors of keys at the same time. The resulting scheme is more efficient than previous schemes even if it is used only with a single type of keys. With all DL-type keys, it yields shorter signatures than the ones of the previously known scheme based on the witness indistinguishable proofs by Cramer, et. al. With all RSA-type keys, it reduces both computational and storage costs compared to that of the Ring signatures by Rivest, et. al.
Abe et al. REF use disjunctive proofs to demonstrate possession of one out of N secret keys to construct ring signatures.
1-out-of-n signatures from a variety of keys
In Advances in Cryptology - ASIACRYPT 2002, LNCS
Computer Science Mathematics