Abstract
While schemes like MLS and IT may be sufficient for most practical networks, the need for storage proportional to the current network size can cramp their utility in some application scenarios. In several emerging application scenarios, billions, or possibly even trillions of resource limited devices may be deployed, where any device may be required to compute a pairwise secret with any other device. Thus, key distribution schemes with no limitation on scalability are called for.
Scalable key distribution schemes can be broadly classified into certificate-based and identity-based schemes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The attacker can obviously determine all shared secrets that each of the n compromised nodes can legitimately compute.
- 2.
More generally, for any N the \((n+1) \times N\) matrix \(\bf{G} = [\bf{g}_0 \, \bf{g}_1 \, \cdots \bf{g}_N]\) is referred to as the maximum distance separation (MDS) generator matrix.
- 3.
The hash chain KPS by itself is inefficient as it requires more that \(k = \mathbb{O}(n^2)\) keys to be assigned to each node. We shall not discuss this KPS further.
- 4.
For each of the \(k^2/P\) shared secrets one node has to perform \(L/3\) hashes on an average to arrive at a key with the same hash depth as the other node.
- 5.
\(\log_2 n\) multiplications for computing \({\alpha}^B\) and n − 1 multiplications for computing \({\alpha}^{iB}, 2 \le i \le n\) values.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Ramkumar, M. (2014). Scalable Key Distribution Schemes. In: Symmetric Cryptographic Protocols. Springer, Cham. https://doi.org/10.1007/978-3-319-07584-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-07584-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07583-9
Online ISBN: 978-3-319-07584-6
eBook Packages: EngineeringEngineering (R0)