29-01-2011, 12:12 PM
[attachment=8535]
Guide’s Name:Mr.S.Seeranjeevi
Members name,
Ajith Vishnu.P,
Amith Manikken,
Jubin Jose,
Maheshwaran.E
Abstract
Probabilistic key predistribution schemes (P-KPSs) which place modest demands on hardware are good candidates for securing interactions between resources limited computers.Collusion susceptible P-KPSs are trade-offs between security and complexity.
The contributions of this paper are three-fold:1
A novel P-KPS, the subset keys and identity tickets (SKIT)schema;2
A generic KPS model to facilitate comparison of various facets of the complexity of key predistributionsvhemas;and3
