Results 161 to 170 of about 7,609 (190)

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

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

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

A new fair micropayment system based on hash chain

IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004, 2004
Micropayment systems in existence usually do not provide fairness, which means that either the customer or the merchant, or both, can cheat each other and gain a financial advantage by misbehaving in the protocols. We propose a new fair micropayment system based on hash chain, which is an offline, prepaid system and supports divisibility of digital ...
Zongkai Yang, Weimin Lang, Yunmeng Tan
openaire   +1 more source

The Trustworthiness Based on Hash Chain in Wireless Sensor Network

2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, 2008
With a variety of attacks, this paper proposes a novel solution which requires establishing a trust among all nodes in mobile sensor networks and develops a material scheme which can achieve the goal. The scheme includes a mechanism to establish a trusted relation between all neighboring nodes and avoid untrustworthy nodes during the route discovery ...
Peng Xiong, Wei Zhang
openaire   +1 more source

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

Weighted One-Way Hash Chain and Its Applications

2000
An one-way hash chain generated by the iterative use of a one-way hash function on a secret value has recently been widely employed to develop many practical cryptographic solutions, especially electronic micropayment schemes. In this paper, we propose a new concept called a weighted one-way hash chain. We then proceed to use the new concept to improve
Sung-Ming Yen, Yuliang Zheng 0001
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

MeHLDT: A multielement hash lock data transfer mechanism for on-chain and off-chain

Peer-to-Peer Networking and Applications, 2023
Libo Feng, Shaowen Yao, Yu Bei
exaly