Results 161 to 170 of about 2,863 (194)

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

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

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

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   +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; id_orcid 0000-0003-4305-0625   +1 more
openaire   +2 more sources

The application of hash chains and hash structures to cryptography

2009
In this thesis we study how hash chains and other hash structures can be used in various cryptographic applications. In particular we focus on the applications of entity authentication, signatures and key establishment. We study recursive application of hash functions to create hash chains, hash trees and other hash structures.
openaire   +3 more sources

Improved Scalable Hash Chain Traversal

2003
Yaron Sella recently proposed a scalable version of Jakobsson’s algorithm to traverse a hash chain of size n. Given the hash chain and a computation limit m (k=m+1 and \(b=\sqrt[k]{n}\)), Sella’s algorithm traverses the hash chain using a total of kb memory. We improve the memory usage to k(b-1).
openaire   +1 more source

Scalable Hash Chain Traversal for Mobile Devices

2005
Yaron Sella recently proposed a scalable version of Jakobsson's algorithm to traverse a hash chain of size n. Given the hash chain and a computation limit m (k=m+1 and (b = $\sqrt[k]{n}$)), Sella's algorithm traverses the hash chain using a total of kb memory. We improve the memory usage to k(b–1).
openaire   +1 more source