Sciweavers

713 search results - page 58 / 143
» Dispersing Hash Functions
Sort
View
ECCC
2011
207views ECommerce» more  ECCC 2011»
14 years 4 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
SP
2002
IEEE
140views Security Privacy» more  SP 2002»
14 years 9 months ago
Efficient Multicast Packet Authentication Using Signature Amortization
We describe a novel method for authenticating multicast packets that is robust against packet loss. Our main focus is to minimize the size of the communication overhead required t...
Jung Min Park, Edwin K. P. Chong, Howard Jay Siege...
CRYPTO
2006
Springer
129views Cryptology» more  CRYPTO 2006»
14 years 11 months ago
New Proofs for
HMAC was proved in [3] to be a PRF assuming that (1) the underlying compression function is a PRF, and (2) the iterated hash function is weakly collision-resistant. However, recent...
Mihir Bellare
SIGIR
2005
ACM
15 years 3 months ago
Publish/subscribe functionality in IR environments using structured overlay networks
We study the problem of offering publish/subscribe functionality on top of structured overlay networks using data models and languages from IR. We show how to achieve this by ext...
Christos Tryfonopoulos, Stratos Idreos, Manolis Ko...
VMV
2003
151views Visualization» more  VMV 2003»
14 years 11 months ago
Optimized Spatial Hashing for Collision Detection of Deformable Objects
We propose a new approach to collision and self– collision detection of dynamically deforming objects that consist of tetrahedrons. Tetrahedral meshes are commonly used to repre...
Matthias Teschner, Bruno Heidelberger, Matthias M&...