Cart (Loading....) | Create Account
Close category search window

Provably Secure Group Key Management Approach Based upon Hyper-Sphere

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Tang, S. ; Shaohua Tang is with the School of Computer Science and Engineering, South China University of Technology, Guangzhou, China (e-mail: ; Xu, L. ; Liu, N. ; Huang, X.
more authors

This supplementary file consists of three sections. In Section I, a theorem is presented to prove that the number of points on a hyper-sphere over finite field GF(p) is at least pN1 for a given hyper-sphere determined by C = (c0; c1; : : : ; cN) 2 GF(p)N+1 and R 2 GF(p), where p is a prime. In Section II, a concrete algorithm to find a point on a hyper-sphere is constructed. In Section III, two lemmas and a theorem are proposed and proven, then the security of the proposed group key management scheme is proven formally.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:PP ,  Issue: 99 )

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.