Article

Self-Updating hash chains and their implementations

Authors:

Haojun Zhang,

Yuefei ZhuAuthors Info & Claims

WISE'06: Proceedings of the 7th international conference on Web Information Systems

Pages 387 - 397

https://doi.org/10.1007/11912873_40

Published: 23 October 2006 Publication History

Publisher Site

Abstract

Hash Chains are widely used in various cryptography applications such as one-time passwords, server-supported signatures and micropayments etc. However, the finite length (‘limited-link') of hash chains limits their applications. Some methods of re-initializing hash chains or infinite hash chains introduced in literatures are inefficient and un-smooth. In this paper, a novel scheme (a new kind of hash chain) is proposed, which re-initializes or updates by itself, named Self-Updating Hash Chain – SUHC. Highlights of SUHC are self-updating, fine-authentication and proactive updating. The updating process of SUHC is smooth, secure and efficient and does not need additional protocols or an independent re-initialization process, and can be continued indefinitely to give rise to an infinite length hash chain. An improved Server-Supported Signature with SUHC is also presented to show the application of SUHC.

References

[1]

Lamport L.: Password Authentication with Insecure Communication. Communications of the ACM 24 (11), (1981) 770-772.

Digital Library

Google Scholar

[2]

Haller N., Metz C., Nesser P., Straw M.: A One-Time Password System. RFC 2289. (1998) Available from http://www.ietf.org

Digital Library

Google Scholar

[3]

Asokan N., Tsudik G., Waidners M.: Server-supported signatures. Journal of Computer Security. (1997)

Digital Library

Google Scholar

[4]

Micali S.: Efficient Certificate Revocation. Proceedings of RSA '97. U.S. Patent No. 5, 666, 416.

Google Scholar

[5]

Ramkumar M., Memon N.: An Efficient Key Pre-distribution Scheme for MANET Security. IEEE Journal on Selected Areas of Communication. (2005).

Digital Library

Google Scholar

[6]

Bicakci K., Baykal N.: Infinite Length Hash Chains and Their Applications. Proceedings of IEEE 11th International Workshops on Enabling Technologies (WETICE2002). (2002).

Digital Library

Google Scholar

[7]

Goyal V.: How To Re-initialize a Hash Chain. http://eprint.iacr.org/2004/097.pdf. (2004).

Google Scholar

[8]

Lamport L.: Constructing digital signatures from a one way function. Technical Report CSL-98. SRI International. (1979).

Google Scholar

[9]

Merkle R.C.: A certified digital signature. In: Brassard G. (ed): Proceedings of the CRYPTO 89. Lecture Notes in Computer Science, Vol. 435. Springer-Verlag, Berlin (1990) 218-238.

Digital Library

Google Scholar

[10]

National Institute of Standards and Technology (NIST). Announcing the Secure Hash Standard, FIPS 180-1, U.S. Department of Commerce. (1995).

Google Scholar

[11]

National Institute of Standards and Technology (NIST). Announcing the Secure Hash Standard, FIPS 180-2, U.S. Department of Commerce. (2002).

Google Scholar

[12]

Asokan N., Tsudik G., Waidners M.: Server-supported signatures. Journal of Computer Security. (1997).

Digital Library

Google Scholar

[13]

Ding X., Mazzocchi D., Tsudik G.: Experimenting with Server-Aided Signatures. Network and Distributed Systems Security Symposium (NDSS '02). (2002).

Google Scholar

[14]

Oded G.: Foundations of Cryptography: Basic Tools. Cambridge University Press. (2001) 64-74.

Google Scholar

Cited By

View all

Huang QHuang HWang WLi QWu Y(2020)An Authentication Scheme Based on Novel Construction of Hash Chains for Smart Mobile DevicesWireless Communications & Mobile Computing10.1155/2020/88886792020Online publication date: 18-Dec-2020
https://dl.acm.org/doi/10.1155/2020/8888679
Min WRuixiang CShunbin H(2016)A Secure Data Aggregation Approach in Hierarchical Wireless Sensor NetworksProceedings of the 10th International Conference on Ubiquitous Information Management and Communication10.1145/2857546.2857637(1-7)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.1145/2857546.2857637
Yang M(2010)Controlled delegation protocol in mobile RFID networksEURASIP Journal on Wireless Communications and Networking10.1155/2010/1701502010(1-13)Online publication date: 1-Apr-2010
https://dl.acm.org/doi/10.1155/2010/170150

Self-Updating hash chains and their implementations

Recommendations

Signature amortization using multiple connected chains
CMS'05: Proceedings of the 9th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security

Amortization schemes for authenticating streamed data have been introduced as a solution to reduce the high overhead that sign-each schemes suffer from. The hash chains structure of amortization schemes and the number of hash values appended to other ...
Infinite Length Hash Chains and Their Applications
WETICE '02: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises

Hash Chains are used extensively in various cryptography applications such as one-time passwords, server-supported signatures and micropayments. In this paper, we present a method, called Infinite Length Hash Chains to improve the flexibility of this ...
On fast verification of hash chains
CT-RSA'10: Proceedings of the 2010 international conference on Topics in Cryptology

A hash chain H for a hash function hash(·) is a sequence of hash values 〈x_n, x_n−1,..., x₀ 〉, where x₀ is a secret value, x_i is generated by x_i=hash(x_i−1) for 1≤i≤n, and x_n is a public value. Hash values of H are disclosed gradually from x_n−1 to x₀. The ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

WISE'06: Proceedings of the 7th international conference on Web Information Systems

October 2006

562 pages

ISBN:3540481052

Editors:
Karl Aberer
School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
,
Zhiyong Peng
State Key Lab of Software Engineering, Wuhan University, wuhan, China
,
Elke A. Rundensteiner
Department of Computer Science, Worcester Polytechnic Institute, Worcester, MA, China
,
Yanchun Zhang
Department of Computer Science, Victoria University, Worcester, MA, Australia
,
Xuhui Li
Department of Computer Science, Wuhan University, Worcester, MA, China

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 23 October 2006

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Huang QHuang HWang WLi QWu Y(2020)An Authentication Scheme Based on Novel Construction of Hash Chains for Smart Mobile DevicesWireless Communications & Mobile Computing10.1155/2020/88886792020Online publication date: 18-Dec-2020
https://dl.acm.org/doi/10.1155/2020/8888679
Min WRuixiang CShunbin H(2016)A Secure Data Aggregation Approach in Hierarchical Wireless Sensor NetworksProceedings of the 10th International Conference on Ubiquitous Information Management and Communication10.1145/2857546.2857637(1-7)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.1145/2857546.2857637
Yang M(2010)Controlled delegation protocol in mobile RFID networksEURASIP Journal on Wireless Communications and Networking10.1155/2010/1701502010(1-13)Online publication date: 1-Apr-2010
https://dl.acm.org/doi/10.1155/2010/170150

Abstract

References

Cited By

Recommendations

Signature amortization using multiple connected chains

Infinite Length Hash Chains and Their Applications

On fast verification of hash chains

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations