research-article

Open access

Secure Top-k Inner Product Retrieval

Authors:

Weipeng LinAuthors Info & Claims

CIKM '18: Proceedings of the 27th ACM International Conference on Information and Knowledge Management

Pages 77 - 86

https://doi.org/10.1145/3269206.3271791

Published: 17 October 2018 Publication History

Abstract

Secure top-k inner product retrieval allows the users to outsource encrypted data vectors to a cloud server and at some later time find the k vectors producing largest inner products giving an encrypted query vector. Existing solutions suffer poor performance raised by the client's filtering out top-k results. To enable the server-side filtering, we introduce an asymmetric inner product encryption AIPE that allows the server to compute inner products from encrypted data and query vectors. To solve AIPE's vulnerability under known plaintext attack, we present a packing approach IP Packing that allows the server to obtain the entire set of inner products between the query and all data vectors but prevents the server from associating any data vector with its inner product. Based on IP Packing, we present our solution SKIP to secure top-k inner product retrieval that further speeds up retrieval process using sequential scan. Experiments on real recommendation datasets demonstrate that our protocols outperform alternatives by several orders of magnitude.

References

[1]

Shweta Agrawal, Benoit Libert, and Damien Stehlé. 2016. Fully secure functional encryption for inner products, from standard assumptions. In CRYPTO . Springer, 333--362.

Digital Library

[2]

Allison Bishop, Abhishek Jain, and Lucas Kowalczyk. 2015. Function-hiding inner product encryption. In Asiacrypt. Springer, 470--491.

Digital Library

[3]

Alexandra Boldyreva, Nathan Chenette, and Adam O'Neill. 2011. Order-preserving encryption revisited: improved security analysis and alternative solutions. In CRYPTO. Springer, 578--595.

Digital Library

[4]

Emmanuel Bresson, Dario Catalano, and David Pointcheval. 2003. A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications. In Asiacrypt. Springer, 37--54.

[5]

Gu Chunsheng and Gu Jixing. 2014. Known-plaintext attack on secure kNN computation on encrypted databases. Security and Communication Networks, Vol. 7, 12 (2014), 2432--2441.

[6]

Pratish Datta, Ratna Dutta, and Sourav Mukhopadhyay. 2016. Functional encryption for inner product with full function privacy. PKC. Springer, 164--195.

Digital Library

[7]

Liu Fang, Wee Keong Ng, and Wei Zhang. 2014. Encrypted scalar product protocol for outsourced data mining. In CLOUD. IEEE, 336--343.

Digital Library

[8]

Ran Gilad-Bachrach, Nathan Dowlin, Kim Laine, Kristin Lauter, Michael Naehrig, and John Wernsing. 2016. Cryptonets: applying neural networks to encrypted data with high throughput and accuracy. In ICML . 201--210.

Digital Library

[9]

Bart Goethals, Sven Laur, Helger Lipmaa, and Taneli Mielik"ainen. 2004. On private scalar product computation for privacy-preserving data mining. In International Conference on Information Security and Cryptology. Springer, 104--120.

Digital Library

[10]

Manish Kesarwani, Akshar Kaul, Prasad Naldurg, Sikhar Patranabis, Gagandeep Singh, Sameep Mehta, and Debdeep Mukhopadhyay. 2018. Efficient secure k-nearest neighbours over encrypted data. In EDBT .

[11]

Hyeong-Il Kim, Hyeong-Jin Kim, and Jae-Woo Chang. 2017. A secure kNN query processing algorithm using homomorphic encryption on outsourced database. Data & Knowledge Engineering (2017).

[12]

Sam Kim, Kevin Lewi, Avradip Mandal, Hart William Montgomery, Arnab Roy, and David J Wu. 2016. Function-hiding inner product encryption is practical. IACR Cryptology ePrint Archive, Vol. 2016 (2016), 440.

[13]

Hui Li, Tsz Nam Chan, Man Lung Yiu, and Nikos Mamoulis. 2017. FEXIPRO: fast and exact inner product retrieval in recommender systems. In SIGMOD. ACM, 835--850.

Digital Library

[14]

Weipeng Lin, Ke Wang, Zhilin Zhang, and Hong Chen. 2017. Revisiting security risks of asymmetric scalar product preserving encryption and its variants. In ICDCS. IEEE, 1116--1125.

