Loading...
Please wait, while we are loading the content...
Similar Documents
Abstract Secret instantiation in ad-hoc networks * (2005)
| Content Provider | CiteSeerX |
|---|---|
| Author | Eep S. Kulkarni, A. Mohamed G. Gouda, B. Anish Arora, C. |
| Abstract | 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 pffiffi this motivation, we present a protocol that maintains Oð nÞ secrets per user where n is the number of users in the system. We show that our secret distribution protocol suffices for privacy and authentication as well as secure multihop communication between two users. Furthermore, we show that the number of secrets maintained in this protocol is within a constant factor of the optimal. For the case where user capability prevents them from maintaining the necessary secrets, we propose two probabilistic protocols that maintain O(log n) secrets and where the probability of security compromise between two users is inversely proportional to the number of secrets they maintain. Thus, our protocols provide a continuum where the level of privacy and authentication depends upon user requirements and capabilities. q 2005 Elsevier B.V. All rights reserved. |
| File Format | |
| Publisher Date | 2005-01-01 |
| Access Restriction | Open |
| Subject Keyword | Ad-hoc Network Abstract Secret Instantiation Secret Distribution Protocol Suffices Security Compromise Probabilistic Protocol Initial Secret Secure Multihop Communication Constant Factor Sensor Network User Requirement Necessary Secret User Capability |
| Content Type | Text |
