TY - GEN
T1 - ABE with tag made easy
T2 - 23rd Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2017
AU - Chen, Jie
AU - Gong, Junqing
N1 - Publisher Copyright:
© International Association for Cryptologic Research 2017.
PY - 2017
Y1 - 2017
N2 - Among all existing identity-based encryption (IBE) schemes in the bilinear group, Wat - IBE proposed by Waters [CRYPTO, 2009] and JR - IBE proposed by Jutla and Roy [AsiaCrypt, 2013] are quite special. A secret key and/or ciphertext in these two schemes consist of several group elements and an integer which is usually called tag. A series of prior work was devoted to extending them towards more advanced attribute-based encryption (ABE) including inner-product encryption (IPE), hierarchical IBE (HIBE). Recently, Kim et al. [SCN, 2016] introduced the notion of tag-based encoding and presented a generic framework for extending Wat - IBE. We may call these ABE schemes ABE with tag or tag-based ABE. Typically, a tag-based ABE construction is more efficient than its counterpart without tag. However the research on tag-based ABE severely lags—We do not know how to extend JR - IBE in a systematic way and there is no tag-based ABE for boolean span program even with Kim et al.’s generic framework. In this work, we proposed a generic framework for tag-based ABE which is based on JR - IBE and compatible with Chen et al.’s (attribute-hiding) predicate encoding [EuroCrypt, 2015]. The adaptive security in the standard model relies on the k-linear assumption in the asymmetric prime-order bilinear group. This is the first framework showing how to extend JR - IBE systematically. In fact our framework and its simple extension are able to cover most concrete tag-based ABE constructions in previous literature. Furthermore, since Chen et al.’s predicate encoding supports a large number of predicates including boolean span program, we can now give the first (both key-policy and ciphertext-policy) tag-based ABE for boolean span program in the standard model. Technically our framework is based on a simplified version of JR - IBE. Both the description and its proof are quite similar to the prime-order IBE derived from Chen et al.’s framework. This not only allows us to work with Chen et al.’s predicate encoding but also provides us with a clear explanation of JR - IBE and its proof technique.
AB - Among all existing identity-based encryption (IBE) schemes in the bilinear group, Wat - IBE proposed by Waters [CRYPTO, 2009] and JR - IBE proposed by Jutla and Roy [AsiaCrypt, 2013] are quite special. A secret key and/or ciphertext in these two schemes consist of several group elements and an integer which is usually called tag. A series of prior work was devoted to extending them towards more advanced attribute-based encryption (ABE) including inner-product encryption (IPE), hierarchical IBE (HIBE). Recently, Kim et al. [SCN, 2016] introduced the notion of tag-based encoding and presented a generic framework for extending Wat - IBE. We may call these ABE schemes ABE with tag or tag-based ABE. Typically, a tag-based ABE construction is more efficient than its counterpart without tag. However the research on tag-based ABE severely lags—We do not know how to extend JR - IBE in a systematic way and there is no tag-based ABE for boolean span program even with Kim et al.’s generic framework. In this work, we proposed a generic framework for tag-based ABE which is based on JR - IBE and compatible with Chen et al.’s (attribute-hiding) predicate encoding [EuroCrypt, 2015]. The adaptive security in the standard model relies on the k-linear assumption in the asymmetric prime-order bilinear group. This is the first framework showing how to extend JR - IBE systematically. In fact our framework and its simple extension are able to cover most concrete tag-based ABE constructions in previous literature. Furthermore, since Chen et al.’s predicate encoding supports a large number of predicates including boolean span program, we can now give the first (both key-policy and ciphertext-policy) tag-based ABE for boolean span program in the standard model. Technically our framework is based on a simplified version of JR - IBE. Both the description and its proof are quite similar to the prime-order IBE derived from Chen et al.’s framework. This not only allows us to work with Chen et al.’s predicate encoding but also provides us with a clear explanation of JR - IBE and its proof technique.
KW - Attribute-based encryption
KW - Attribute-hiding
KW - Delegation
KW - Predicate encoding
KW - Prime-order bilinear group
UR - https://www.scopus.com/pages/publications/85037846814
U2 - 10.1007/978-3-319-70697-9_2
DO - 10.1007/978-3-319-70697-9_2
M3 - 会议稿件
AN - SCOPUS:85037846814
SN - 9783319706962
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 35
EP - 65
BT - Advances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings
A2 - Takagi, Tsuyoshi
A2 - Peyrin, Thomas
PB - Springer Verlag
Y2 - 3 December 2017 through 7 December 2017
ER -