Addressing the shortcomings of one-way chains

Roberto Di Pietro, Luigi V. Mancini, Antonio Durante, Vishwas Patil

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Scopus citations

Abstract

One-way hash chains have been the preferred choice, over the symmetric and asymmetric key cryptography, in security setups where efficiency mattered; despite the ephemeral confidentiality and authentication they assure. Known constructions of one-way chains (for example, SHA-1 based), only ensure the forward secrecy and have limitations over their length i.e., a priori, knowledge of chain's length is necessary before constructing it. In this paper, we will see how our approach, based on chameleon functions, leads to the generation of practically unbounded one-way chains with constant storage and computational requirements. We provide the construction and advantages of our proposal with the help of a secure group communication setup. We also provide the implementation details of our construction and argue its suitability for security setups, where one cannot a priori determine the longevity of the setup. Copyright 2006 ACM.
Original languageEnglish (US)
Title of host publicationProceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06
Pages289-296
Number of pages8
DOIs
StatePublished - Dec 1 2006
Externally publishedYes

Fingerprint

Dive into the research topics of 'Addressing the shortcomings of one-way chains'. Together they form a unique fingerprint.

Cite this