Results 221 to 230 of about 2,148,635 (268)

Collision Resistant Double-Length Hashing

2010
We give collision resistance bounds for blockcipher based, double-call, double-length hash functions using (k, n)-bit blockciphers with k > n. Ozen and Stam recently proposed a framework [21] for such hash functions that use 3n-to-2n-bit compression functions and two parallel calls to two independent blockciphers with 2n-bit key and n-bit block size.
Stefan Lucks, Christian Forler, Ewan Fleischmann, Michael Gorski   +3 more
openaire   +2 more sources

On optimal arrangements of keys with double hashing

Journal of Algorithms, 1985
Given a set of n keys, the keys are arranged in a hash table of size n such that the worst-case retrieval time is minimized. It is shown that, when double hashing is used, one can, with probability 1 − o(1), arrange the keys to achieve a worst-case retrieval time O(log n). This gives a solution to an open problem in Rivest (J. Assoc. Comput. Mach.
openaire   +2 more sources

Another Glance at Double-Length Hashing

2009
We propose a novel framework for blockcipher-based double-length hash functions by extending the recent generalization presented by Stam at FSE '09 for single-call hash functions. We focus on compression functions compressing 3n bits to 2n bits that use one or two calls to a 2n -bit key, n -bit block blockcipher.
Martijn Stam, Onur Özen
openaire   +2 more sources

Double hash function scheme in wireless sensor networks

2011 World Congress on Information and Communication Technologies, 2011
Wireless sensor networks are a new class of distributed systems that are an integral part of the physical space they inhabit. Key distribution plays an important role in wireless sensor networks. In WSN, node capture attack is the most series attack. The aim of this paper is to improve the resistance against the node capture attack.
C. Divya, T.D. Subash
openaire   +2 more sources

Image hashing using AQ-CSLBP with double bit quantization

2016 International Conference on Optoelectronics and Image Processing (ICOIP), 2016
This paper presents a novel image hashing method for authentication and tampering detection. Creation, modification and transfer of multimedia data becomes an easy task due to digitization.
V. Patil, T. Sarode
semanticscholar   +1 more source

Right Transfer Method Based on Double HASH Chain

Applied Mechanics and Materials, 2014
This Paper analyzes security issues during the process of the right transfer, sums up the basic needs during the transfer and the defects of existing rights transfer, and puts forward the right transfer program based on double HASH chain, which achieves the transfer of the digital right under the control of HASH Distance and meta-rights.
Ping Zhu, Mu Yao Lu
openaire   +2 more sources

Attacks on a double length blockcipher-based hash proposal

Cryptography and Communications, 2014
In this paper we attack a 2n-bit double length hash function proposed by Lee et al. This proposal is a blockcipher-based hash function with hash rate 2/3. The designers claimed that it could achieve ideal collision resistance and gave a security proof. However, we find a collision attack with complexity of O(23n/4) and a preimage attack with complexity
Xuejia Lai, Tiejun Jia, Yiyuan Luo
openaire   +2 more sources

Analysis of Double Block Length Hash Functions

2003
The security of double block length hash functions and their compression functions is analyzed in this paper. First, the analysis of double block length hash functions by Satoh, Haga, and Kurosawa is investigated. The focus of this investigation is their analysis of the double block length hash functions with the rate 1 whose compression functions ...
Susumu Yoshida, Mitsuhiro Hattori, Shoichi Hirose   +2 more
openaire   +1 more source

Robust Video Hashing Based on Double-Layer Embedding

IEEE Signal Processing Letters, 2011
A robust video hashing scheme for video content identification and authentication is proposed, which is called Double-Layer Embedding scheme. Intra-cluster Locally Linear Embedding (LLE) and inter-cluster Multi-Dimensional Scaling (MDS) are used in the scheme.
Wei Liu, Xiushan Nie, Jiande Sun, Ju Liu
openaire   +2 more sources

Double locality sensitive hashing Bloom filter for high-dimensional streaming anomaly detection

Information Processing & Management, 2023
Zhixia Zeng, Ruliang Xiao, Xinhong Lin, Tianjian Luo, Jiayin Lin   +4 more
semanticscholar   +1 more source