Wireless sensor networks are increasingly deployed in security-critical areas, such as battle field. However, general sensor nodes are manufactured with inexpensive components, and they are short of security enhancement. Therefore, an adversary could capture and compromise sensor nodes easily, then launch some malicious attacks (including tampering or discarding useful data collected from sourc...

One-way hash chains have been used in many micropayment schemes due to their simplicity and efficiency. In this paper we introduce the notion of multi-dimensional hash chains, which is a new generalization of traditional one-way hash chains. We show that this construction has storage-computational complexity of O(log 2 N) per chain element, which is comparable with the best result reported in r...

In this work we give the first non-adaptive construction of universal one-way hash functions (UOWHFs) from arbitrary functions. Our uses $$O(n^9)$$ calls to function, has a key length $$O(n^{10})$$ , and can be implemented in NC1 assuming underlying function is NC1. Prior work, best UOWHF used $$O(n^{13})$$ adaptive size $$O(n^5)$$ (Haitner, Holenstein, Reingold, Vadhan Wee [Eurocrypt ’10]). By...

Proxy Certificates (PCs) is one of key mechanisms in Grid Security Infrastructure (GSI). Users need PCs to access grid service. But there is no effective mechanism to manage the PCs in GSI. In order to apply GSI in Military Grid, a novel adaptive Proxy Certificates management scheme is brought forward based on the hierarchical one-way hash chains. The hierarchical one-way chain consists of two ...

We propose three digital coin schemes for doing electronic transactions over the Internet. These schemes are based on one-way hash functions. The rst scheme uses an ordinary one-way single hash function chain, which forms the basis of a simple micropayment scheme. The second scheme is based on a new technique called double-locked hash chain technique which overcomes some of the drawbacks found ...

A 224-bit One-way Hash Function: SHA-224 Status of this Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Abstract This document specifies a 224-bit one-way hash function, called SHA-224. SHA-224 is based on SHA-256, but it uses a different initial value and the result is truncated to 224...

We present explicit optimal binary pebbling algorithms for reversing one-way hash chains. For a hash chain of length 2, the number of hashes performed in each output round does not exceed d k 2 e, whereas the number of hash values stored throughout is at most k. This is optimal for binary pebbling algorithms characterized by the property that the midpoint of the hash chain is computed just once...

This paper presents a secure destination-sequenced distance-vector (SDSDV) routing protocol for mobile ad hoc wireless networks. The proposed protocol is based on the regular DSDV protocol. Within SDSDV, each node maintains two one-way hash chains about each node in the network. Two additional fields, which we call AL (alteration) field and AC (accumulation) field, are added to each entry of th...

To send the message to the recipient securely, authenticated encryption schemes were proposed. In 2008, Wu et al. [T.S. Wu, C.L. Hsu, K.Y. Tsai, H.Y. Lin, T.C. Wu, Convertible multi-authenticated encryption scheme, Information Sciences 178 (1) 256–263.] first proposed a convertible multi-authenticated encryption scheme based on discrete logarithms. However, the author finds that the computation...