Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Group key management method based on linear geometry

A group key and management method technology, applied in the field of group key management, can solve the problem of increasing the total cost of updating keys

Inactive Publication Date: 2010-06-23
SOUTH CHINA UNIV OF TECH
View PDF0 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

But if a large number of members join or leave the group, the total cost of rekeying will grow proportionally with the number of changing members

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
  • Group key management method based on linear geometry
  • Group key management method based on linear geometry
  • Group key management method based on linear geometry

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0171] A typical secure group communication system architecture is as follows: figure 1 As shown, the system includes a group controller (GroupControl, GC), and four group users U1, U2, U3 and U4. The Group Controller (GC) and individual users are connected via the Internet.

[0172] Such as figure 2 As shown, when the group is initialized, the group controller (GC) selects the finite field F and the mapping f used by the group, all operations in the group are established on the finite field F, and the mapping f is generated using pseudo-random numbers device.

[0173] Step 1, group members U1, U2, U3, and U4 want to join the group, and U1 selects three secret random numbers v in the finite field F 1，1 , v 1，2 , v 1，3 ∈F, forming a three-dimensional secret vector V 1 =(v 1，1 , v 1，2 , v 1，3 ), U2 also selects three secret random numbers v 2，1 , v 2，2 , v 2，3 ∈F, forming a three-dimensional secret vector V 2 =(v 2，1 , v 2，2 , v 2，3 ), U3 also selects three secr...

Embodiment 2

[0222] Assume that the secure group communication system includes a group controller (GC) and five group users U1, U2, U3, U4 and U5, and the group controller (GC) and each user are connected through the Internet. When the group is initialized, the group controller (GC) selects the finite field F and the mapping f used by the group. All operations in the group are established on the finite field F, and the mapping f uses a pseudo-random number generator.

[0223] Step 1, group member U4 applies to the group controller (GC) to leave the group;

[0224] The group controller (GC) deletes the secret vector V of the exiting group member 4 , and reassign the number u of the remaining group members according to the order of the subscripts of the current members i , where i=1, 2, 3, 4; the group controller (GC) broadcasts the numbers of all members to all members through the open channel, and the secret vector of group members saved by the group controller (GC) is V 1 , V 2 , V 3 ...

Embodiment 3

[0227] Assume that the secure group communication system includes a group controller (GC) and two group users U1 and U2, the group controller (GC) and each user are connected through the Internet. When the group is initialized, the group controller (GC) selects the finite field F and the mapping f used by the group. All operations in the group are established on the finite field F, and the mapping f uses a pseudo-random number generator.

[0228] Step 1, group members U3 and U4 want to join the group, new member U3 selects three secret random numbers v 3，1 , v 3，2 , v 3，3 ∈F, forming a three-dimensional secret vector V 3 =(v 3，1 , v 3，2 , v 3，3 ) and sent to the group controller (GC) through a secure channel; U4 also selects three secret random numbers v 4，1 , v 4，2 , v 4，3 ∈F, forming a three-dimensional secret vector V 4 =(v 4，1 , v 4，2 , v 4，3 ) and sent to the group controller (GC) through a secure channel.

[0229] The group controller (GC) assigns the number...

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 invention discloses a group key management method based on linear geometry, comprising the following steps: step 1, a group controller selects finite field F and mapping f used by group; a group member selects a secret vector on the finite field F, and transmits to the group controller by a secure channel; step 2, the group controller selects a mapping parameter and maps the secret vector of all group members into a group of new vectors using the mapping f; step 3, the group controller selects a random number k as a group key and constructs a linear equation set using the new vector group and group key; and the group controller solves the central vector and transmits the central vector and the mapping parameter to the group member; step 4, the group member maps the secret vector thereof to a new vector in a vector space according to the mapping parameter and then calculates the product of the new vector and the central vector to obtain the group key. The method has the advantages of few storage content, small calculated amount and high security, and can effectively avoid brute force attack.

Description

technical field [0001] The invention relates to the field of group key management in network security technology, in particular to a linear geometry-based group key management method. 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. How to protect the security of group communication has also become a important issues facing these applications. A secure group communication system must not only meet the requirements of data confidentiality, user authentication, and information integrity, but also have good scalability. For a secure group communication system, a secure, efficient, and robust group key management scheme is crucial. [0003] At present, there have been many schemes for key management of secure group communication, among which typical schemes are Grou...

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/08H04L12/18
Inventor 唐韶华丁津泰杨光栋梁郁君
Owner SOUTH CHINA UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com