Sciweavers

1262 search results - page 26 / 253
» Fast Robust Hashing
Sort
View
P2P
2007
IEEE
165views Communications» more  P2P 2007»
15 years 3 months ago
An Information-Theoretic Framework for Analyzing Leak of Privacy in Distributed Hash Tables
An important security issue in DHT-based structured overlay networks is to provide anonymity to the storage nodes. Compromised routing tables in those DHTs leak information about ...
Souvik Ray, Zhao Zhang
PVLDB
2008
127views more  PVLDB 2008»
14 years 9 months ago
Hashed samples: selectivity estimators for set similarity selection queries
We study selectivity estimation techniques for set similarity queries. A wide variety of similarity measures for sets have been proposed in the past. In this work we concentrate o...
Marios Hadjieleftheriou, Xiaohui Yu, Nick Koudas, ...
72
Voted
SACRYPT
2007
Springer
151views Cryptology» more  SACRYPT 2007»
15 years 3 months ago
Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
The diversity of methods for fast collision search in SHA-1 and similar hash functions makes a comparison of them difficult. The literature is at times very vague on this issue, wh...
Christophe De Cannière, Florian Mendel, Chr...
81
Voted
IPPS
2007
IEEE
15 years 3 months ago
Gossip-based Reputation Aggregation for Unstructured Peer-to-Peer Networks
: Peer-to-Peer (P2P) reputation systems are needed to evaluate the trustworthiness of participating peers and to combat selfish and malicious peer behaviors. The reputation system ...
Runfang Zhou, Kai Hwang
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 2 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...