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
pandangan teks lengkap
117
Kertas kerja ini membentangkan tandatangan berasaskan atribut pertama (ABS) skim di mana surat-menyurat antara penandatangan dan tandatangan ditangkap dalam aritmetik model pengiraan. Secara khusus, kami mereka bentuk a sepenuhnya selamat, iaitu, secara adaptif tidak boleh dipalsukan dan sempurna penandatangan-swasta ABS skim untuk menandatangani dasar yang boleh direalisasikan oleh program percabangan aritmetik (ABP), kawasan mana cukup ekspresif model pengiraan aritmetik. Pada nota yang lebih positif, skim yang dicadangkan itu tiada terikat pada saiz and panjang input dasar penandatanganan yang disokong ABP's, dan pada masa yang sama, menyokong penggunaan atribut input untuk an sewenang-wenangnya bilangan kali dalam polisi menandatangani ABP, iaitu, yang dipanggil pelbagai guna tanpa had daripada sifat-sifat. Saiz parameter awam kami ialah berterusan berkenaan dengan saiz vektor atribut tandatangan dan dasar tandatangan yang tersedia dalam sistem. Pembinaan dibina dalam kumpulan dwilinear (tak simetri) tertib utama, dan kebolehtempaannya diperoleh dalam model standard di bawah (versi asimetri) linear keputusan yang dikaji dengan baik (DLIN) andaian ditambah dengan kewujudan piawai fungsi cincang tahan perlanggaran. Disebabkan oleh penggunaan model aritmetik berbanding dengan model boolean, our ABS skim bukan sahaja cemerlang dengan ketara atas pembinaan terkini yang sedia ada dari segi kecekapan konkrit, tetapi juga mencapai kebolehgunaan yang dipertingkatkan dalam pelbagai senario praktikal. Sumbangan teknikal utama kami ialah (a) memperluaskan teknik Okamoto dan Takashima [PKC 2011, PKC 2013], yang pada asalnya dibangunkan dalam konteks program rentang boolean, kepada tetapan aritmetik; dan (b) menginovasi idea baharu untuk membenarkan penggunaan pelbagai sifat yang tidak terhad di dalamnya ABP's, yang sendiri adalah saiz yang tidak terhad dan panjang input.
Pratish DATTA
the NTT Research, Inc.
Tatsuaki OKAMOTO
the NTT Research, Inc.
Katsuyuki TAKASHIMA
the Mitsubishi Electric Corporation
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.
Salinan
Pratish DATTA, Tatsuaki OKAMOTO, Katsuyuki TAKASHIMA, "Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs" in IEICE TRANSACTIONS on Fundamentals,
vol. E104-A, no. 1, pp. 25-57, January 2021, doi: 10.1587/transfun.2020CIP0003.
Abstract: This paper presents the first attribute-based signature (ABS) scheme in which the correspondence between signers and signatures is captured in an arithmetic model of computation. Specifically, we design a fully secure, i.e., adaptively unforgeable and perfectly signer-private ABS scheme for signing policies realizable by arithmetic branching programs (ABP), which are a quite expressive model of arithmetic computations. On a more positive note, the proposed scheme places no bound on the size and input length of the supported signing policy ABP's, and at the same time, supports the use of an input attribute for an arbitrary number of times inside a signing policy ABP, i.e., the so called unbounded multi-use of attributes. The size of our public parameters is constant with respect to the sizes of the signing attribute vectors and signing policies available in the system. The construction is built in (asymmetric) bilinear groups of prime order, and its unforgeability is derived in the standard model under (asymmetric version of) the well-studied decisional linear (DLIN) assumption coupled with the existence of standard collision resistant hash functions. Due to the use of the arithmetic model as opposed to the boolean one, our ABS scheme not only excels significantly over the existing state-of-the-art constructions in terms of concrete efficiency, but also achieves improved applicability in various practical scenarios. Our principal technical contributions are (a) extending the techniques of Okamoto and Takashima [PKC 2011, PKC 2013], which were originally developed in the context of boolean span programs, to the arithmetic setting; and (b) innovating new ideas to allow unbounded multi-use of attributes inside ABP's, which themselves are of unbounded size and input length.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020CIP0003/_p
Salinan
@ARTICLE{e104-a_1_25,
author={Pratish DATTA, Tatsuaki OKAMOTO, Katsuyuki TAKASHIMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs},
year={2021},
volume={E104-A},
number={1},
pages={25-57},
abstract={This paper presents the first attribute-based signature (ABS) scheme in which the correspondence between signers and signatures is captured in an arithmetic model of computation. Specifically, we design a fully secure, i.e., adaptively unforgeable and perfectly signer-private ABS scheme for signing policies realizable by arithmetic branching programs (ABP), which are a quite expressive model of arithmetic computations. On a more positive note, the proposed scheme places no bound on the size and input length of the supported signing policy ABP's, and at the same time, supports the use of an input attribute for an arbitrary number of times inside a signing policy ABP, i.e., the so called unbounded multi-use of attributes. The size of our public parameters is constant with respect to the sizes of the signing attribute vectors and signing policies available in the system. The construction is built in (asymmetric) bilinear groups of prime order, and its unforgeability is derived in the standard model under (asymmetric version of) the well-studied decisional linear (DLIN) assumption coupled with the existence of standard collision resistant hash functions. Due to the use of the arithmetic model as opposed to the boolean one, our ABS scheme not only excels significantly over the existing state-of-the-art constructions in terms of concrete efficiency, but also achieves improved applicability in various practical scenarios. Our principal technical contributions are (a) extending the techniques of Okamoto and Takashima [PKC 2011, PKC 2013], which were originally developed in the context of boolean span programs, to the arithmetic setting; and (b) innovating new ideas to allow unbounded multi-use of attributes inside ABP's, which themselves are of unbounded size and input length.},
keywords={},
doi={10.1587/transfun.2020CIP0003},
ISSN={1745-1337},
month={January},}
Salinan
TY - JOUR
TI - Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 25
EP - 57
AU - Pratish DATTA
AU - Tatsuaki OKAMOTO
AU - Katsuyuki TAKASHIMA
PY - 2021
DO - 10.1587/transfun.2020CIP0003
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E104-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2021
AB - This paper presents the first attribute-based signature (ABS) scheme in which the correspondence between signers and signatures is captured in an arithmetic model of computation. Specifically, we design a fully secure, i.e., adaptively unforgeable and perfectly signer-private ABS scheme for signing policies realizable by arithmetic branching programs (ABP), which are a quite expressive model of arithmetic computations. On a more positive note, the proposed scheme places no bound on the size and input length of the supported signing policy ABP's, and at the same time, supports the use of an input attribute for an arbitrary number of times inside a signing policy ABP, i.e., the so called unbounded multi-use of attributes. The size of our public parameters is constant with respect to the sizes of the signing attribute vectors and signing policies available in the system. The construction is built in (asymmetric) bilinear groups of prime order, and its unforgeability is derived in the standard model under (asymmetric version of) the well-studied decisional linear (DLIN) assumption coupled with the existence of standard collision resistant hash functions. Due to the use of the arithmetic model as opposed to the boolean one, our ABS scheme not only excels significantly over the existing state-of-the-art constructions in terms of concrete efficiency, but also achieves improved applicability in various practical scenarios. Our principal technical contributions are (a) extending the techniques of Okamoto and Takashima [PKC 2011, PKC 2013], which were originally developed in the context of boolean span programs, to the arithmetic setting; and (b) innovating new ideas to allow unbounded multi-use of attributes inside ABP's, which themselves are of unbounded size and input length.
ER -