How to construct random functions
Journal of the ACM (JACM)
On-line/off-line digital signatures
CRYPTO '89 Proceedings on Advances in cryptology
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A compact and fast hybrid signature scheme for multicast packet authentication
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Password authentication with insecure communication
Communications of the ACM
SPINS: security protocols for sensor networks
Wireless Networks
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
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
The Security of Cipher Block Chaining
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Keying Hash Functions for Message Authentication
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Fast Digital Identity Revocation (Extended Abstract)
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
PayWord and MicroMint: Two Simple Micropayment Schemes
Proceedings of the International Workshop on Security Protocols
Electronic Payments of Small Amounts
Proceedings of the International Workshop on Security Protocols
Reducing The Cost Of Security In Link-State Routing
SNDSS '97 Proceedings of the 1997 Symposium on Network and Distributed System Security
An efficient message authentication scheme for link state routing
ACSAC '97 Proceedings of the 13th Annual Computer Security Applications Conference
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Efficient Certificate Revocation
Efficient Certificate Revocation
PGP in constrained wireless devices
SSYM'00 Proceedings of the 9th conference on USENIX Security Symposium - Volume 9
Almost optimal hash sequence traversal
FC'02 Proceedings of the 6th international conference on Financial cryptography
LEAP+: Efficient security mechanisms for large-scale distributed sensor networks
ACM Transactions on Sensor Networks (TOSN)
Mitigating DoS attacks against broadcast authentication in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Defending against false-endorsement-based dos attacks in wireless sensor networks
WiSec '08 Proceedings of the first ACM conference on Wireless network security
Packet forwarding with source verification
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Low cost multicast authentication via validity voting in time-triggered embedded control networks
WESS '10 Proceedings of the 5th Workshop on Embedded Systems Security
Secure naming in information-centric networks
Proceedings of the Re-Architecting the Internet Workshop
Video streaming security: reliable hash chain mechanism using redundancy codes
Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
Improving the efficiency of anonymous routing for MANETs
Computer Communications
Sensor node source privacy and packet recovery under eavesdropping and node compromise attacks
ACM Transactions on Sensor Networks (TOSN)
Efficient targeted key subset retrieval in fractal hash sequences
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Authenticated key agreement in wireless networks with automated key management
Proceedings of the 6th International Conference on Security of Information and Networks
Hi-index | 0.00 |
One-way chains are an important cryptographic primitive in many security applications. As one-way chains are very efficient to verify, they recently became increasingly popular for designing security protocols for resource-constrained mobile devices and sensor networks, as their low-powered processors can compute a one-way function within milliseconds, but would require tens of seconds or up to minutes to generate or verify a traditional digital signature [6]. Recent sensor network security protocols thus extensively use one-way chains to design protocols that scale down to resource-constrained sensors [21,29]. Recently, researchers also proposed a variety of improvements to one-way hash chains to make storage and access more efficient [9,18,33], or to make setup and verification more efficient [17,21]. In this paper we present two new constructions for one-way hash chains, which significantly improve the efficiency of one-way chains. Our first construction, the Sandwich-chain, provides a smaller bandwidth overhead for one-way chain values, and enables efficient verification of one-way chain values if the trusted one-way chain value is far away. Our second construction, Comb Skipchain, features a new lower bound for one-way chains in terms of storage and traversal overhead. In fact previously, researchers [9] cite a lower bound of log2(n) for the product of per-value traversal overhead and memory requirements for one-dimensional chains. We show that one can achieve a lower bound by considering multi-dimensional chains. In particular, our two-dimensional construction requires O(log(n)) memory and O(1) traversal overhead, thereby improving on the one-dimensional bound. In addition, the setup cost for the one-way chain is in contrast only O(n/log(n)). Other benefits for both constructions include a faster verification step than the traditional hash chains provide; a verifier can “catch up” efficiently, after having missed some number of previously released hash values (for the Sandwich-chain); and resistance against DoS attacks on authentication values. Moreover, we describe fractal traversal schemes for our proposed structures, bringing down the traversal costs for our structure to the same as those of the simpler “traditional” hash chain. Our new construction is orthogonal to most previously proposed techniques, and can be used in conjunction with techniques for efficient setup or verification of one-way chains.