There are many applications of symmetric cryptography where the only realistic option is to predistribute key material in advance of deployment, rather than provide online key distribution. The problem of how most effectively to predistribute keys is inherently combinatorial. We revisit some early combinatorial key predistribution shemes and discuss their limitations. We then explain why this problem is back "in fashion" after a period of limited attention by the research community. We consider the appropriateness of combinatorial techniques for key distribution and identify potential areas of further research. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Martin, K. M. (2011). The rise and fall and rise of combinatorial key predistribution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6544 LNCS, pp. 92–98). https://doi.org/10.1007/978-3-642-19574-7_6
Mendeley helps you to discover research relevant for your work.