Provided is a method for managing a hierarchical-group key based on linear geometry, which includes the following steps: step 1, a central controller selects a finite field F, a mapping f and a constant N which are used by a group, and selects an 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 set of new vectors in vector space; step 3, the central controller selects a sub-group key for each sub-group, constructs n linear equations sets, and then solves the linear equations sets to obtain results, ...
