Results 151 to 160 of about 7,609 (190)

Improved Scalable Hash Chain Traversal

Lecture Notes in Computer Science, 2003
Yaron Sella recently proposed a scalable version of Jakobsson’s algorithm to traverse a hash chain of size n. Given the hash chain and a computation limit m (k=m+1 and \(b=\sqrt[k]{n}\)), Sella’s algorithm traverses the hash chain using a total of kb memory. We improve the memory usage to k(b-1).
Sung-Ryul Kim, Kim Sung-Ryul
exaly   +2 more sources

Hash Function Vulnerability Index and Hash Chain Attacks

2007 3rd IEEE Workshop on Secure Network Protocols, 2007
A hash chain is constructed by repeated hashing from an initial value. While it finds applications for network protocol design it also poses threats to hash function one-way and collision-free properties. We investigate the complexity of breaking hash function security properties by hash chain attacks using probabilistic algorithms.
David Lee
exaly   +2 more sources

Determining Minimum Hash Width for Hash Chains

Proceedings of the Third Central European Cybersecurity Conference, 2019
Cryptographic hash functions are used in authentication, and repeated application in hash chains is used in communication protocols. In embedded devices, the width of hash values and the associated effort to evaluate the hash function is crucial, and hence the hash values should be as short as possible but should still be sufficient to guarantee the ...
Martin Dietzfelbinger, Jörg Keller 0001
openaire   +1 more source

Hash chains with diminishing ranges for sensors

International Journal of High Performance Computing and Networking, 2004
Sensors and other constrained devices periodically transmit small information packets motivating the study of hash chains with small domains and ranges. Hash chain based protocols use deferred disclosure and it is often assumed their hash functions are one-way, thus essentially unbreakable.
Phillip G. Bradford, Olga V. Gavrylyako
openaire   +1 more source

IJTAG Integrity Checking with Chained Hashing

2018 IEEE International Test Conference (ITC), 2018
The JTAG port is a well-known vector for attacks that attempt to gain access to a chip’s internal circuitry. Such attacks may modify or extract proprietary data and can lead to misconfigured chips and IP theft. This paper uses a hash-based signature created through the history of the data shifted into and out of a device via IJTAG to provide a measure ...
Senwen Kan, Jennifer Dworak
openaire   +1 more source

Infinite length hash chains and their applications

Proceedings. Eleventh IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2003
Hash chains are used extensively in various cryptography applications such as one-time passwords, server-supported signatures and micropayments. In this paper, we present a method, called infinite length hash chains to improve the flexibility of this chaining idea by using public-key techniques.
Kemal Bicakci, Nazife Baykal
openaire   +2 more sources

Self-Updating Hash Chains and Their Implementations

2006
Hash Chains are widely used in various cryptography applications such as one-time passwords, server-supported signatures and micropayments etc. However, the finite length (‘limited-link') of hash chains limits their applications. Some methods of re-initializing hash chains or infinite hash chains introduced in literatures are inefficient and un-smooth.
Haojun Zhang, Yuefei Zhu
openaire   +1 more source

A Recursive Algorithm for General Hash Chain Traversal

2014 IEEE 17th International Conference on Computational Science and Engineering, 2014
A hash chain is a popular tool for improving the efficiency of several cryptographic applications. In spite of the computation efficiency of one-way function, the performance issue is a challenging research topic for chains with long length in resource-constrained environments.
Yi-Wen Peng, Wei-Mei Chen
openaire   +1 more source

Analysis of hashing with chaining in the prime area

Journal of Algorithms, 1984
The expected performance of hashing with chaining in the prime area is analyzed. The basic idea of this overflow handling technique is straightforward: a record that does not fit into its home bucket, is placed in some other (non-full) bucket and connected to an overflow chain emanating from the home bucket.
openaire   +1 more source

Data authentication for NDN using hash chains

2015 IEEE Symposium on Computers and Communication (ISCC), 2015
Named Data Networking (NDN) is considered to be a viable replacement of the traditional IP networking for the next generation Internet architecture. NDN is a data centric, rather than host centric, approach to discovery and retrieval of information distributed across a network.
M. Tamer Refaei, Mark Horvath, Michelle Schumaker, Creighton Hager   +3 more
openaire   +1 more source