Results 181 to 190 of about 6,906 (225)
Some of the next articles are maybe not open access.

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, O.V. Gavrylyako
openaire   +3 more sources

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.
Bicakci, K, Baykal, Nazife
openaire   +3 more sources

Divisible Blind Signatures based on Hash Chains

International Journal of Computers and Applications, 2004
AbstractThis article presents an efficient divisible blind signature scheme that makes it possible to divide a blind signature with a specified value into a sequence of subsignatures with smaller values for a sequence of different designated verifications.
Fan, C. I., Lei, C. L.
openaire   +2 more sources

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

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   +3 more
openaire   +2 more sources

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.   +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   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy