Results 221 to 230 of about 2,377,005 (278)

Cost Effective Hash Chain Based Key Pre-Distribution Scheme for Wireless Sensor Network

International Conference on Speech Technology and Human-Computer Dialogue, 2018
In wireless sensor network (WSN), a secure link in the key pre-distribution (KP) scheme may be compromised when sensor nodes are captured. Accordingly, the KP q- composite scheme was proposed to tackle this node-capture problem.
Ching-Nung Yang, Ting-Ju Lin, Song-Yu Wu, S. Lin, Wei Bi   +4 more
semanticscholar   +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{?}{=}
Sung Je Hong, Dae Hyun Yum, Jin-Seok Kim, Pil Joong Lee   +3 more
openaire   +2 more sources

A Lightweight Synchronous Cryptographic Hash Chain Solution to Securing the Vehicle CAN bus

2018 IEEE International Multidisciplinary Conference on Engineering Technology (IMCET), 2018
The Controller Area Network (CAN) bus is the de facto standard for communication inside the vehicle between its Electronic Control Units (ECUs) and the various sensors that are distributed throughout the body and powertrain of the vehicle.
Joe Halabi, H. Artail
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

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   +2 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

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   +2 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

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

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