Efficient targeted key subset retrieval in fractal hash sequences

Authors:
Kelsey Cairns;Thoshitha Gamage;Carl Hauser
Affiliations:
Washington State University, Pullman, WA, USA;Washington State University, Pullman, WA, USA;Washington State University, Pullman, WA, USA
Venue:
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Year:
2013

Citing 11
Cited 0

Password authentication with insecure communication

Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
The BiBa one-time signature and broadcast authentication protocol

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying

ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Forward-Secure Signatures with Optimal Signing and Verifying

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity

CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Almost optimal hash sequence traversal

FC'02 Proceedings of the 6th international conference on Financial cryptography
Evaluating Multicast Message Authentication Protocols for Use in Wide Area Power Grid Data Delivery Services

HICSS '12 Proceedings of the 2012 45th Hawaii International Conference on System Sciences
Efficient constructions for one-way hash chains

ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
A taxonomy of multicast data origin authentication: Issues and solutions

IEEE Communications Surveys & Tutorials
New directions in cryptography

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new hash chain traversal strategy which improves performance of hash chain based one-time authentication schemes. This work is motivated by the need for efficient message authentication in low-latency multicast systems. Proposed solutions such as TV-OTS rely on hash chain generated values for keys, achieving reliable security by using only a small subset of generated values from each chain. However, protocols using hash chains are limited by the rate at which a hash chain traversal is able to supply keys. The new algorithm uses the same structure as Fractal Hash Traversal, but eliminates redundant operations incurred when used with applications such as TV-OTS. Performance is measured in terms of savings and is proportional to the chain-distance between consecutively retrieved values. For a distance of delta, we achieve Theta(delta_2(delta)) savings, which is shown analytically and supported by empirical tests.