Results 201 to 210 of about 1,539,949 (235)

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

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.
Kemal Bicakci, Nazife Baykal
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   +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   +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.
M. Tamer Refaei, Mark Horvath, Michelle Schumaker, Creighton Hager   +3 more
openaire   +2 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   +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

Hash Function Vulnerability Index and Hash Chain Attacks

2007 3rd IEEE Workshop on Secure Network Protocols, 2007
A hash chain is constructed by repeated hashing from an initial value. While it finds applications for network protocol design it also poses threats to hash function one-way and collision-free properties. We investigate the complexity of breaking hash function security properties by hash chain attacks using probabilistic algorithms.
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   +2 more sources

Foundations of security for hash chains in ad hoc networks

23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings., 2004
Nodes in ad hoc networks generally transmit data at regular intervals over long periods of time. Recently, ad hoc network nodes have been built that run on little power and have very limited memory. Authentication is a significant challenge in ad hoc networks, even without considering size and power constraints.
Phillip G. Bradford, Olga V. Gavrylyako
openaire   +2 more sources