In 1997, Lin [1] proposed a dynamic key management scheme using user hierarchical structure. After that, Lee [2] brought to two comments on Lin's method. In 2002, Lin [3] proposed a more efficient hierarchical key management scheme based on Elliptic Curve. Lin's efficient scheme solves the weaknesses appearing in Lee's scheme in [1]. In this paper, we further use Quadratic Residues (Q.R.) theorem to reduce the computing complexity of Lin's method. ? Springer-Verlag Berlin Heidelberg 2004.
關聯:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3358 , pp. 858-865
