Sciweavers

713 search results - page 68 / 143
» Dispersing Hash Functions
Sort
View
IACR
2011
92views more  IACR 2011»
13 years 9 months ago
From Non-Adaptive to Adaptive Pseudorandom Functions
Unlike the standard notion of pseudorandom functions (PRF), a non-adaptive PRF is only required to be indistinguishable from random in the eyes of a non-adaptive distinguisher (i....
Iftach Haitner, Itay Berman
SAINT
2006
IEEE
15 years 3 months ago
Fair Overload Handling Using Proof-of-Work Functions
Overload can reduce the overall performance of a computer system up to a point where the whole service might collapse. Thus, for example the load on a server must be controlled to...
Sebastian Golze, Gero Mühl
AFRICACRYPT
2009
Springer
15 years 4 months ago
Cryptanalysis of Vortex
Vortex is a hash function that was first presented at ISC’2008, then submitted to the NIST SHA-3 competition after some modifications. This paper describes several attacks on b...
Jean-Philippe Aumasson, Orr Dunkelman, Florian Men...
IEAAIE
2009
Springer
15 years 4 months ago
Spatial Exact Match Query Based on the NA-Tree Approach in P2P Systems
In this paper, we propose to apply an NA-tree in the Chord system to encode spatial region data in the data key part used in the hash function to data search. That is, we combine t...
Ye-In Chang, Chen-Chang Wu, Ching-I Wang
AINA
2005
IEEE
15 years 3 months ago
Efficient Secret Sharing with Access Structures in a Hierarchy
2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithmto reuse shado...
Chu-Hsing Lin, Wei Lee