The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Um esquema de assinatura agregada tolerante a falhas (FT-AS) é uma variante de um esquema de assinatura agregada com a funcionalidade adicional para rastrear signatários que criam assinaturas inválidas caso uma assinatura agregada seja inválida. Vários esquemas de FT-AS foram propostos até agora, e alguns deles rastreiam esses signatários desonestos em múltiplas rodadas, ou seja, no ambiente onde os signatários enviam repetidamente suas assinaturas individuais. No entanto, tem sido esquecido que existe um ataque potencial à eficiência do consumo de largura de banda em um esquema FT-AS multi-round. Como um dos méritos dos esquemas de assinatura agregada é a eficiência do consumo de largura de banda, tal ataque pode ser crítico para esquemas FT-AS multi-round. Neste artigo, propomos um novo esquema FT-AS multi-round que é tolerante a tal ataque. Implementamos nosso esquema e mostramos experimentalmente que ele é mais eficiente do que o esquema FT-AS multi-round existente se assinantes desonestos criarem aleatoriamente assinaturas inválidas com baixa probabilidade, o que, por exemplo, captura falhas espontâneas de dispositivos em sistemas IoT.
Kyosuke YAMASHITA
Osaka University,National Institute of Advanced Industrial Science and Technology (AIST)
Ryu ISHII
National Institute of Advanced Industrial Science and Technology (AIST),University of Tokyo
Yusuke SAKAI
National Institute of Advanced Industrial Science and Technology (AIST)
Tadanori TERUYA
National Institute of Advanced Industrial Science and Technology (AIST)
Takahiro MATSUDA
National Institute of Advanced Industrial Science and Technology (AIST)
Goichiro HANAOKA
National Institute of Advanced Industrial Science and Technology (AIST)
Kanta MATSUURA
University of Tokyo
Tsutomu MATSUMOTO
National Institute of Advanced Industrial Science and Technology (AIST),Yokohama National University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Kyosuke YAMASHITA, Ryu ISHII, Yusuke SAKAI, Tadanori TERUYA, Takahiro MATSUDA, Goichiro HANAOKA, Kanta MATSUURA, Tsutomu MATSUMOTO, "Fault-Tolerant Aggregate Signature Schemes against Bandwidth Consumption Attack" in IEICE TRANSACTIONS on Fundamentals,
vol. E106-A, no. 9, pp. 1177-1188, September 2023, doi: 10.1587/transfun.2022DMP0005.
Abstract: A fault-tolerant aggregate signature (FT-AS) scheme is a variant of an aggregate signature scheme with the additional functionality to trace signers that create invalid signatures in case an aggregate signature is invalid. Several FT-AS schemes have been proposed so far, and some of them trace such rogue signers in multi-rounds, i.e., the setting where the signers repeatedly send their individual signatures. However, it has been overlooked that there exists a potential attack on the efficiency of bandwidth consumption in a multi-round FT-AS scheme. Since one of the merits of aggregate signature schemes is the efficiency of bandwidth consumption, such an attack might be critical for multi-round FT-AS schemes. In this paper, we propose a new multi-round FT-AS scheme that is tolerant of such an attack. We implement our scheme and experimentally show that it is more efficient than the existing multi-round FT-AS scheme if rogue signers randomly create invalid signatures with low probability, which for example captures spontaneous failures of devices in IoT systems.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2022DMP0005/_p
Copiar
@ARTICLE{e106-a_9_1177,
author={Kyosuke YAMASHITA, Ryu ISHII, Yusuke SAKAI, Tadanori TERUYA, Takahiro MATSUDA, Goichiro HANAOKA, Kanta MATSUURA, Tsutomu MATSUMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Fault-Tolerant Aggregate Signature Schemes against Bandwidth Consumption Attack},
year={2023},
volume={E106-A},
number={9},
pages={1177-1188},
abstract={A fault-tolerant aggregate signature (FT-AS) scheme is a variant of an aggregate signature scheme with the additional functionality to trace signers that create invalid signatures in case an aggregate signature is invalid. Several FT-AS schemes have been proposed so far, and some of them trace such rogue signers in multi-rounds, i.e., the setting where the signers repeatedly send their individual signatures. However, it has been overlooked that there exists a potential attack on the efficiency of bandwidth consumption in a multi-round FT-AS scheme. Since one of the merits of aggregate signature schemes is the efficiency of bandwidth consumption, such an attack might be critical for multi-round FT-AS schemes. In this paper, we propose a new multi-round FT-AS scheme that is tolerant of such an attack. We implement our scheme and experimentally show that it is more efficient than the existing multi-round FT-AS scheme if rogue signers randomly create invalid signatures with low probability, which for example captures spontaneous failures of devices in IoT systems.},
keywords={},
doi={10.1587/transfun.2022DMP0005},
ISSN={1745-1337},
month={September},}
Copiar
TY - JOUR
TI - Fault-Tolerant Aggregate Signature Schemes against Bandwidth Consumption Attack
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1177
EP - 1188
AU - Kyosuke YAMASHITA
AU - Ryu ISHII
AU - Yusuke SAKAI
AU - Tadanori TERUYA
AU - Takahiro MATSUDA
AU - Goichiro HANAOKA
AU - Kanta MATSUURA
AU - Tsutomu MATSUMOTO
PY - 2023
DO - 10.1587/transfun.2022DMP0005
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E106-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2023
AB - A fault-tolerant aggregate signature (FT-AS) scheme is a variant of an aggregate signature scheme with the additional functionality to trace signers that create invalid signatures in case an aggregate signature is invalid. Several FT-AS schemes have been proposed so far, and some of them trace such rogue signers in multi-rounds, i.e., the setting where the signers repeatedly send their individual signatures. However, it has been overlooked that there exists a potential attack on the efficiency of bandwidth consumption in a multi-round FT-AS scheme. Since one of the merits of aggregate signature schemes is the efficiency of bandwidth consumption, such an attack might be critical for multi-round FT-AS schemes. In this paper, we propose a new multi-round FT-AS scheme that is tolerant of such an attack. We implement our scheme and experimentally show that it is more efficient than the existing multi-round FT-AS scheme if rogue signers randomly create invalid signatures with low probability, which for example captures spontaneous failures of devices in IoT systems.
ER -