Sciweavers

658 search results - page 68 / 132
» The Grindahl Hash Functions
Sort
View
ICASSP
2010
IEEE
14 years 10 months ago
Tracking encrypted VoIP calls via robust hashing of network flows
In this work we propose a Voice over IP (VoIP) call tracking scheme based on robust hashing of VoIP flows. In the proposed scheme the audio content of a possibly encrypted VoIP ï...
Baris Coskun, Nasir D. Memon
SPIRE
2010
Springer
14 years 8 months ago
Fingerprinting Ratings for Collaborative Filtering - Theoretical and Empirical Analysis
Abstract. We consider fingerprinting methods for collaborative filtering (CF) systems. In general, CF systems show their real strength when supplied with enormous data sets. Earl...
Yoram Bachrach, Ralf Herbrich
PPOPP
2011
ACM
14 years 19 days ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
ASIACRYPT
2011
Springer
13 years 9 months ago
Short Signatures from Weaker Assumptions
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
Dennis Hofheinz, Tibor Jager, Eike Kiltz
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