M. Sadegh Riazi
Skip Abstract Section
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.
- 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).Google Scholar
- Ahmad-Reza Sadeghi, Thomas Schneider, and Immo Wehrenberg. 2009. Efficient privacy-preserving face recognition. In International Conference on Information Security and Cryptology. Springer. Google ScholarDigital Library
- Mauro Barni, Tiziano Bianchi, Dario Catalano, Mario Di Raimondo, Ruggero Donida Labati, Pierluigi Failla, Dario Fiore, Riccardo Lazzeretti, Vincenzo Piuri, Fabio Scotti, et al. 2010. Privacy-preserving fingercode authentication. In Proceedings of the ACM Workshop on Multimedia and Security. Google ScholarDigital Library
- https://help.yahoo.com/kb/account/SLN27925.html. 2017. Yahoo Security Notice. (2017).Google Scholar
- https://www.cnet.com/news/google-fired-engineer-for-privacy-breach/. 2017. Google fires engineer for privacy breach. (2017).Google Scholar
- Midas Peng and Sherri Azgomi. 2001. Content-Addressable memory (CAM) and its network applications. In International IC-Taipei Conference Proceedings.Google Scholar
- Mohsen Imani, Yeseong Kim, Abbas Rahimi, and Tajana Rosing. 2016. ACAM: Approximate computing based on adaptive associative memory with online learning. In International Symposium on Low Power Electronics and Design (ISLPED). Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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).Google Scholar
- 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. Google ScholarDigital Library
- Yinian Qi and Mikhail J. Atallah. 2008. Efficient privacy-preserving k-nearest neighbor search. In IEEE International Conference on Distributed Computing Systems (ICDCS). Google ScholarDigital Library
- Ebrahim M. Songhori, Siam U. Hussain, Ahmad-Reza Sadeghi, and Farinaz Koushanfar. 2015. Compacting privacy-preserving k-nearest neighbor search using logic synthesis. In Proceedings of the Design Automation Conference (DAC). Google ScholarDigital Library
- Alexandra Boldyreva, Nathan Chenette, Younho Lee, and Adam O’neill. 2009. Order-preserving symmetric encryption. In Annual International Conference on the Theory and Applications of Cryptographic Techniques.Google ScholarCross Ref
- Muhammad Naveed, Seny Kamara, and Charles V. Wright. 2015. Inference attacks on property-preserving encrypted databases. In ACM SIGSAC Conference on Computer and Communications Security. Google ScholarDigital Library
- Wai Kit Wong, David Wai-lok Cheung, Ben Kao, and Nikos Mamoulis. 2009. Secure knn computation on encrypted databases. In Proceedings of the ACM SIGMOD International Conference on Management of data. Google ScholarDigital Library
- Bin Yao, Feifei Li, and Xiaokui Xiao. 2013. Secure nearest neighbor revisited. In IEEE International Conference on Data Engineering (ICDE). Google ScholarDigital Library
- Petros Boufounos and Shantanu Rane. 2011. Secure binary embeddings for privacy preserving nearest neighbors. In IEEE International Workshop on Information Forensics and Security (WIFS). Google ScholarDigital Library
- Piotr Indyk and Rajeev Motwani. 1998. Approximate nearest neighbors: Towards removing the curse of dimensionality. In STOC. Google ScholarDigital Library
- 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).Google Scholar
- 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.Google Scholar
- 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).Google Scholar
- Shoun Matsunaga, Kimiyuki Hiyama, Atsushi Matsumoto, Shoji Ikeda, Haruhiro Hasegawa, Katsuya Miura, Jun Hayakawa, Tetsuo Endoh, Hideo Ohno, and Takahiro Hanyu. 2009. Standby-power-free compact ternary content-addressable memory cell chip using magnetic tunnel junction devices. Applied Physics Express (2009).Google ScholarCross Ref
- Ashish Goel and Pankaj Gupta. 2010. Small subset queries and bloom filters using ternary associative memories, with applications. ACM SIGMETRICS Performance Evaluation Review (2010). Google ScholarDigital Library
- 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).Google Scholar
- 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).Google Scholar
- Jure Leskovec, Anand Rajaraman, and Jeffrey David Ullman. 2014. Mining of massive datasets. Cambridge University Press. Google ScholarDigital Library
- Piotr Indyk and Rajeev Motwani. 1998. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the ACM Symposium on Theory of Computing. Google ScholarDigital Library
- 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.Google Scholar
- Shyamkumar Thoziyoor, Naveen Muralimanohar, Jung Ho Ahn, and Norman P. Jouppi. CACTI: An integrated cache and memory access time, cycle time, area, leakage, and dynamic power model. Technical Report HPL-2008-20.Google Scholar
- http://pdf1.alldatasheet.com/datasheet-pdf/view/150649/MUSIC/MU9C4320L.html. 2017. MU9C4320L datasheet. (2017).Google Scholar
- http://www.datasheetcatalog.com/datasheets_pdf/M/U/9/C/MU9C1480B-50TAC.shtml. 2017. MU9C1480B datasheet. (2017).Google Scholar
- 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).Google Scholar
- Emmanuel J. Candès and Michael B. Wakin. 2008. An introduction to compressive sampling. IEEE Signal Processing Magazine (2008).Google Scholar
- http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf. 2017. National institute of standards and technology. (2017).Google Scholar
- Thomas M. Cover and Joy A. Thomas. 2012. Elements of information theory. John Wiley 8 Sons.Google Scholar
- Eamonn Keogh and Abdullah Mueen. 2011. Curse of dimensionality. In Encyclopedia of Machine Learning. Springer.Google Scholar
- Cynthia Dwork. 2008. Differential privacy: A survey of results. In International Conference on Theory and Applications of Models of Computation. Springer. Google ScholarDigital Library
- Vasilis Pappas, Fernando Krell, Binh Vo, Vladimir Kolesnikov, Tal Malkin, Seung Geol Choi, Wesley George, Angelos Keromytis, and Steve Bellovin. 2014. Blind seer: A scalable private dbms. In IEEE Symposium on Security and Privacy (S&P). Google ScholarDigital Library
- M. Sadegh Riazi, Ebrahim M. Songhori, and Farinaz Koushanfar. 2017. PriSearch: Efficient search on private data. In Proceedings of the 54th Annual Design Automation Conference. ACM. Google ScholarDigital Library
- M. Sadegh Riazi, Neeraj K. R. Dantu, L. N. Vinay Gattu, and Farinaz Koushanfar. 2016. GenMatch: Secure DNA compatibility testing. In IEEE International Symposium on Hardware Oriented Security and Trust (HOST).Google ScholarCross Ref
Index Terms
- CAMsure: Secure Content-Addressable Memory for Approximate Search
Recommendations
A Novel Cross-point MRAM with Diode Selector Capable of High-Density, High-Speed, and Low-Power In-Memory Computation
NANOARCH '18: Proceedings of the 14th IEEE/ACM International Symposium on Nanoscale ArchitecturesIn-Memory Computation (IMC), which is capable of reducing the power consumption and bandwidth requirement resulting from the data transfer between the processing and memory units, has been considered as a promising technology to break the von-Neumann ...
Determination of Priority in Associative Memories
Abstract The problem of resolving multiple responses to a search in an associative or content-addressable memory is considered. A resolver is presented whose maximum delay is proportional to the logarithm of the size of the memory.
Implementation of a Standby-Power-Free CAM Based on Complementary Ferroelectric-Capacitor Logic
ASP-DAC '07: Proceedings of the 2007 Asia and South Pacific Design Automation ConferenceA complementary ferroelectric-capacitor (CFC) logic-circuit style is proposed for a compact and standby-power-free content-addressable memory (CAM). Since the use of the CFC logic circuit in designing a CAM cell makes it possible to merge both logic and ...
Comments