Sciweavers

208 search results - page 9 / 42
» Variationally universal hashing
Sort
View
ICASSP
2010
IEEE
14 years 12 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
ISW
2005
Springer
15 years 5 months ago
Universally Composable Time-Stamping Schemes with Audit
Abstract. We present a universally composable time-stamping scheme based on universal one-way hash functions. The model we use contains an ideal auditing functionality (implementab...
Ahto Buldas, Peeter Laud, Märt Saarepera, Jan...
FOCS
1999
IEEE
15 years 4 months ago
Limits on the Efficiency of One-Way Permutation-Based Hash Functions
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
Jeong Han Kim, Daniel R. Simon, Prasad Tetali
CCCG
2010
15 years 1 months ago
Fast local searches and updates in bounded universes
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
15 years 1 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan