Sciweavers

4438 search results - page 91 / 888
» On the Distribution of Keys by Hashing
Sort
View
ANCS
2009
ACM
14 years 9 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...
CRYPTO
2011
Springer
222views Cryptology» more  CRYPTO 2011»
13 years 11 months ago
The PHOTON Family of Lightweight Hash Functions
RFID security is currently one of the major challenges cryptography has to face, often solved by protocols assuming that an on-tag hash function is available. In this article we pr...
Jian Guo 0001, Thomas Peyrin, Axel Poschmann
SIGIR
2012
ACM
13 years 2 months ago
Boosting multi-kernel locality-sensitive hashing for scalable image retrieval
Similarity search is a key challenge for multimedia retrieval applications where data are usually represented in high-dimensional space. Among various algorithms proposed for simi...
Hao Xia, Pengcheng Wu, Steven C. H. Hoi, Rong Jin
CCS
2007
ACM
15 years 6 months ago
Hardware-rooted trust for secure key management and transient trust
We propose minimalist new hardware additions to a microprocessor chip that protect cryptographic keys in portable computing devices which are used in the field but owned by a cen...
Jeffrey S. Dwoskin, Ruby B. Lee
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
15 years 9 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon