Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

COMCOM
2006

favoriteEmaildiscussreport

70views more COMCOM 2006»

Secret instantiation in ad-hoc networks

13 years 4 months ago

Secret instantiation in ad-hoc networks

Download www.cs.utexas.edu

In this paper, we focus our attention on the problem of assigning initial secrets to users in ad-hoc network (respectively, sensors in a sensor network) so that they can use those secrets to ensure authentication and privacy during their communication. The goal of this assignment is to ensure that any two users can communicate securely with each other even though each user maintains only a small number of secrets. With this motivation, we present a protocol that maintains O

Sandeep S. Kulkarni, Mohamed G. Gouda, Anish Arora

Real-time Traffic

COMCOM 2006 | Initial Secrets | Sensor | User |

claim paper

Related Content

» On a Construction of Short Digests for Authenticating Ad Hoc Networks

» Threshold Secret Sharing Authentication Scheme in Noisy Mobile Ad Hoc Networks

» An Efficient ClusterBased Proactive Secret Share Update Scheme for Mobile Ad Hoc Networks

» Highly reliable trust establishment scheme in ad hoc networks

» A Secure Routing Protocol in Proactive Security Approach for Mobile AdHoc Networks

» Public Key Cryptography Sans Certificates in Ad Hoc Networks

» On the Insecurity of Proactive RSA in the URSA Mobile Ad Hoc Network Access Control Protoc...

» Strategies Averting Sybiltype Attacks Based on the Blomscheme in Ad Hoc Sensor Networks

» Authenticating ad hoc networks by comparison of short digests

» Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COMCOM
Authors	Sandeep S. Kulkarni, Mohamed G. Gouda, Anish Arora

Comments (0)