Name
Abstract | ||
|---|---|---|
We introduce CAMsure, the first realization of secure Content Addressable Memory (CAM) in the context of approximate search using near-neighbor algorithms. CAMsure provides a lightweight solution for practical secure (approximate) search with a minimal drop in the accuracy of the search results. CAM has traditionally been used as a hardware search engine that explores the entire memory in a single clock cycle. However, there has been little attention to the security of the data stored in CAM. Our approach stores distance-preserving hash embeddings within CAM to ensure data privacy. The hashing method provides data confidentiality while preserving similarity in the sense that a high resemblance in the data domain is translated to a small Hamming distance in the hash domain. Consequently, the objective of near-neighbor search is converted to approximate lookup table search which is compatible with the realizations of emerging content addressable memories. Our methodology delivers on average two orders of magnitude faster response time compared to RAM-based solutions that preserve the privacy of data owners.
|
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3126547 | ACM Trans. Embedded Comput. Syst. |
Keywords | Field | DocType |
Approximate Search, Content-Addressable Memory, In-Memory Computation, Near-Neighbor Search, Privacy-Preserving Computing | Lookup table,Data domain,Content-addressable memory,Search engine,Computer science,Beam search,Theoretical computer science,Hamming distance,Hash function,Information privacy | Journal |
Volume | Issue | ISSN |
16 | 5 | 1539-9087 |
Citations | PageRank | References |
2 | 0.38 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Sadegh Riazi | 1 | 18 | 1.36 |
| Mohammad Samragh | 2 | 38 | 7.01 |
| Farinaz Koushanfar | 3 | 3055 | 268.84 |