Results 31 to 40 of about 2,746,805 (293)
String commitment scheme with low output locality [PDF]
, 2019 Commitment schemes are important tools for various protocols. However, no scheme with output locality have been proposed yet. Low output locality is a property of functions that every output bit to depend on a small number of input bits.
Atsuko Miyaji +5 more
core +1 more source
On the Indifferentiability of the Grøstl Hash Function [PDF]
, 2010 The notion of indifferentiability, introduced by Maurer et al., is an important criterion for the security of hash functions. Concretely, it ensures that a hash function has no structural design flaws and thus guarantees security against generic attacks up to the proven bounds. In this work we prove the indifferentiability of Grostl, a second round SHA-
Elena Andreeva 0001 +2 more
openaire +4 more sources
Bridging distributed hash tables in wireless ad-hoc networks [PDF]
, 2007 The adaptation of structured P2P networks, i.e. Distributed Hash Tables (DHTs), to wireless ad-hoc networks has been investigated in recent years. Existing work assume all peers would come to an agreement on establishing one uniform DHT across the ...
Cheng, L., Lawrence Cheng
core +1 more source
Can There Be a Two Way Hash Function?
IEEE AccessIt is computationally impossible for one-way hash functions to obtain the original data again. In this study, Two Way Hash Function (TWHF) is proposed which provides the security properties of one-way hash functions. TWHF aims to hash/encrypt and decrypt
Timucin Koroglu, Refik Samet
doaj +1 more source
Journal of King Saud University: Computer and Information Sciences, 2020 Data Integrity is one of the primary concepts in information security. The main task of the cryptographic hash function is to assure the integrity of the transmitted data.
Mishal Almazrooie +5 more
doaj +1 more source
Random Structures & Algorithms, 2000 AbstractWe define a family of functions F from a domain U to a range R to be dispersing if for every set S ⊆ U of a certain size and random h ∈ F, the expected value of ∣S∣ – ∣h[S]∣ is not much larger than the expectation if h had been chosen at random from the set of all functions from U to R.We give near‐optimal upper and lower bounds on the size of ...
openaire +3 more sources
Hash Functions Using Chaotic Iterations
Journal of Algorithms & Computational Technology, 2010 In this paper, a novel formulation of discrete chaotic iterations in the field of dynamical systems is given. Their topological properties are studied: it is mathematically proven that, under some conditions, these iterations have a chaotic behavior as ...
Jacques M. Bahi, Christophe Guyeux
doaj +1 more source
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
A Novel Hash Function Based on a Chaotic Sponge and DNA Sequence
IEEE Access, 2021 Many chaos-based hash functions have convoluted designs that are not based on proper design principles, complicating the verification of security claims.
Moatsum Alawida +5 more
doaj +1 more source