Secure Top-k Inner Product Retrieval

被引:12
|
作者
Zhang, Zhilin [1 ]
Wang, Ke [1 ]
Lin, Chen [2 ]
Lin, Weipeng [1 ]
机构
[1] Simon Fraser Univ, Burnaby, BC, Canada
[2] Xiamen Univ, Xiamen, Peoples R China
基金
加拿大自然科学与工程研究理事会;
关键词
Top-k Retrieval; Inner Product Encryption; Known Plaintext Attack; COMPUTATION;
D O I
10.1145/3269206.3271791
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:77 / 86
页数:10
相关论文
共 50 条
  • [41] Secure Top-k Query Processing in Unattended Tiered Sensor Networks
    Zhang, Rui
    Shi, Jing
    Zhang, Yanchao
    Huang, Xiaoxia
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2014, 63 (09) : 4681 - 4693
  • [42] Efficient and Secure Top-k Query Processing on Hybrid Sensed Data
    Wu, Haiqin
    Wang, Liangmin
    MOBILE INFORMATION SYSTEMS, 2016, 2016
  • [43] A Top-k Concast Service for Multiple Tiny Data Retrieval in NDN
    Liao, Zhuhua
    Zhang, Jian
    Teng, Zengde
    Liu, Yizhi
    Yi, Aiping
    PROCEEDINGS OF 2018 1ST IEEE INTERNATIONAL CONFERENCE ON HOT INFORMATION-CENTRIC NETWORKING (HOTICN 2018), 2018, : 73 - 79
  • [44] Top-K Query Retrieval of Combinations with Sum-of-Subsets Ranking
    Majumder, Subhashis
    Sanyal, Biswajit
    Gupta, Prosenjit
    Sinha, Soumik
    Pande, Shiladitya
    Hon, Wing-Kai
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2014), 2014, 8881 : 490 - 505
  • [45] New space/time tradeoffs for top-k document retrieval on sequences
    Navarro, Gonzalo
    Thankachan, Sharma V.
    THEORETICAL COMPUTER SCIENCE, 2014, 542 : 83 - 97
  • [46] Space-Efficient Framework for Top-k String Retrieval Problems
    Hon, Wing-Kai
    Shah, Rahul
    Vitter, Jeffrey Scott
    2009 50TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE: FOCS 2009, PROCEEDINGS, 2009, : 713 - 722
  • [47] Relationship-Based Top-K Concept Retrieval for Ontology Search
    Butt, Anila Sahar
    Haller, Armin
    Xie, Lexing
    KNOWLEDGE ENGINEERING AND KNOWLEDGE MANAGEMENT, EKAW 2014, 2014, 8876 : 485 - 502
  • [48] Density-Based Top-K Spatial Textual Clusters Retrieval
    Wu, Dingming
    Keles, Ilkcan
    Wu, Song
    Zhou, Hao
    Saltenis, Simonas
    Jensen, Christian S.
    Lu, Kezhong
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (11) : 5263 - 5277
  • [49] Subspace Similarity Search Using the Ideas of Ranking and Top-k Retrieval
    Bernecker, Thomas
    Emrich, Tobias
    Graf, Franz
    Kriegel, Hans-Peter
    Kroeger, Peer
    Renz, Matthias
    Schubert, Erich
    Zimek, Arthur
    2010 IEEE 26TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOPS (ICDE 2010), 2010, : 4 - 9
  • [50] Top-k relevant semantic place retrieval on spatiotemporal RDF data
    Dingming Wu
    Hao Zhou
    Jieming Shi
    Nikos Mamoulis
    The VLDB Journal, 2020, 29 : 893 - 917