[15]

Xuying Meng, Suhang Wang, Kai Shu, Jundong Li, Bo Chen, Huan Liu, and Yujun Zhang. 2018. Towards privacy preserving social recommendation under personalized privacy settings. World Wide Web (2018), 1--29.

[16]

Sikhar Patranabis and Debdeep Mukhopadhyay. 2017. Lightweight symmetric-key hidden vector encryption without pairings. Cryptology ePrint Archive, Report 2017/796. (2017). https://eprint.iacr.org/2017/796.

[17]

Parikshit Ram and Alexander G Gray. 2012. Maximum inner-product search using cone trees. In SIGKDD. ACM, 931--939.

Digital Library

[18]

Zihao Shan, Kui Ren, Marina Blanton, and Cong Wang. 2017. Practical secure computation outsourcing: a survey. Comput. Surveys, Vol. 51 (2017).

Digital Library

[19]

Anshumali Shrivastava and Ping Li. 2014. Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS). In Advances in Neural Information Processing Systems. 2321--2329.

Digital Library

[20]

Sen Su, Yiping Teng, Xiang Cheng, Ke Xiao, Guoliang Li, and JunLiang Chen. 2015. Privacy-preserving top-k spatial keyword queries in untrusted cloud environments. IEEE Transactions on Services Computing (2015).

[21]

Christina Teflioudi, Rainer Gemulla, and Olga Mykytiuk. 2015. Lemp: Fast retrieval of large entries in a matrix product. In SIGMOD. ACM, 107--122.

Digital Library

[22]

Wai Kit Wong, David Wai-lok Cheung, Ben Kao, and Nikos Mamoulis. 2009. Secure knn computation on encrypted databases. In SIGMOD. ACM, 139--152.

Digital Library

[23]

Yunchen Wu, Ke Wang, Zhilin Zhang, Weipeng Lin, Hong Chen, and Cuiping Li. 2018. Privacy preserving group nearest neighbor search. EDBT. 277--288.

Cited By

Wang QLuo QWang Y(2024)Relational Algorithms for Top-k Query EvaluationProceedings of the ACM on Management of Data10.1145/36549712:3(1-27)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654971
Wang NZhou WWang JGuo YFu JLiu J(2024)Secure and Efficient Similarity Retrieval in Cloud Computing Based on Homomorphic EncryptionIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.335090919(2454-2469)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3350909
Zhang ZBao HLu RHuang CLi B(2024)KMSQ: Efficient and Privacy-Preserving Keyword-Oriented Multidimensional Similarity Query in eHealthcareIEEE Internet of Things Journal10.1109/JIOT.2023.331733411:5(7918-7934)Online publication date: 1-Mar-2024
https://doi.org/10.1109/JIOT.2023.3317334
Show More Cited By

Index Terms

Secure Top-k Inner Product Retrieval
1. Information systems
  1. Information retrieval
    1. Retrieval models and ranking
      1. Top-k retrieval in databases
    2. Retrieval tasks and goals
      1. Document filtering
      2. Recommender systems
2. Security and privacy
  1. Database and storage security
    1. Management and querying of encrypted data

Recommendations

Fully Secure Unbounded Zero Inner Product Encryption with Short Ciphertexts and Keys
Provable and Practical Security
Abstract
Inner product encryption (IPE) generates a secret key for a predicate vector and encrypts a message under an attribute vector such that recovery of the message from a ciphertext requires the vectors to satisfy a linear relation. In the case of ...
Spatial Encryption Revisited: From Delegatable Multiple Inner Product Encryption and More
Computer Security – ESORICS 2022
Abstract
Spatial encryption (SE), which involves encryption and decryption with affine/vector objects, was introduced by Boneh and Hamburg at Asiacrypt 2008. Since its introduction, SE has been shown as a versatile and elegant tool for implementing many ...
Inner product encryption from Middle-Product Learning With Errors
Abstract
Inner product encryption (IPE) is an important research area of functional cryptosystems. It can improve user access control and fine-grained query, and has a wide range of applications in emerging fields such as cloud computing. ...
Highlights
- We construct an inner product encryption scheme with AD-IND-CPA-secure.
- We ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CIKM '18: Proceedings of the 27th ACM International Conference on Information and Knowledge Management

