A Digital Signature Based on a Conventional Encryption Function
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
On the security of wireless network access with enhancements
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
SeRLoc: secure range-independent localization for wireless sensor networks
Proceedings of the 3rd ACM workshop on Wireless security
Securing quality-of-service route discovery in on-demand routing for ad hoc networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
A key-chain-based keying scheme for many-to-many secure group communication
ACM Transactions on Information and System Security (TISSEC)
The General Pay-Word: A Micro-payment Scheme Based on n-dimension One-way Hash Chain
Designs, Codes and Cryptography
SeRLoc: Robust localization for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Defending against path-based DoS attacks in wireless sensor networks
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
Node Cooperation in Hybrid Ad Hoc Networks
IEEE Transactions on Mobile Computing
Ariadne: a secure on-demand routing protocol for ad hoc networks
Wireless Networks
LEAP+: Efficient security mechanisms for large-scale distributed sensor networks
ACM Transactions on Sensor Networks (TOSN)
Optimal trade-off for Merkle tree traversal
Theoretical Computer Science
A k-anonymous communication protocol for overlay networks
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Efficient pebbling for list traversal synopses with application to program rollback
Theoretical Computer Science
Hash chains with diminishing ranges for sensors
International Journal of High Performance Computing and Networking
International Journal of Security and Networks
Limiting DoS attacks during multihop data delivery in wireless sensor networks
International Journal of Security and Networks
Concrete Security for Entity Recognition: The Jane Doe Protocol
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
A New Message Recognition Protocol for Ad Hoc Pervasive Networks
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
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
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Certificate revocation using fine grained certificate space partitioning
FC'07/USEC'07 Proceedings of the 11th International Conference on Financial cryptography and 1st International conference on Usable Security
LARK: A Lightweight Authenticated ReKeying Scheme for Clustered Wireless Sensor Networks
ACM Transactions on Embedded Computing Systems (TECS)
Multi-Dimensional hash chains and application to micropayment schemes
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Efficient constructions for one-way hash chains
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Network access control for mobile ad-hoc networks
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
On fast verification of hash chains
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Securing sensor reports in wireless sensor networks
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
A secure energy-efficient routing protocol for WSN
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Efficient targeted key subset retrieval in fractal hash sequences
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
We introduce a novel technique for computation of consecutive preimages of hash chains. Whereas traditional techniques have a memory-times-computation complexity of O(n) per output generated, the complexity of our technique is only O(log2n), where n is the length of the chain. Our solution is based on the same principal amortization principle as [2], and has the same asymptotic behavior as this solution. However, our solution decreases the real complexity by approximately a factor of two. Thus, the computational costs of our solution are approximately 1/2log2 n hash function applications, using only a little more than log2 n storage cells. A result of independent interest is the lower bounds we provide for the optimal (but to us unknown) solution to the problem we study. The bounds show that our proposed solution is very close to optimal. In particular, we show that there exists no improvement on our scheme that reduces the complexity by more than an approximate factor of two.