Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Efficient construction of infinite length hash chains with perfect forward secrecy using two independent hash functions

: Bittl, Sebastian

Fulltext urn:nbn:de:0011-n-3091900 (134 KByte PDF)
MD5 Fingerprint: 81b7faa59a6f0a6f3f80a9fc847f4243
Created on: 14.10.2014

Homepage (HTML; )

Obaidat, M.S. ; Institute for Systems and Technologies of Information, Control and Communication -INSTICC-, Setubal:
11th International Conference on Security and Cryptography, SECRYPT 2014. Proceedings : 28 - 30 August 2014, Vienna, Austria, part of the ICETE, the 11th International Joint Conference on e-Business and Telecommunications
SciTePress, 2014
ISBN: 978-989-758-045-1
International Conference on Security and Cryptography (SECRYPT) <11, 2014, Vienna>
International Joint Conference on e-Business and Telecommunications (ICETE) <11, 2014, Vienna>
Conference Paper, Electronic Publication
Fraunhofer ESK ()
hash chain; hash chain design; perfect forward secrecy; one-time password; security; privacy; cryptography; automotive connectivity

One-way hash chains have been used to secure many applications over the last three decades. To overcome the fixed length limitation of first generation designs, so-called infinite length hash chains have been introduced. Such designs typically employ methods of asynchronous cryptography or hash based message authentication codes. However, none of the proposed schemes offers perfect forward secrecy, keeping former outputs secret once the system got compromised. A novel algorithm for constructing infinite length hash chains with built in support for perfect forward secrecy is presented in this work. Thereby, the scheme differs significantly from existing proposals by using a combination of two different hash functions. It avoids the computational complexity of public-key algorithm s, utilises well studied standard hash functions and keeps the benefits of a hash chain without a length constraint.