Results 11 to 20 of about 20,383 (214)
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 +1 more source
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 +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
Load Thresholds for Cuckoo Hashing with Double Hashing
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 ...
Mitzenmacher, Michael +2 more
openaire +4 more sources
Fast and Powerful Hashing using Tabulation [PDF]
, 2016 Randomized algorithms are often enjoyed for their simplicity, but the hash functions employed to yield the desired probabilistic guarantees are often too complicated to be practical.
Thorup, Mikkel
core +3 more sources
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
Some Attacks Against a Double Length Hash Proposal [PDF]
Cryptography and Communications, 2005 At FSE 2005, Nandi et al proposed a method to turn an n-bit compression function into a 2n-bit compression function. In the black-box model, the security of this double length hash proposal against collision attacks is proven, if no more than Ω(22n/3) oracle queries to the underlying n-bit function are made.
Lars R. Knudsen, Frédéric Muller
+6 more sources
The most efficient indifferentiable hashing to elliptic curves of j-invariant 1728
Journal of Mathematical Cryptology, 2022 This article makes an important contribution to solving the long-standing problem of whether all elliptic curves can be equipped with a hash function (indifferentiable from a random oracle) whose running time amounts to one exponentiation in the basic ...
Koshelev Dmitrii
doaj +1 more source
The Stability and the Security of the Tangle [PDF]
, 2019 In this paper we study the stability and the security of the distributed data structure at the base of the IOTA protocol, called the Tangle. The contribution of this paper is twofold.
Bramas, Quentin
core +2 more sources
Optimized Entanglement Purification [PDF]
, 2019 We investigate novel protocols for entanglement purification of qubit Bell pairs. Employing genetic algorithms for the design of the purification circuit, we obtain shorter circuits achieving higher success rates and better final fidelities than what is ...
Albert, Victor V. +2 more
core +2 more sources