October 2018

2362 pages

ISBN:9781450360142

DOI:10.1145/3269206

General Chair:
Alfredo Cuzzocrea
University of Trieste, Italy
,
Program Chairs:
James Allan
University of Massachusetts, USA
,
Norman Paton
University of Manchester, United Kingdom
,
Divesh Srivastava
AT&T Labs Research, USA
,
Rakesh Agrawal
Data Insights Lab, USA
,
Andrei Broder
Google Research, USA
,
Mohammed Zaki
Rensselaer Polytechnic Institute, USA
,
Selcuk Candan
Arizona State University, USA
,
Alexandros Labrinidis
University of Pittsburgh, USA
,
Assaf Schuster
Technion, Israel
,
Haixun Wang
Google Research, USA

Copyright © 2018 Owner/Author.

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 October 2018

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CIKM '18

Sponsor:

CIKM '18: The 27th ACM International Conference on Information and Knowledge Management

October 22 - 26, 2018

Torino, Italy

Acceptance Rates

CIKM '18 Paper Acceptance Rate 147 of 826 submissions, 18%;

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
769
Total Downloads

Downloads (Last 12 months)95
Downloads (Last 6 weeks)26

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wang QLuo QWang Y(2024)Relational Algorithms for Top-k Query EvaluationProceedings of the ACM on Management of Data10.1145/36549712:3(1-27)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654971
Wang NZhou WWang JGuo YFu JLiu J(2024)Secure and Efficient Similarity Retrieval in Cloud Computing Based on Homomorphic EncryptionIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.335090919(2454-2469)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3350909
Zhang ZBao HLu RHuang CLi B(2024)KMSQ: Efficient and Privacy-Preserving Keyword-Oriented Multidimensional Similarity Query in eHealthcareIEEE Internet of Things Journal10.1109/JIOT.2023.331733411:5(7918-7934)Online publication date: 1-Mar-2024
https://doi.org/10.1109/JIOT.2023.3317334
Zheng YLu RZhu HZhang SGuan YShao JWang FLi H(2023)SetRkNN: Efficient and Privacy-Preserving Set Reverse kNN Query in CloudIEEE Transactions on Information Forensics and Security10.1109/TIFS.2022.323178518(888-903)Online publication date: 2023
https://doi.org/10.1109/TIFS.2022.3231785
Yin BZeng WWei X(2023)Efficient crowdsourced best objects finding via superiority probability based ordering for decision support systemsExpert Systems with Applications: An International Journal10.1016/j.eswa.2023.119893223:COnline publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1016/j.eswa.2023.119893
Yee NMa FGeorgakopoulos-Soares I(2023)Machine Intelligence in Pancreatic CancerHandbook of Cancer and Immunology10.1007/978-3-030-80962-1_317-1(1-29)Online publication date: 3-Nov-2023
https://doi.org/10.1007/978-3-030-80962-1_317-1
Teng YJiang DSun MZhao LXu LFan C(2022)Privacy-Preserving Top-k Spatio-Textual Similarity Join2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)10.1109/TrustCom56396.2022.00102(718-726)Online publication date: Dec-2022
https://doi.org/10.1109/TrustCom56396.2022.00102
Zheng YLu RGuan YShao JZhu H(2022)Achieving Efficient and Privacy-Preserving Set Containment Search Over Encrypted DataIEEE Transactions on Services Computing10.1109/TSC.2021.306524015:5(2604-2618)Online publication date: 1-Sep-2022
https://doi.org/10.1109/TSC.2021.3065240
Zheng YLu RGuan YZhang SShao JZhu H(2022)Efficient and Privacy-Preserving Similarity Query With Access Control in eHealthcareIEEE Transactions on Information Forensics and Security10.1109/TIFS.2022.315239517(880-893)Online publication date: 2022
https://doi.org/10.1109/TIFS.2022.3152395
Zheng YLu RGuan YShao JZhu H(2022)Efficient and Privacy-Preserving Similarity Range Query Over Encrypted Time Series DataIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2021.306161119:4(2501-2516)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TDSC.2021.3061611
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents