TY - GEN
T1 - An Efficient and Anonymous Attribute-Based group setup scheme
AU - Li, Bing
AU - Wang, Zhijie
AU - Huang, Dijiang
N1 - Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.
PY - 2013
Y1 - 2013
N2 - In many secure application scenarios, establishing a temporary group without revealing group member information is difficult but desirable. Secure group communication can significantly reduce the computation and communication overhead. Traditional group key management schemes are based on a hierarchical tree. Any network entity who wants to set up a group needs to know the keys of the other group members, i.e., the group key establishment must be done before starting the group communication. As a result, the group needs the group formation beforehand. In this paper, we propose a secure grouping scheme providing anonymity for group members to outsiders. Our approach is based on Attribute Based Encryption (ABE) schemes. In our scheme, each network entity is assigned with a set of attributes. Each group is identified by a logical combination of attributes, i.e., the group access policies. The presented solution has an advantage that there is no need for any prior knowledge of other group members. Instead, the sender just needs to focus on the group access policies. Our scheme further preserves the group formation policies by using a gradual exposure method on attributes. Compared to existing hidden-policy schemes, our solution can greatly reduce the computation and communication overhead.
AB - In many secure application scenarios, establishing a temporary group without revealing group member information is difficult but desirable. Secure group communication can significantly reduce the computation and communication overhead. Traditional group key management schemes are based on a hierarchical tree. Any network entity who wants to set up a group needs to know the keys of the other group members, i.e., the group key establishment must be done before starting the group communication. As a result, the group needs the group formation beforehand. In this paper, we propose a secure grouping scheme providing anonymity for group members to outsiders. Our approach is based on Attribute Based Encryption (ABE) schemes. In our scheme, each network entity is assigned with a set of attributes. Each group is identified by a logical combination of attributes, i.e., the group access policies. The presented solution has an advantage that there is no need for any prior knowledge of other group members. Instead, the sender just needs to focus on the group access policies. Our scheme further preserves the group formation policies by using a gradual exposure method on attributes. Compared to existing hidden-policy schemes, our solution can greatly reduce the computation and communication overhead.
KW - anonymity
KW - attribute based encryption
KW - group communication
UR - http://www.scopus.com/inward/record.url?scp=84904111210&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84904111210&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2013.6831181
DO - 10.1109/GLOCOM.2013.6831181
M3 - Conference contribution
AN - SCOPUS:84904111210
SN - 9781479913534
SN - 9781479913534
T3 - Proceedings - IEEE Global Communications Conference, GLOBECOM
SP - 861
EP - 866
BT - 2013 IEEE Global Communications Conference, GLOBECOM 2013
T2 - 2013 IEEE Global Communications Conference, GLOBECOM 2013
Y2 - 9 December 2013 through 13 December 2013
ER -