A General Model of Structured Multisignatures with Message Flexibility

Dan YAMAMOTO; Wakaha OGATA

doi:10.1093/ietfec/e90-a.1.83

A General Model of Structured Multisignatures with Message Flexibility

Dan YAMAMOTO, Wakaha OGATA

Full Text Views

0

Share
Cite this

Summary :

Multisignature schemes enable us to integrate multiple signatures into a single short signature. In 2001, Mitomi and Miyaji proposed a general model of multisignatures, in which signed messages are flexible and the signing order is verifiable and flexible. Several schemes that satisfy these properties have been proposed, but to the best of our knowledge, their verifiable orders are limited to only sequential structures unlike some order-verifiable (but not message-flexible) multisignatures. We define a signing structure as a labeled tree, which can represent any natural signing order including series-parallel graphs, and formalize a general model of multisignatures that makes good use of our structure. We present a security model for such signatures, give the construction based on the general aggregate signature developed by Boneh et al., and provide a security proof in the random oracle model.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E90-A No.1 pp.83-90

Publication Date: 2007/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e90-a.1.83

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

Category: Signatures

Cite this

Copy

Dan YAMAMOTO, Wakaha OGATA, "A General Model of Structured Multisignatures with Message Flexibility" in IEICE TRANSACTIONS on Fundamentals, vol. E90-A, no. 1, pp. 83-90, January 2007, doi: 10.1093/ietfec/e90-a.1.83.
Abstract: Multisignature schemes enable us to integrate multiple signatures into a single short signature. In 2001, Mitomi and Miyaji proposed a general model of multisignatures, in which signed messages are flexible and the signing order is verifiable and flexible. Several schemes that satisfy these properties have been proposed, but to the best of our knowledge, their verifiable orders are limited to only sequential structures unlike some order-verifiable (but not message-flexible) multisignatures. We define a signing structure as a labeled tree, which can represent any natural signing order including series-parallel graphs, and formalize a general model of multisignatures that makes good use of our structure. We present a security model for such signatures, give the construction based on the general aggregate signature developed by Boneh et al., and provide a security proof in the random oracle model.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.1.83/_p

Copy

@ARTICLE{e90-a_1_83,
author={Dan YAMAMOTO, Wakaha OGATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A General Model of Structured Multisignatures with Message Flexibility},
year={2007},
volume={E90-A},
number={1},
pages={83-90},
abstract={Multisignature schemes enable us to integrate multiple signatures into a single short signature. In 2001, Mitomi and Miyaji proposed a general model of multisignatures, in which signed messages are flexible and the signing order is verifiable and flexible. Several schemes that satisfy these properties have been proposed, but to the best of our knowledge, their verifiable orders are limited to only sequential structures unlike some order-verifiable (but not message-flexible) multisignatures. We define a signing structure as a labeled tree, which can represent any natural signing order including series-parallel graphs, and formalize a general model of multisignatures that makes good use of our structure. We present a security model for such signatures, give the construction based on the general aggregate signature developed by Boneh et al., and provide a security proof in the random oracle model.},
keywords={},
doi={10.1093/ietfec/e90-a.1.83},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - A General Model of Structured Multisignatures with Message Flexibility
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 83
EP - 90
AU - Dan YAMAMOTO
AU - Wakaha OGATA
PY - 2007
DO - 10.1093/ietfec/e90-a.1.83
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2007
AB - Multisignature schemes enable us to integrate multiple signatures into a single short signature. In 2001, Mitomi and Miyaji proposed a general model of multisignatures, in which signed messages are flexible and the signing order is verifiable and flexible. Several schemes that satisfy these properties have been proposed, but to the best of our knowledge, their verifiable orders are limited to only sequential structures unlike some order-verifiable (but not message-flexible) multisignatures. We define a signing structure as a labeled tree, which can represent any natural signing order including series-parallel graphs, and formalize a general model of multisignatures that makes good use of our structure. We present a security model for such signatures, give the construction based on the general aggregate signature developed by Boneh et al., and provide a security proof in the random oracle model.
ER -