Abstract
We describe HIMMO, a new scheme for identity-based symmetric key generation. Like the scheme of Blundo et al, HIMMO employs symmetric polynomials, which lead to very efficient implementations, but it is much less vulnerable against collusion attacks. HIMMO employs mixing modular operations over different rings and hiding part of the result of polynomial evaluation by only considering its least significant bits. We discuss the collusion resistance properties of HIMMO based on lattice-based cryptanalysis and provide figures on speed and memory usage of an implementation for various system parameters. • C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. ”Perfectlysecure key distribution for dynamic conferences”. In E.F. Brickell, editor, CRYPTO ’92, volume 740 of Lecture Notes in Computer Science, pp. 471-486. Springer, 1992. • O. Garcia-Morchon, R. Rietman, L. Tolhuizen, D. Gomez Perez, J. Gutierrez, S. Merino del Pozo. ”An ultra-lightweight ID-based pairiwse key establishment scheme aiming at full collusion resistance”. IACR Cryptology ePrint Archive, Vol 2012, p.618, 2012.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
