Abstract
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.
Cite
CITATION STYLE
Chou, J. S., Lin, C. H., & Lee, T. Y. (2004). A novel hierarchical key management scheme based on quadratic residues. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3358, 858–865. https://doi.org/10.1007/978-3-540-30566-8_99
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
