1-out-of-<I>n</I> Signatures from a Variety of Keys

Masayuki ABE; Miyako OHKUBO; Koutarou SUZUKI

1-out-of-n Signatures from a Variety of Keys

Masayuki ABE, Miyako OHKUBO, Koutarou SUZUKI

Full Text Views

0

Cite this

Summary :

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-type 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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.1 pp.131-140

Publication Date: 2004/01/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category: Asymmetric Cipher

Cite this

Copy

Masayuki ABE, Miyako OHKUBO, Koutarou SUZUKI, "1-out-of-n Signatures from a Variety of Keys" in IEICE TRANSACTIONS on Fundamentals, vol. E87-A, no. 1, pp. 131-140, January 2004, doi: .
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-type 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_1_131/_p

Copy

@ARTICLE{e87-a_1_131,
author={Masayuki ABE, Miyako OHKUBO, Koutarou SUZUKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={1-out-of-n Signatures from a Variety of Keys},
year={2004},
volume={E87-A},
number={1},
pages={131-140},
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-type 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.},
keywords={},
doi={},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - 1-out-of-n Signatures from a Variety of Keys
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 131
EP - 140
AU - Masayuki ABE
AU - Miyako OHKUBO
AU - Koutarou SUZUKI
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2004
AB - 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-type 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.
ER -