Towards full collusion resistant ID-based establishment of pairwise keys
Octavio Nieto-Taladriz García, Ludo Tolhuizen, Domingo Gómez‐Pérez, J Guterriez · Data Archiving and Networked Services (DANS) · 2012
Usually a communication link is secured by means of a symmetric-keyalgorithm. For that, a method is required to securely establish a symmetric-key for that algorithm.This old problem is still relevant and of paramount importance both in existing computernetworks and newlarge-scale ubiquitous systems comprising resource-constrained devices. Identity-based pairwise key agreement allows for the generationof a common key betweentwo parties given secret keying material owned by the first party and the identity of thesecond one. However, existing methods are prone to collusion attacks. In this paper we discuss a new class of key establishment scheme aiming at full collusionresistant identity-based symmetric-key agreement and propose a specific scheme, the HIMMO lgorithm, relying on two design concepts: Hiding Information and Mixing Modular Operations. Collusion attacks on schemes from literature cannot readily be applied to HIMMO. Also, thesimple logic of the HIMMO algorithm allows for very efficient implementations in terms of both speed and memory. Finally, being an identity-based symmetric-key establishment scheme, HIMMO allows for efficient real-world key-exchange protocols.