{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:54:18Z","timestamp":1773932058778,"version":"3.50.1"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"5s","license":[{"start":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T00:00:00Z","timestamp":1506470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100014036","name":"Multidisciplinary University Research Initiative","doi-asserted-by":"crossref","award":["FA9550-14-1-0351"],"award-info":[{"award-number":["FA9550-14-1-0351"]}],"id":[{"id":"10.13039\/100014036","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-11-1-0885"],"award-info":[{"award-number":["N00014-11-1-0885"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2017,10,31]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/3126547","type":"journal-article","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T12:33:53Z","timestamp":1506515633000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["CAMsure"],"prefix":"10.1145","volume":"16","author":[{"given":"M. Sadegh","family":"Riazi","sequence":"first","affiliation":[{"name":"University of California San Diego, La Jolla, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Samragh","sequence":"additional","affiliation":[{"name":"University of California San Diego, La Jolla, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farinaz","family":"Koushanfar","sequence":"additional","affiliation":[{"name":"University of California San Diego, La Jolla, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).","author":"Erkin Zekeriya","unstructured":"Zekeriya Erkin , Michael Beye , Thijs Veugen , and Reginald L. Lagendijk . 2011. Efficiently computing private recommendations . In IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). Zekeriya Erkin, Michael Beye, Thijs Veugen, and Reginald L. Lagendijk. 2011. Efficiently computing private recommendations. In IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)."},{"key":"e_1_2_1_2_1","volume-title":"International Conference on Information Security and Cryptology. Springer.","author":"Sadeghi Ahmad-Reza","year":"2009","unstructured":"Ahmad-Reza Sadeghi , Thomas Schneider , and Immo Wehrenberg . 2009 . Efficient privacy-preserving face recognition . In International Conference on Information Security and Cryptology. Springer. Ahmad-Reza Sadeghi, Thomas Schneider, and Immo Wehrenberg. 2009. Efficient privacy-preserving face recognition. In International Conference on Information Security and Cryptology. Springer."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1854229.1854270"},{"key":"e_1_2_1_4_1","unstructured":"https:\/\/help.yahoo.com\/kb\/account\/SLN27925.html. 2017. Yahoo Security Notice. (2017).  https:\/\/help.yahoo.com\/kb\/account\/SLN27925.html. 2017. Yahoo Security Notice. (2017)."},{"key":"e_1_2_1_5_1","unstructured":"https:\/\/www.cnet.com\/news\/google-fired-engineer-for-privacy-breach\/. 2017. Google fires engineer for privacy breach. (2017).  https:\/\/www.cnet.com\/news\/google-fired-engineer-for-privacy-breach\/. 2017. Google fires engineer for privacy breach. (2017)."},{"key":"e_1_2_1_6_1","volume-title":"International IC-Taipei Conference Proceedings.","author":"Peng Midas","year":"2001","unstructured":"Midas Peng and Sherri Azgomi . 2001 . Content-Addressable memory (CAM) and its network applications . In International IC-Taipei Conference Proceedings. Midas Peng and Sherri Azgomi. 2001. Content-Addressable memory (CAM) and its network applications. In International IC-Taipei Conference Proceedings."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934583.2934595"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the Design, Automation and Test in Europe Conference and Exhibition.","author":"Rahimi Abbas","unstructured":"Abbas Rahimi , Amirali Ghofrani , Kwang-Ting Cheng , Luca Benini , and Rajesh K. Gupta . 2015. Approximate associative memristive memory for energy-efficient GPUs . In Proceedings of the Design, Automation and Test in Europe Conference and Exhibition. Abbas Rahimi, Amirali Ghofrani, Kwang-Ting Cheng, Luca Benini, and Rajesh K. Gupta. 2015. Approximate associative memristive memory for energy-efficient GPUs. In Proceedings of the Design, Automation and Test in Europe Conference and Exhibition."},{"key":"e_1_2_1_9_1","volume-title":"Resistive CAM Acceleration for Tunable Approximate Computing","author":"Imani Mohsen","year":"2016","unstructured":"Mohsen Imani , Daniel Peroni , Abbas Rahimi , and Tajana Rosing . 2016. Resistive CAM Acceleration for Tunable Approximate Computing . IEEE Transactions on Emerging Topics in Computing ( 2016 ). Mohsen Imani, Daniel Peroni, Abbas Rahimi, and Tajana Rosing. 2016. Resistive CAM Acceleration for Tunable Approximate Computing. IEEE Transactions on Emerging Topics in Computing (2016)."},{"key":"e_1_2_1_10_1","volume-title":"Looknn: Neural network with no multiplication. In Design, Automation 8 Test in Europe Conference 8 Exhibition (DATE)","author":"Razlighi Mohammad Samragh","year":"2017","unstructured":"Mohammad Samragh Razlighi , Mohsen Imani , Farinaz Koushanfar , and Tajana Rosing . 2017 . Looknn: Neural network with no multiplication. In Design, Automation 8 Test in Europe Conference 8 Exhibition (DATE) . IEEE. Mohammad Samragh Razlighi, Mohsen Imani, Farinaz Koushanfar, and Tajana Rosing. 2017. Looknn: Neural network with no multiplication. In Design, Automation 8 Test in Europe Conference 8 Exhibition (DATE). IEEE."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2008.79"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2744808"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_13"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813651"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559862"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544870"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2011.6123149"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_2_1_19_1","volume-title":"Sub-linear privacy-preserving search with untrusted server and semi-honest parties. arXiv preprint arXiv:1612.01835","author":"Riazi M. Sadegh","year":"2016","unstructured":"M. Sadegh Riazi , Beidi Chen , Anshumali Shrivastava , Dan Wallach , and Farinaz Koushanfar . 2016. Sub-linear privacy-preserving search with untrusted server and semi-honest parties. arXiv preprint arXiv:1612.01835 ( 2016 ). M. Sadegh Riazi, Beidi Chen, Anshumali Shrivastava, Dan Wallach, and Farinaz Koushanfar. 2016. Sub-linear privacy-preserving search with untrusted server and semi-honest parties. arXiv preprint arXiv:1612.01835 (2016)."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the IEEE Custom Integrated Circuits Conference.","author":"Kasai Gen","year":"2003","unstructured":"Gen Kasai , Yukihiro Takarabe , Koji Furumi , and Masato Yoneda . 2003 . 200MHz\/200MSPS 3.2 W at 1.5 V Vdd, 9.4 Mbits ternary CAM with new charge injection match detect circuits and bank selection scheme . In Proceedings of the IEEE Custom Integrated Circuits Conference. Gen Kasai, Yukihiro Takarabe, Koji Furumi, and Masato Yoneda. 2003. 200MHz\/200MSPS 3.2 W at 1.5 V Vdd, 9.4 Mbits ternary CAM with new charge injection match detect circuits and bank selection scheme. In Proceedings of the IEEE Custom Integrated Circuits Conference."},{"key":"e_1_2_1_21_1","volume-title":"A ternary content-addressable memory (TCAM) based on 4T static storage and including a current-race sensing scheme","author":"Arsovski Igor","year":"2003","unstructured":"Igor Arsovski , Trevis Chandler , and Ali Sheikholeslami . 2003. A ternary content-addressable memory (TCAM) based on 4T static storage and including a current-race sensing scheme . IEEE Journal of Solid-State Circuits ( 2003 ). Igor Arsovski, Trevis Chandler, and Ali Sheikholeslami. 2003. A ternary content-addressable memory (TCAM) based on 4T static storage and including a current-race sensing scheme. IEEE Journal of Solid-State Circuits (2003)."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1143\/APEX.2.023004"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1811099.1811056"},{"key":"e_1_2_1_24_1","volume-title":"IEEE Journal of Solid-State Circuits","author":"Li Jing","year":"2014","unstructured":"Jing Li , Robert K. Montoye , Masatoshi Ishii , and Leland Chang . 2014. 1 Mb 0.41 m 2T-2R cell nonvolatile TCAM with two-bit encoding and clocked self-referenced sensing. IEEE Journal of Solid-State Circuits ( 2014 ). Jing Li, Robert K. Montoye, Masatoshi Ishii, and Leland Chang. 2014. 1 Mb 0.41 m 2T-2R cell nonvolatile TCAM with two-bit encoding and clocked self-referenced sensing. IEEE Journal of Solid-State Circuits (2014)."},{"key":"e_1_2_1_25_1","volume-title":"Symposium on VLSI Circuits (VLSIC).","author":"Matsunaga Shoun","year":"2011","unstructured":"Shoun Matsunaga , Akira Katsumata , Masanori Natsui , Shunsuke Fukami , Tetsuo Endoh , Hideo Ohno , and Takahiro Hanyu . 2011 . Fully parallel 6T-2MTJ nonvolatile TCAM with single-transistor-based self match-line discharge control . In Symposium on VLSI Circuits (VLSIC). Shoun Matsunaga, Akira Katsumata, Masanori Natsui, Shunsuke Fukami, Tetsuo Endoh, Hideo Ohno, and Takahiro Hanyu. 2011. Fully parallel 6T-2MTJ nonvolatile TCAM with single-transistor-based self match-line discharge control. In Symposium on VLSI Circuits (VLSIC)."},{"key":"e_1_2_1_26_1","volume-title":"Mining of massive datasets","author":"Leskovec Jure","unstructured":"Jure Leskovec , Anand Rajaraman , and Jeffrey David Ullman . 2014. Mining of massive datasets . Cambridge University Press . Jure Leskovec, Anand Rajaraman, and Jeffrey David Ullman. 2014. Mining of massive datasets. Cambridge University Press."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_2_1_28_1","volume-title":"Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future, IEEE.","author":"Anthony","unstructured":"Anthony J. McAuley and Paul Francis. 1993. Fast routing table lookup using CAMs . In Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future, IEEE. Anthony J. McAuley and Paul Francis. 1993. Fast routing table lookup using CAMs. In Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future, IEEE."},{"key":"e_1_2_1_30_1","unstructured":"http:\/\/pdf1.alldatasheet.com\/datasheet-pdf\/view\/150649\/MUSIC\/MU9C4320L.html. 2017. MU9C4320L datasheet. (2017).  http:\/\/pdf1.alldatasheet.com\/datasheet-pdf\/view\/150649\/MUSIC\/MU9C4320L.html. 2017. MU9C4320L datasheet. (2017)."},{"key":"e_1_2_1_31_1","unstructured":"http:\/\/www.datasheetcatalog.com\/datasheets_pdf\/M\/U\/9\/C\/MU9C1480B-50TAC.shtml. 2017. MU9C1480B datasheet. (2017).  http:\/\/www.datasheetcatalog.com\/datasheets_pdf\/M\/U\/9\/C\/MU9C1480B-50TAC.shtml. 2017. MU9C1480B datasheet. (2017)."},{"key":"e_1_2_1_32_1","volume-title":"Gender differences in mate selection: Evidence from a speed dating experiment. The Quarterly Journal of Economics","author":"Fisman Raymond","year":"2006","unstructured":"Raymond Fisman , Sheena S. Iyengar , Emir Kamenica , and Itamar Simonson . 2006. Gender differences in mate selection: Evidence from a speed dating experiment. The Quarterly Journal of Economics ( 2006 ). Raymond Fisman, Sheena S. Iyengar, Emir Kamenica, and Itamar Simonson. 2006. Gender differences in mate selection: Evidence from a speed dating experiment. The Quarterly Journal of Economics (2006)."},{"key":"e_1_2_1_33_1","volume-title":"Wakin","author":"Cand\u00e8s Emmanuel J.","year":"2008","unstructured":"Emmanuel J. Cand\u00e8s and Michael B . Wakin . 2008 . An introduction to compressive sampling. IEEE Signal Processing Magazine ( 2008). Emmanuel J. Cand\u00e8s and Michael B. Wakin. 2008. An introduction to compressive sampling. IEEE Signal Processing Magazine (2008)."},{"key":"e_1_2_1_34_1","unstructured":"http:\/\/csrc.nist.gov\/publications\/nistpubs\/800-57\/sp800-57_part1_rev3_general.pdf. 2017. National institute of standards and technology. (2017).  http:\/\/csrc.nist.gov\/publications\/nistpubs\/800-57\/sp800-57_part1_rev3_general.pdf. 2017. National institute of standards and technology. (2017)."},{"key":"e_1_2_1_35_1","volume-title":"Thomas","author":"Cover Thomas M.","year":"2012","unstructured":"Thomas M. Cover and Joy A . Thomas . 2012 . Elements of information theory. John Wiley 8 Sons. Thomas M. Cover and Joy A. Thomas. 2012. Elements of information theory. John Wiley 8 Sons."},{"key":"e_1_2_1_36_1","volume-title":"Encyclopedia of Machine Learning","author":"Keogh Eamonn","unstructured":"Eamonn Keogh and Abdullah Mueen . 2011. Curse of dimensionality . In Encyclopedia of Machine Learning . Springer . Eamonn Keogh and Abdullah Mueen. 2011. Curse of dimensionality. In Encyclopedia of Machine Learning. Springer."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1791834.1791836"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.30"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062305"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2016.7495590"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3126547","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3126547","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3126547","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:05:02Z","timestamp":1750273502000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3126547"}},"subtitle":["Secure Content-Addressable Memory for Approximate Search"],"short-title":[],"issued":{"date-parts":[[2017,9,27]]},"references-count":39,"journal-issue":{"issue":"5s","published-print":{"date-parts":[[2017,10,31]]}},"alternative-id":["10.1145\/3126547"],"URL":"https:\/\/doi.org\/10.1145\/3126547","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,27]]},"assertion":[{"value":"2017-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-09-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}