Sciweavers

713 search results - page 33 / 143
» Dispersing Hash Functions
Sort
View
ASIACRYPT
2009
Springer
15 years 4 months ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...
FSE
2006
Springer
107views Cryptology» more  FSE 2006»
15 years 1 months ago
Some Plausible Constructions of Double-Block-Length Hash Functions
Abstract. In this article, it is discussed how to construct a compression function with 2n-bit output using a component function with n-bit output. The component function is either...
Shoichi Hirose
EH
1999
IEEE
141views Hardware» more  EH 1999»
15 years 2 months ago
On-Line Evolution of FPGA-Based Circuits: A Case Study on Hash Functions
An evolutionary algorithm is used to evolve a digital circuit which computes a simple hash function mapping a 16bit address space into an 8-bit one. The target technology is FPGA,...
Ernesto Damiani, Andrea Tettamanzi, Valentino Libe...
110
Voted
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
15 years 10 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
CCR
2008
101views more  CCR 2008»
14 years 9 months ago
Empirical evaluation of hash functions for multipoint measurements
A broad spectrum of network measurement applications demand passive multipoint measurements in which data from multiple observation points has to be correlated. Examples are the p...
Christian Henke, Carsten Schmoll, Tanja Zseby