Results 221 to 230 of about 2,321,198 (259)

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{?}{=}
Sung Je Hong, Dae Hyun Yum, Jin-Seok Kim, Pil Joong Lee   +3 more
openaire   +2 more sources

Hash chain based strong password authentication scheme

International Bhurban Conference on Applied Sciences and Technology, 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 ...
Muhammad Shahzad Jan, M. Afzal
semanticscholar   +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   +3 more sources

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 ...
Yue Hu, Jin Sha Yuan
openaire   +2 more sources

Fast Verification of Hash Chains with Reduced Storage

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011
A hash chain H for a hash function hash(·) is a sequence of hash values , 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{?}{=} \\hash^{n ...
Dea Hyun Yum, Jin Seok Kim, Lee, PJ, Hong, SJ   +3 more
openaire   +3 more sources

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

Malicious node detection in OppNets using hash chain technique

International Conference on Computer Science and Network Technology, 2015
Opportunistic Networks aim to set a reliable networks where the nodes has no end-to-end connection and the communication links often suffer from frequent disruption and long delays.
Majeed Alajeely, Asma'a Ahmad, R. Doss
semanticscholar   +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.
Yuefei Zhu, Haojun Zhang
openaire   +2 more sources

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 ...
Pilar de la Torre, Gary D. Knott
openaire   +2 more sources

Analysis of hashing with chaining in the prime area

Journal of Algorithms, 1984
Abstract The expected performance of hashing with chaining in the prime area is analyzed. The method analyzed is briefly characterized as hashing with chaining of overflow records in the prime storage area, using one or several noncoalescing chains per bucket, and with random search for empty space.
openaire   +2 more sources