Graded group key management method based on line geometry

A technology of group key and management method, applied in the field of group key management, can solve the problems of inability to know specific paths, insufficient scalability, inability to know subgroup ancestors and subgroups, etc.

Inactive Publication Date: 2010-09-29
SOUTH CHINA UNIV OF TECH
View PDF2 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The disadvantage is that subgroups need to record certain group information, at least all descendant subgroup information, and only apply the tree structure hierarchical model
[0009]A scheme based on the Chinese Remainder Theorem (CRT), which uses the CRT algorithm to hide the hierarchical structure in the constructed CRT variable, all ancestors of a subgroup The group can calculate the key of the subgroup according to the CRT variable, but the subgroup cannot know which subgroups are its ancestor subgroups
Its ancestor subgroup also cannot know the specific path to the subgroup, and can only calculate its key
This scheme provides good security, but its disadvantage is that the overhead of calculating CRT variables is huge, which increases proportionally with the number of groups, and the scalability is not enough

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Graded group key management method based on line geometry
  • Graded group key management method based on line geometry
  • Graded group key management method based on line geometry

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0194] Such as figure 1 As shown, a group communication system with hierarchical access control includes a central controller CC, a subgroup V i , subgroup controller SC i , CC and each SC i They are interconnected through the Internet, where i=1, 2, . . . , 7.

[0195] The group's hierarchical access structure is as follows figure 2 As shown, all high-level nodes can derive the keys of their direct or indirect descendant nodes, while low-level nodes cannot derive the keys of their ancestor nodes. Nodes without direct or indirect superior-subordinate relationship cannot derive each other's key. Sibling nodes also cannot export each other's keys.

[0196] Such as image 3 As shown, the system selects the finite field F, and all operations are based on the finite field F; at the same time, the pseudo-random number generator is selected as f(.,.); for the same initialization input (seed), the pseudo-random number generator Should have the same output sequence; initializat...

Embodiment 2

[0310] When the relationship between subgroups changes, such as Figure 5 Shown: V 6 to leave the group, and V 8 to be used as V 2 A new subgroup of is added.

[0311] Step 1, such as Figure 6 Shown, SC 6 Send a leave request to CC, and CC deletes V after receiving the request 6 The private vector Z of 6 ; CC randomly selects a private vector Z ∈ F N , sent to V through a secure channel 8 The subgroup controller of V 8 After the subgroup controller receives Z, it will be stored secretly;

[0312] CC reassigns the number of the current subgroup controller: SC 1 ~ SC 5 remain unchanged, the corresponding private vectors are Z 1 ~ Z 5 ; while SC 7 became SC 6 , the corresponding private vector becomes Z 6 ;V 8 The corresponding number is SC 7 , and the corresponding private vector is Z 7 . At this time, the private vector saved by CC is Z i (i=1, 2, ..., 7); at this time, the hierarchical relationship of the group is as follows Figure 7 shown;

[0313] Ot...

Embodiment 3

[0328] Such as Figure 8 As shown, a group communication system with hierarchical access control includes a central controller CC, a subgroup V i , subgroup controller SC i , the CC and each SC are interconnected through the Internet, where i=1, 2, . . . , 5.

[0329] The group's hierarchical access structure is as follows Figure 9 As shown, all high-level nodes can derive the keys of their direct or indirect descendant nodes, while low-level nodes cannot derive the keys of their ancestor nodes. Nodes without direct or indirect superior-subordinate relationship cannot derive each other's key. Sibling nodes also cannot export each other's keys.

[0330] Such as Figure 10 As shown, the system selects the finite field F, and all operations are based on the finite field F; at the same time, the pseudo-random number generator is selected as f(.,.), for the same initialization input (seed), the pseudo-random number generator Should have the same output sequence; initialize m...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The present invention discloses a graded group key management method based on line geometry, which comprises the following steps: step 1. a central controller selects a finite field F, a mapping F and a constant for the use of groups and a N-dimension private vector for each sub-group; step 2. the central controller selects a mapping parameter r and maps the private vectors into a group of new vectors in a vector space; step 3. the central controller selects a sub-group key for each sub-group, constructs n linear equations and solves the linear equations, wherein the solutions of the linear equations are public vectors and n groups of public vectors form a public matrix; and the central controller further sends the public matrix and the mapping parameter r to all sub-group controllers via a public channel broadcast or multicast; and step 4. the sub-group controllers calculate confidential vector thereof and carry out a linear conversion on the confidential vector and the public matrix to obtain a group of key vectors. The graded group key management method is simple and flexible and is capable of avoiding violent attacks.

Description

technical field [0001] The invention relates to a group key management method in network security, in particular to a group level key management method based on linear geometry and orthogonal vector theory. Background technique [0002] With the rapid development of Internet technology and the popularity of multicast technology, group-oriented applications, such as video conferencing, online games, video-on-demand, etc., begin to play an increasingly important role, and secure group communication has become an important research direction . Secure group communication with hierarchical access control means that a group is divided into a series of subgroups with different permissions, high-level subgroups can receive and decrypt the information of their descendant (direct or indirect) subgroups, and Not the other way around. For hierarchical access control based on cryptography, a high-level subgroup can directly or indirectly calculate / deduce the communication key of its de...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04L9/08H04L29/06
Inventor 唐韶华梁郁君丁津泰
Owner SOUTH CHINA UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products