loading
Papers Papers/2020

Research.Publish.Connect.

Paper

Paper Unlock

Author: Sebastian Bittl

Affiliation: Fraunhofer ESK, Germany

Keyword(s): Hash Chain Design, Perfect Forward Secrecy, One-time Password, Security, Privacy.

Related Ontology Subjects/Areas/Topics: Access Control ; Applied Cryptography ; Cryptographic Techniques and Key Management ; Data Engineering ; Databases and Data Security ; Identification, Authentication and Non-Repudiation ; Information and Systems Security ; Internet Technology ; Privacy Enhancing Technologies ; Security Protocols ; Web Information Systems and Technologies

Abstract: 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 algorithms, utilises well studied standard hash functions and keeps the benefits of a hash chain without a length constraint.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.208.186.139

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Bittl, S. (2014). Efficient Construction of Infinite Length Hash Chains with Perfect Forward Secrecy Using Two Independent Hash Functions. In Proceedings of the 11th International Conference on Security and Cryptography - SECRYPT, (ICETE 2014) ISBN 978-989-758-045-1; ISSN 2184-2825, pages 213-220. DOI: 10.5220/0005020502130220

@conference{secrypt14,
author={Sebastian Bittl.},
title={Efficient Construction of Infinite Length Hash Chains with Perfect Forward Secrecy Using Two Independent Hash Functions},
booktitle={Proceedings of the 11th International Conference on Security and Cryptography - SECRYPT, (ICETE 2014)},
year={2014},
pages={213-220},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005020502130220},
isbn={978-989-758-045-1},
issn={2184-2825},
}

TY - CONF

JO - Proceedings of the 11th International Conference on Security and Cryptography - SECRYPT, (ICETE 2014)
TI - Efficient Construction of Infinite Length Hash Chains with Perfect Forward Secrecy Using Two Independent Hash Functions
SN - 978-989-758-045-1
IS - 2184-2825
AU - Bittl, S.
PY - 2014
SP - 213
EP - 220
DO - 10.5220/0005020502130220