Results 11 to 20 of about 1,687 (211)
Load Thresholds for Cuckoo Hashing with Double Hashing. [PDF]
16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 2018 In k-ary cuckoo hashing, each of cn objects is associated with k random buckets in a hash table of size n. An l-orientation is an assignment of objects to associated buckets such that each bucket receives at most l objects. Several works have determined load thresholds c^* = c^*(k,l) for k-ary cuckoo hashing; that is, for c < c^* an l-orientation ...
Michael Mitzenmacher +2 more
core +5 more sources
The analysis of double hashing
Journal of Computer and System Sciences, 1978 In this paper we analyze the performance of double hashing, a well-known hashing algorithm in which we probe the hash table along arithmetic progressions where the initial element and the increment of the progression are chosen randomly and independently depending only on the key \(K\) of the search.
Leonidas J. Guibas, Endre Szemerédi
openaire +3 more sources
Permutation-Based Hashing Beyond the Birthday Bound [PDF]
IACR Transactions on Symmetric CryptologyIt is known that the sponge construction is tightly indifferentiable from a random oracle up to around 2c/2 queries, where c is the capacity. In particular, it cannot provide generic security better than half of the underlying permutation size.
Charlotte Lefevre, Bart Mennink
doaj +4 more sources
Deck-Based Wide Block Cipher Modes and an Exposition of the Blinded Keyed Hashing Model
IACR Transactions on Symmetric Cryptology, 2020 We present two tweakable wide block cipher modes from doubly-extendable cryptographic keyed (deck) functions and a keyed hash function: double-decker and docked-double-decker.
Aldo Gunsing, Joan Daemen, Bart Mennink
doaj +3 more sources
Bipartite Random Graphs and Cuckoo Hashing [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 The aim of this paper is to extend the analysis of Cuckoo Hashing of Devroye and Morin in 2003. In particular we make several asymptotic results much more precise.
Reinhard Kutzelnigg
doaj +2 more sources
Balanced allocations and double hashing [PDF]
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2014 Further updated, small improvements/typos ...
Michael Mitzenmacher
openaire +3 more sources
Double hashing technique in closed hashing search process
IOP Conference Series: Materials Science and Engineering, 2017 The search process is used in various activities performed both online and offline, many algorithms that can be used to perform the search process one of which is a hash search algorithm, search process with hash search algorithm used in this study using double hashing technique where the data will be formed into the table with same length and then ...
Robbi Rahim +2 more
openaire +2 more sources
Sensors, 2022 Groundwater overuse in different domains will eventually lead to global freshwater scarcity. To meet the anticipated demands, many governments worldwide are employing innovative and traditional techniques for forecasting groundwater availability by ...
Sukrutha L. T. Vangipuram +3 more
doaj +1 more source
CAAI Transactions on Intelligence Technology, EarlyView., 2023 Abstract This research focuses on addressing the privacy issues in healthcare advancement monitoring with the rapid establishment of the decentralised communication system in the Internet of Medical Things (IoMT). An integrated blockchain homomorphic encryption standard with an in‐build supervised learning‐based smart contract is designed to improvise ...
Chandramohan Dhasarathan +7 more
wiley +1 more source
Assessing Blockchain Consensus and Security Mechanisms against the 51% Attack
Applied Sciences, 2019 The 51% attack is a technique which intends to fork a blockchain in order to conduct double-spending. Adversaries controlling more than half of the total hashing power of a network can perform this attack.
Sarwar Sayeed, Hector Marco-Gisbert
doaj +1 more source