EncSIM: An Encrypted Similarity Search Service for Distributed High-dimensional Datasets

被引:0
|
作者
Liu, Xiaoning [1 ]
Yuan, Xingliang [1 ,2 ]
Wang, Cong [1 ,2 ]
机构
[1] City Univ Hong Kong, Hong Kong, Hong Kong, Peoples R China
[2] City Univ Hong Kong, Shenzhen Res Inst, Shenzhen 518057, Peoples R China
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Similarity-oriented services serve as a foundation in a wide range of data analytic applications such as machine learning, target advertising, and real-time decisions. Both industry and academia strive for efficient and scalable similarity discovery and querying techniques to handle massive, complex data records in the real world. In addition to performance, data security and privacy become an indispensable criterion in the quality of service due to progressively increased data breaches. To address this serious concern, in this paper, we propose and implement "EncSIM", an encrypted and scalable similarity search service. The architecture of EncSIM enables parallel query processing over distributed, encrypted data records. To reduce client overhead, EncSIM resorts to a variant of the state-of-the-art similarity search algorithm, called all-pairs locality-sensitive hashing (LSH). We describe a novel encrypted index construction for EncSIM based on searchable encryption to guarantee the security of service while preserving performance benefits of all-pairs LSH. Moreover, EncSIM supports data record addition with a strong security notion. Intensive evaluations on a cluster of Redis demonstrate low client cost, linear scalability, and satisfied query performance of EncSIM.
引用
收藏
页数:10
相关论文
共 50 条
  • [1] A fast and scalable similarity search in high-dimensional image datasets
    Hanyf, Youssef
    Silkan, Hassan
    [J]. INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY, 2019, 59 (01) : 95 - 104
  • [2] A fast and scalable similarity search in high-dimensional image datasets
    Hanyf, Youssef
    Silkan, Hassan
    [J]. International Journal of Computer Applications in Technology, 2019, 59 (01): : 95 - 104
  • [3] Fast similarity search for high-dimensional dataset
    Wang, Quan
    You, Suya
    [J]. ISM 2006: EIGHTH IEEE INTERNATIONAL SYMPOSIUM ON MULTIMEDIA, PROCEEDINGS, 2006, : 799 - +
  • [4] A Privacy Preserving Similarity Search Scheme over Encrypted High-Dimensional Data for Multiple Data Owners
    Guo, Cheng
    Tian, Pengxu
    Jie, Yingmo
    Tang, Xinyu
    [J]. CLOUD COMPUTING AND SECURITY, PT II, 2018, 11064 : 484 - 495
  • [5] High-Dimensional Similarity Search for Scalable Data Science
    Echihabi, Karima
    Zoumpatianos, Kostas
    Palpanas, Themis
    [J]. 2021 IEEE 37TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2021), 2021, : 2369 - 2372
  • [6] Clustering for approximate similarity search in high-dimensional spaces
    Li, C
    Chang, E
    Garcia-Molina, H
    Wiederhold, G
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2002, 14 (04) : 792 - 808
  • [7] Memory Vectors for Similarity Search in High-Dimensional Spaces
    Iscen, Ahmet
    Furon, Teddy
    Gripon, Vincent
    Rabbat, Michael
    Jegou, Herve
    [J]. IEEE TRANSACTIONS ON BIG DATA, 2018, 4 (01) : 65 - 77
  • [8] An adaptive index structure for high-dimensional similarity search
    Wu, P
    Manjunath, BS
    Chandrasekaran, S
    [J]. ADVANCES IN MUTLIMEDIA INFORMATION PROCESSING - PCM 2001, PROCEEDINGS, 2001, 2195 : 71 - 77
  • [9] What's Wrong with High-Dimensional Similarity Search?
    Blott, Stephen
    Weber, Roger
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2008, 1 (01): : 3 - 3
  • [10] Distributed high-dimensional similarity search approach for large-scale wireless sensor networks
    Hu, Haifeng
    He, Jiefang
    Wu, Jianshen
    Wang, Kun
    Zhuang, Wei
    [J]. INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2017, 13 (03):