Back to Search
Start Over
From key predistribution to key redistribution
- Source :
- Theoretical Computer Science. 453:75-87
- Publication Year :
- 2012
- Publisher :
- Elsevier BV, 2012.
-
Abstract
- One of crucial disadvantages of key predistribution schemes for ad hoc networks is that if devices A and B use a shared key K to determine their session keys, then any adversarial device that holds K can impersonate A against B (or vice versa). Also, the adversary holding such a device can eavesdrop on communication between A and B for the lifetime of the system. We develop a dynamic scheme where the devices are preloaded with permanent keys according to a predistribution scheme, but these keys are not used directly for setting up session keys. For this purpose devices use a pool of temporal keys, which periodically are selected at random by a system provider. The temporal keys are broadcast by the system provider in an encrypted form (e.g. using the GSM network or local broadcasting services). For the transmission, the temporal keys are encrypted with permanent keys, each temporal key occurring m times encrypted with m different permanent keys. (Parameter m is a small constant.) Encrypting the same temporal key with different permanent keys has the effect that with a high probability two devices share many more temporal keys than the permanent keys from the main pool of keys. Also, the shared temporal keys come not only from ciphertexts encrypted with shared permanent keys but predominantly from ciphertexts encrypted with the permanent keys that are not shared by the devices. After each re-distribution different pairs of permanent keys provide such shared temporal keys. This feature is the key property of our design. It makes it possible not only to protect communication against an adversary that has collected a large fraction of keys from the main pool of keys, but also enables using key predistribution for authentication in the presence of such an adversary. Finally, we present a scheme for renewing the permanent keys in a way that an adversary loses the knowledge of permanent keys except for the keys that it learns via the legitimate devices that he holds. The scheme is based on projective plane techniques.
- Subjects :
- Projective plane
General Computer Science
Attack detection
Dynamic key management
Key predistribution
Symmetric cryptography
02 engineering and technology
Related-key attack
Computer security
computer.software_genre
Theoretical Computer Science
Combinatorial class
0202 electrical engineering, electronic engineering, information engineering
Key derivation function
Key clustering
Key management
Mathematics
Generating function
Key generation
Authentication
business.industry
Key space
Eavesdropping
Wireless ad hoc network
020206 networking & telecommunications
Impersonation
Symmetric-key algorithm
Weak key
020201 artificial intelligence & image processing
business
computer
Computer Science(all)
Subjects
Details
- ISSN :
- 03043975
- Volume :
- 453
- Database :
- OpenAIRE
- Journal :
- Theoretical Computer Science
- Accession number :
- edsair.doi.dedup.....bea8e281575f2b461d706f1f776965ef
- Full Text :
- https://doi.org/10.1016/j.tcs.2012.06.001