Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity

Yum, Dae Hyun; Seo, Jae Woo; Eom, Sungwook; Lee, Pil Joong

doi:10.1007/978-3-642-00862-7_22

Cited by 13 publications

(9 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This can be accomplished using an arbitrary hash chain traversal algorithm. For our protocol we use the algorithm presented in [27], which requires the computation of 1 2 log 2 links in eahch round and needs to store log 2 links and seeds.…”

Section: Protocol Descriptionmentioning

confidence: 99%

Efficient and Secure Aggregation of Sensor Data against Multiple Corrupted Nodes

Miyaji

Omote

2011

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYWireless Sensor Networks (WSNs) rely on in-network aggregation for efficiency, that is, readings from sensor nodes are aggregated at intermediate nodes to reduce the communication cost. However, the previous optimally secure in-network aggregation protocols against multiple corrupted nodes require two round-trip communications between each node and the base station, including the result-checking phase whose congestion is O(log n) where n is the total number of sensor nodes. In this paper * * , we propose an efficient and optimally secure sensor network aggregation protocol against multiple corrupted nodes by a random-walk adversary. Our protocol achieves one round-trip communication to satisfy optimal security without the result-checking phase, by conducting aggregation along with the verification, based on the idea of TESLA technique. Furthermore, we show that the congestion complexity, communication complexity and computational cost in our protocol are constant, i.e., O(1).

show abstract

Section: Protocol Descriptionmentioning

confidence: 99%

Efficient and Secure Aggregation of Sensor Data against Multiple Corrupted Nodes

Miyaji

Omote

2011

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…At CT-RSA 2009, we introduced a single-layer fractal hash traversal algorithm that is also almost optimal [5] * . While our algorithm of [5] is based on the simple singlelayer fractal structure of [1], it reduces budget by half without using extra pebbles; total log n pebbles and 1 2 log n budget are needed.…”

Section: Hash Chain Traversal For M =mentioning

confidence: 99%

“…While our algorithm of [5] is based on the simple singlelayer fractal structure of [1], it reduces budget by half without using extra pebbles; total log n pebbles and 1 2 log n budget are needed. In terms of the budget-times-storage complexity, our algorithm of [5] is the best hash chain traversal algorithm.…”

Section: Hash Chain Traversal For M =mentioning

confidence: 99%

“…As an example, we present the traversal algorithm of [5] in Algorithm 1 with subroutines in Algorithm 2 and Algorithm 3, where n is the length of the hash chain, l is a security parameter, h(·) is a hash function, and p is an array of pebbles. T setup stores in pebbles some carefully chosen hash values of the chain including the secret value v n .…”

Section: Algorithm 1 Traversal Algorithm Tmentioning

confidence: 99%

“…A hash chain traversal algorithm T computes and outputs the hash chain H, starting from v 1 and ending with v n , by using dynamic memory storages (called pebbles). All previous hash chain traversal algorithms (e.g., [1]- [5]) have the output interval m = 1, which means that T outputs all hash values v 1 , v 2 , v 3 , . .…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Generalized Hash Chain Traversal with Selective Output

Yum

Seo

Cho

et al. 2010

IEICE Trans. Inf. & Syst.

Self Cite

View full text Add to dashboard Cite

SUMMARYA hash chain H for a one-way hash function h(·) is a sequence of hash values v 0 , v 1 , . . . , v n , where v 0 is a public value, v n a secret value, and v i = h(v i+1 ). A hash chain traversal algorithm T computes and outputs the hash chain H, returning v i in time period (called round) i for 1 ≤ i ≤ n. While previous hash chain traversal algorithms were designed to output all hash values v i (1 ≤ i ≤ n) in order, there are applications where every m-th hash value (i.e., v m , v 2m , v 3m , . . .) is required to be output. We introduce a hash chain traversal algorithm that selectively outputs every m-th hash value efficiently. The main technique is a transformation from a hash chain traversal algorithm outputting every hash value into that outputting every m-th hash value. Compared with the direct use of previous hash chain traversal algorithms, our proposed method requires less memory storages and computational costs.

show abstract

Short Hash-Based Signatures for Wireless Sensor Networks

Dahmen

Krauß

2009

Cryptology and Network Security

View full text Add to dashboard Cite

Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity

Cited by 13 publications

References 15 publications

Efficient and Secure Aggregation of Sensor Data against Multiple Corrupted Nodes

Efficient and Secure Aggregation of Sensor Data against Multiple Corrupted Nodes

Generalized Hash Chain Traversal with Selective Output

Short Hash-Based Signatures for Wireless Sensor Networks

Contact Info

Product

Resources

About