Results 211 to 220 of about 72,170 (255)

Determining Minimum Hash Width for Hash Chains

Proceedings of the Third Central European Cybersecurity Conference, 2019
Cryptographic hash functions are used in authentication, and repeated application in hash chains is used in communication protocols. In embedded devices, the width of hash values and the associated effort to evaluate the hash function is crucial, and hence the hash values should be as short as possible but should still be sufficient to guarantee the ...
Martin Dietzfelbinger, Jörg Keller
openaire   +1 more source

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

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

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   +1 more source

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