Short paper: Practically unbounded one-way chains for authentication with backward secrecy

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

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

3 Scopus citations


One-way hash chains have been the preferred choice (over symmetric and asymmetric key cryptography) in security setups where efficiency mattered; despite the ephemeral confidentiality and authentication they assure. They only support forward secrecy and have limitations over the chain size (bounded). In this paper, we show how the use of chameleon functions leads to the generation of practically unbounded one-way chains with constant memory storage requirement, providing forward, and backward secrecy as well. Such a cryptographic tool appears to be a great enabler for a variety of applications that could not be efficiently realized earlier. From our experiments we observed that this new kind of one-way chain formation adds a slight computational burden, which is justifiable by the unique advantages provided under our construction. The basic unit of our construction, chameleon function, can be elegantly used to design trees or even simpler star-like constructs. © 2005 IEEE.
Original languageEnglish (US)
Title of host publicationProceedings - First International Conference on Security and Privacy for Emerging Areas in Communications Networks, SecureComm 2005
Number of pages3
StatePublished - Dec 1 2005
Externally publishedYes


Dive into the research topics of 'Short paper: Practically unbounded one-way chains for authentication with backward secrecy'. Together they form a unique fingerprint.

Cite this