4.7 Article

A hierarchical group key agreement protocol using orientable attributes for cloud computing

Journal

INFORMATION SCIENCES
Volume 480, Issue -, Pages 55-69

Publisher

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2018.12.023

Keywords

Asymmetric group key agreement; Attribute-based sharing permissions; Permission level; Information exchange

Funding

  1. National Natural Science Foundation of China [U1636213, U1636219, 61772477, 61502435, 61572445, 61501405, 61501406]
  2. GS1 National Key R and D Program of China [2016YFB0801303, 2016QY01W0105]
  3. Natural Science Foundation of Henan Province [162300410322]
  4. Scientific and Technological Project of Henan Province [14A520034]
  5. Science and Technology Innovation Talent Project of Henan Province [2018JR0018]

Ask authors/readers for more resources

Group key agreement is one of the key technologies for ensuring information exchange security among group members. Due to different sensitivities of the information, group members may only want to exchange certain secret information under certain circumstances, and also due to different access permissions of member, certain information exchange may aim at different access authorities. Aiming at these requirements, a hierarchical group key agreement protocol using orientable attribute (HGKA-OA) is proposed in this paper. In this protocol, different secret information is shared among a set of members who have different authority levels. Assuming different permission levels correspond to different attributes or their combinations of the terminal, when one people has some secret information he can exchange information with some people who have the appropriate level of security permissions, rather than all the members in the group. The proposed scheme eliminates a majority of the computation task of terminals by moving identity authentication computation to the registration. In addition, the group key factors are also calculated before the group key agreement, which eliminates most of computation overhead due to group key agreement. This protocol is proven secure under the Decisional Bilinear Diffie-Hellman (DBDH) problem assumption and performance analysis shows that the proposed scheme is more efficient than existing works. (C) 2018 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available