Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs

Pratish Datta*, Tatsuaki Okamoto, Katsuyuki Takashima

*この研究の対応する著者

研究成果: Conference contribution

5 被引用数 (Scopus)

抄録

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 and refining 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.

本文言語English
ホスト出版物のタイトルPublic-Key Cryptography – PKC 2019 - 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings
編集者Kazue Sako, Dongdai Lin
出版社Springer Verlag
ページ127-158
ページ数32
ISBN(印刷版)9783030172527
DOI
出版ステータスPublished - 2019
外部発表はい
イベント22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2019 - Beijing, China
継続期間: 2019 4 142019 4 17

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
11442 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

Conference22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2019
国/地域China
CityBeijing
Period19/4/1419/4/17

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル