Hash chains with diminishing ranges for sensors
by Phillip G. Bradford, Olga V. Gavrylyako
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 4, No. 1/2, 2006

Abstract: Sensors and other constrained devices periodically transmit small information packets motivating the study of hash chains with small domains and ranges. Hash chain based protocols use deferred disclosure and it is often assumed their hash functions are one-way, thus essentially unbreakable. However, if a deterministic hash function's domain and range are both very small, then the hash function can't be one-way. This paper proposes a solution to this challenge – general hash chains. General hash chains have the following properties: repeated hash elements don't indicate cycles; subsequent hash elements don't have exponentially diminishing ranges.

Online publication date: Sun, 09-Jul-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com