Results 231 to 240 of about 32,420 (268)

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.
Tamer Refaei, Mark Horvath, Michelle Schumaker, Creighton Hager   +3 more
openaire   +1 more source

Hash table collision resolution with direct chaining

Journal of Algorithms, 1989
Abstract The hash table method called direct chaining, wherein chains of items with the same hash function value are kept in a single table without recourse to an index table or a separate overflow area, is described. An explicitly linked free-space list is used which allows arbitrary insertion and deletion sequences to be done indefinitely with no ...
Gary D Knott, Pilar de la Torre
openaire   +1 more source

On Fast Verification of Hash Chains

2010
A hash chain H for a hash function hash(·) is a sequence of hash values 〈xn, xn−1,..., x0 〉, where x0 is a secret value, xi is generated by xi=hash(xi−1) for 1≤i≤n, and xn is a public value. Hash values of H are disclosed gradually from xn−1 to x0. The correctness of a disclosed hash value xi can be verified by checking the equation $x_n \stackrel{?}{=}
Dae Hyun Yum, Jin Seok Kim, Pil Joong Lee, Sung Je Hong   +3 more
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.
P.G. Bradford, O.V. Gavrylyako
openaire   +1 more source

Improved Scalable Hash Chain Traversal

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).
openaire   +1 more source

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

Implementation of RFID Middleware Based on Hash Chain

Applied Mechanics and Materials, 2013
With the development of RFID technology , RFID middleware is gradually being taken seriously.RFID middleware can provide strong support for the RFID system, to make it more widely available. This paper introduces the MD5 and SHA-two kinds of hash algorithm.The design of RFID middleware software implementation based on the Hash link protocol, laid the ...
Jin Sha Yuan, Yue Hu
openaire   +1 more source

Evaluation of Associative Memory Using Parallel Chained Hashing

IEEE Transactions on Computers, 1984
Two parallel hashing algorithms based on open and chained hashing are discussed. The parallel chained hashing algorithm is efficient even in the environment where deletion and insertion frequently occur. The chained hashing memory with fewer memory banks has a performance equivalent to that of the open hashing memory.
null Hiraki, null Nishida, null Shimada
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

Efficient Sealed-bid Auction using Hash Chain

2001
This paper proposes the first sealed-bid auction method which uses only hash function. We use a hash chain to commit a bidding price. By using the hash chain, we can drastically reduce the time needed for bidding and opening bids. If we use a practical hash function e.g.
Koutarou Suzuki, Kunio Kobayashi, Hikaru Morita   +2 more
openaire   +1 more source