An Optimized Secure Communication Using VLR-GS-BU on Wireless Network
Journal Title: Indian Journal of Computer Science and Engineering - Year 2012, Vol 3, Issue 3
Abstract
A novel protocol to achieve privacy-preserving universal authentication protocol for wireless communications called Priauth. to secure the communication as the data are sensitive or it requires the users to pay for it. In the algorithms for secure communication a key is shared by H with V and V with users. The key is used to encrypt data transmitted to the servers or users. In privacy based authentication protocols besides the user and its home server, no one including the foreign server can tell the identity of the user; and besides the user and its home server, no one including the foreign server is able to link any past or future protocol runs of the same user. An To revoke multiple users is to associate a key with every nonempty subset of users in the group. Thus, if one or more users are revoked, the VA uses the key associated with the subset of the remaining users to encrypt the new key and transmits the new group key to them. The advantage of this approach is that the communication overhead is only one message for revoking any number of users. However, the number of keys stored by the VA and the users is exponential in the size of the group. The goal of the enhancement is to evaluate trade-off between storage and revocation cost. Storage is computed in terms of keys that each user (respectively, VA) maintains. And revocation cost is computed in terms of the encryptions performed, and the number of messages transmitted, by the VA.
Authors and Affiliations
M. Saranya , P. Dhivya
Keywords
Related Articles
- EP ID EP103435
- DOI -
- Views 143
- Downloads 0
NETWORK NEUTRALITY SURVEY
Network Neutrality is one of the most acrimoniously debated topics in Academia and Industry. Extensive literature has been written on it on both sides of the subject. In this survey paper we summarize the related promine...
DETERMINING THE NUMBER OF CLUSTERS FOR A K-MEANS CLUSTERING ALGORTIHM
Clustering is a process used to divide data into a number of groups. All data points have some mathematical parameter according to which grouping can be done. For instance, if we have a number of points on a twodimension...
PRE-IDEALS AND NEW TOPOLOGIES USING FUZZY SETS
A fuzzy ideal on a set X is a non empty collection of subsets of X with heredity property which is also closed under arbitrary union and finite intersections. In this paper, we introduce a weak form of fuzzy ideals namel...
PRTVBase: A Predicted promoter data base of Retro transcribing virus
Database having the information of viral promoters is highly required for molecular basis of virology study. In this work the data base of the predicted promoters of the all retro transcribing genome available in the NCB...
PERFORMANCE EVALUATION OF CONTENT BASED IMAGE RETRIEVAL FOR MEDICAL IMAGES
Content-based image retrieval (CBIR) technology benefits not only large image collections management, but also helps clinical care, biomedical research, and education. Digital images are found in X-Rays, MRI, CT which ar...