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
Multiassinaturas são assinaturas digitais para um grupo que consiste em vários signatários, onde cada signatário assina documentos comuns por meio da interação com seus co-signatários e o tamanho dos dados das assinaturas resultantes para o grupo é independente do número de signatários. Neste trabalho, propomos um esquema multiassinatura, cuja segurança pode ser fortemente reduzida ao problema CDH em grupos bilineares, no modelo de segurança mais forte onde nada mais é necessário do que que cada signatário tenha uma chave pública, ou seja, o modelo de chave pública simples . Em termos gerais, nossa ideia principal para uma redução rigorosa é utilizar uma interação de três rodadas em uma construção de hash de domínio completo. Ou seja, presumimos que uma construção de hash de domínio completo com interação de três rodadas se tornará totalmente segura no problema do CDH. Além disso, mostramos que o esquema existente de Zhou et al. (ISC 2011) pode ser melhorado para uma construção com uma forte redução de segurança como uma aplicação do nosso quadro de provas.
Naoto YANAI
Osaka 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
Naoto YANAI, "Meeting Tight Security for Multisignatures in the Plain Public Key Model" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 9, pp. 1484-1493, September 2018, doi: 10.1587/transfun.E101.A.1484.
Abstract: Multisignatures are digital signatures for a group consisting of multiple signers where each signer signs common documents via interaction with its co-signers and the data size of the resultant signatures for the group is independent of the number of signers. In this work, we propose a multisignature scheme, whose security can be tightly reduced to the CDH problem in bilinear groups, in the strongest security model where nothing more is required than that each signer has a public key, i.e., the plain public key model. Loosely speaking, our main idea for a tight reduction is to utilize a three-round interaction in a full-domain hash construction. Namely, we surmise that a full-domain hash construction with three-round interaction will become tightly secure under the CDH problem. In addition, we show that the existing scheme by Zhou et al. (ISC 2011) can be improved to a construction with a tight security reduction as an application of our proof framework.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.1484/_p
Copiar
@ARTICLE{e101-a_9_1484,
author={Naoto YANAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Meeting Tight Security for Multisignatures in the Plain Public Key Model},
year={2018},
volume={E101-A},
number={9},
pages={1484-1493},
abstract={Multisignatures are digital signatures for a group consisting of multiple signers where each signer signs common documents via interaction with its co-signers and the data size of the resultant signatures for the group is independent of the number of signers. In this work, we propose a multisignature scheme, whose security can be tightly reduced to the CDH problem in bilinear groups, in the strongest security model where nothing more is required than that each signer has a public key, i.e., the plain public key model. Loosely speaking, our main idea for a tight reduction is to utilize a three-round interaction in a full-domain hash construction. Namely, we surmise that a full-domain hash construction with three-round interaction will become tightly secure under the CDH problem. In addition, we show that the existing scheme by Zhou et al. (ISC 2011) can be improved to a construction with a tight security reduction as an application of our proof framework.},
keywords={},
doi={10.1587/transfun.E101.A.1484},
ISSN={1745-1337},
month={September},}
Copiar
TY - JOUR
TI - Meeting Tight Security for Multisignatures in the Plain Public Key Model
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1484
EP - 1493
AU - Naoto YANAI
PY - 2018
DO - 10.1587/transfun.E101.A.1484
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2018
AB - Multisignatures are digital signatures for a group consisting of multiple signers where each signer signs common documents via interaction with its co-signers and the data size of the resultant signatures for the group is independent of the number of signers. In this work, we propose a multisignature scheme, whose security can be tightly reduced to the CDH problem in bilinear groups, in the strongest security model where nothing more is required than that each signer has a public key, i.e., the plain public key model. Loosely speaking, our main idea for a tight reduction is to utilize a three-round interaction in a full-domain hash construction. Namely, we surmise that a full-domain hash construction with three-round interaction will become tightly secure under the CDH problem. In addition, we show that the existing scheme by Zhou et al. (ISC 2011) can be improved to a construction with a tight security reduction as an application of our proof framework.
ER -