The search functionality is under construction.

The search functionality is under construction.

Attribute-Based Encryption (ABE) is an advanced form of public-key encryption where access control mechanisms based on attributes and policies are possible. In conventional ABE, attributes are specified as *strings*. However, there are certain applications where it is useful to specify attributes as *numerical values* and consider a predicate that determines if a certain *numerical range* would include a certain value. Examples of these types of attributes include time, position coordinate, person's age, rank, identity, and so on. In this paper, we introduce ABE for boolean formulae over Range Membership (ABE-RM). We show generic methods to convert conventional ABE to ABE-RM. Our generic conversions are efficient as they introduce only logarithmic overheads (in key and ciphertext sizes), as opposed to trivial methods, which would pose linear overheads. By applying our conversion to previous ABE schemes, we obtain new efficient and expressive ABE-RM schemes. Previous works that considered ABE with range attributes are specific and can only deal with either a single relation of range membership (Paterson and Quaglia at SCN'10, and Kasamatsu et al. at SCN'12), or limited classes of policies, namely, only AND-gates of range attributes (Shi *et al.* at IEEE S&P'07, and some subsequent work). Our schemes are generic and can deal with expressive boolean formulae.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E101-A No.9 pp.1440-1455

- Publication Date
- 2018/09/01

- Publicized

- Online ISSN
- 1745-1337

- DOI
- 10.1587/transfun.E101.A.1440

- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)

- Category

Nuttapong ATTRAPADUNG

National Institute of Advanced Industrial Science and Technology (AIST)

Goichiro HANAOKA

National Institute of Advanced Industrial Science and Technology (AIST)

Kazuto OGAWA

Japan Broadcasting Corporation (NHK)

Go OHTAKE

Japan Broadcasting Corporation (NHK)

Hajime WATANABE

National Institute of Advanced Industrial Science and Technology (AIST)

Shota YAMADA

National Institute of Advanced Industrial Science and Technology (AIST)

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.

Copy

Nuttapong ATTRAPADUNG, Goichiro HANAOKA, Kazuto OGAWA, Go OHTAKE, Hajime WATANABE, Shota YAMADA, "Attribute-Based Encryption for Range Attributes" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 9, pp. 1440-1455, September 2018, doi: 10.1587/transfun.E101.A.1440.

Abstract: Attribute-Based Encryption (ABE) is an advanced form of public-key encryption where access control mechanisms based on attributes and policies are possible. In conventional ABE, attributes are specified as *strings*. However, there are certain applications where it is useful to specify attributes as *numerical values* and consider a predicate that determines if a certain *numerical range* would include a certain value. Examples of these types of attributes include time, position coordinate, person's age, rank, identity, and so on. In this paper, we introduce ABE for boolean formulae over Range Membership (ABE-RM). We show generic methods to convert conventional ABE to ABE-RM. Our generic conversions are efficient as they introduce only logarithmic overheads (in key and ciphertext sizes), as opposed to trivial methods, which would pose linear overheads. By applying our conversion to previous ABE schemes, we obtain new efficient and expressive ABE-RM schemes. Previous works that considered ABE with range attributes are specific and can only deal with either a single relation of range membership (Paterson and Quaglia at SCN'10, and Kasamatsu et al. at SCN'12), or limited classes of policies, namely, only AND-gates of range attributes (Shi *et al.* at IEEE S&P'07, and some subsequent work). Our schemes are generic and can deal with expressive boolean formulae.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.1440/_p

Copy

@ARTICLE{e101-a_9_1440,

author={Nuttapong ATTRAPADUNG, Goichiro HANAOKA, Kazuto OGAWA, Go OHTAKE, Hajime WATANABE, Shota YAMADA, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={Attribute-Based Encryption for Range Attributes},

year={2018},

volume={E101-A},

number={9},

pages={1440-1455},

abstract={Attribute-Based Encryption (ABE) is an advanced form of public-key encryption where access control mechanisms based on attributes and policies are possible. In conventional ABE, attributes are specified as *strings*. However, there are certain applications where it is useful to specify attributes as *numerical values* and consider a predicate that determines if a certain *numerical range* would include a certain value. Examples of these types of attributes include time, position coordinate, person's age, rank, identity, and so on. In this paper, we introduce ABE for boolean formulae over Range Membership (ABE-RM). We show generic methods to convert conventional ABE to ABE-RM. Our generic conversions are efficient as they introduce only logarithmic overheads (in key and ciphertext sizes), as opposed to trivial methods, which would pose linear overheads. By applying our conversion to previous ABE schemes, we obtain new efficient and expressive ABE-RM schemes. Previous works that considered ABE with range attributes are specific and can only deal with either a single relation of range membership (Paterson and Quaglia at SCN'10, and Kasamatsu et al. at SCN'12), or limited classes of policies, namely, only AND-gates of range attributes (Shi *et al.* at IEEE S&P'07, and some subsequent work). Our schemes are generic and can deal with expressive boolean formulae.},

keywords={},

doi={10.1587/transfun.E101.A.1440},

ISSN={1745-1337},

month={September},}

Copy

TY - JOUR

TI - Attribute-Based Encryption for Range Attributes

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 1440

EP - 1455

AU - Nuttapong ATTRAPADUNG

AU - Goichiro HANAOKA

AU - Kazuto OGAWA

AU - Go OHTAKE

AU - Hajime WATANABE

AU - Shota YAMADA

PY - 2018

DO - 10.1587/transfun.E101.A.1440

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E101-A

IS - 9

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - September 2018

AB - Attribute-Based Encryption (ABE) is an advanced form of public-key encryption where access control mechanisms based on attributes and policies are possible. In conventional ABE, attributes are specified as *strings*. However, there are certain applications where it is useful to specify attributes as *numerical values* and consider a predicate that determines if a certain *numerical range* would include a certain value. Examples of these types of attributes include time, position coordinate, person's age, rank, identity, and so on. In this paper, we introduce ABE for boolean formulae over Range Membership (ABE-RM). We show generic methods to convert conventional ABE to ABE-RM. Our generic conversions are efficient as they introduce only logarithmic overheads (in key and ciphertext sizes), as opposed to trivial methods, which would pose linear overheads. By applying our conversion to previous ABE schemes, we obtain new efficient and expressive ABE-RM schemes. Previous works that considered ABE with range attributes are specific and can only deal with either a single relation of range membership (Paterson and Quaglia at SCN'10, and Kasamatsu et al. at SCN'12), or limited classes of policies, namely, only AND-gates of range attributes (Shi *et al.* at IEEE S&P'07, and some subsequent work). Our schemes are generic and can deal with expressive boolean formulae.

ER -