Results 201 to 210 of about 7,578 (241)

2D Hash Chain robust Random Key Distribution scheme

Information Processing Letters, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ehdaie, Mohammad, Alexiou, Nikos, Ahmadian, Mahmoud, Aref, Mohammad Reza, Papadimitratos, Panos   +4 more
openaire   +1 more source

Concurrent Chaining Hash Maps for Software Model Checking

2019 Formal Methods in Computer Aided Design (FMCAD), 2019
Stateful model checking creates numerous states which need to be stored and checked if already visited. One option for such storage is a hash map and this has been used in many model checkers. In particular, we are interested in the performance of concurrent hash maps for use in multi-core model checkers with a variable state vector size.
Van Der Berg, Freark I., Van De Pol, Jaco   +1 more
openaire   +2 more sources

Hash chain based strong password authentication scheme

2016 13th International Bhurban Conference on Applied Sciences and Technology (IBCAST), 2016
The constant influence of passwords over all other methods of identity authentication is a key discomfiture to security examiners. Web technologies are gaining more and more fame day by day but the persistent survival and replication of password authentication schemes generate difficulties for end users.
Muhammad Shahzad Jan, Mehreen Afzal
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.
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