{"title":"保护隐私的顶k时空关键词偏好查询","authors":"Xuan Zhao, Jia Yu","doi":"10.1016/j.csi.2024.103900","DOIUrl":null,"url":null,"abstract":"<div><p>With the rapid advancement of location-based services and mobile devices, spatial keyword query attracts increasing attention. In this paper, we focus on a new query type known as top-<span><math><mi>k</mi></math></span> spatio-temporal keyword preference query. This kind of query considers both the spatial object itself and other spatial objects in the neighborhood to return <span><math><mi>k</mi></math></span> spatial objects with the highest score. These <span><math><mi>k</mi></math></span> spatial objects satisfy spatial and temporal constraints, while their scores are determined by the keyword similarity of the neighboring spatial objects. We propose a scheme to enable privacy-preserving top-<span><math><mi>k</mi></math></span> spatio-temporal keyword preference queries. To effectively represent temporal information, we employ time vectors to denote time periods, allowing us to assess whether the data satisfies temporal constraints based on the inner product of time vectors. Furthermore, we adopt a two-step strategy to execute the query. The first step is to find all Points of Interest (POIs) that meet the spatial and temporal constraints. The second step is to calculate the score of each POI and return the top-<span><math><mi>k</mi></math></span> POIs with the highest score. To enhance query efficiency, we build a tree index structure that can achieve sub-linear query complexity. Additionally, we utilize <em>EASPE</em> algorithm to encrypt both the index and the query, ensuring privacy-preserving capabilities. Security analysis proves that our scheme satisfies CQA2-security. At the same time, experimental evaluation validates the query performance of our scheme.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"92 ","pages":"Article 103900"},"PeriodicalIF":4.1000,"publicationDate":"2024-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Privacy-preserving top-k spatio-temporal keyword preference query\",\"authors\":\"Xuan Zhao, Jia Yu\",\"doi\":\"10.1016/j.csi.2024.103900\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>With the rapid advancement of location-based services and mobile devices, spatial keyword query attracts increasing attention. In this paper, we focus on a new query type known as top-<span><math><mi>k</mi></math></span> spatio-temporal keyword preference query. This kind of query considers both the spatial object itself and other spatial objects in the neighborhood to return <span><math><mi>k</mi></math></span> spatial objects with the highest score. These <span><math><mi>k</mi></math></span> spatial objects satisfy spatial and temporal constraints, while their scores are determined by the keyword similarity of the neighboring spatial objects. We propose a scheme to enable privacy-preserving top-<span><math><mi>k</mi></math></span> spatio-temporal keyword preference queries. To effectively represent temporal information, we employ time vectors to denote time periods, allowing us to assess whether the data satisfies temporal constraints based on the inner product of time vectors. Furthermore, we adopt a two-step strategy to execute the query. The first step is to find all Points of Interest (POIs) that meet the spatial and temporal constraints. The second step is to calculate the score of each POI and return the top-<span><math><mi>k</mi></math></span> POIs with the highest score. To enhance query efficiency, we build a tree index structure that can achieve sub-linear query complexity. Additionally, we utilize <em>EASPE</em> algorithm to encrypt both the index and the query, ensuring privacy-preserving capabilities. Security analysis proves that our scheme satisfies CQA2-security. At the same time, experimental evaluation validates the query performance of our scheme.</p></div>\",\"PeriodicalId\":50635,\"journal\":{\"name\":\"Computer Standards & Interfaces\",\"volume\":\"92 \",\"pages\":\"Article 103900\"},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2024-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Standards & Interfaces\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0920548924000692\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Standards & Interfaces","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0920548924000692","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
摘要
随着基于位置的服务和移动设备的快速发展,空间关键词查询越来越受到关注。本文主要研究一种新的查询类型,即顶 k 时空关键词偏好查询。这种查询同时考虑空间对象本身和邻域中的其他空间对象,返回得分最高的 k 个空间对象。这 k 个空间对象满足空间和时间限制,而它们的分数则由邻近空间对象的关键词相似度决定。我们提出了一种方案来实现保护隐私的顶 k 时空关键词偏好查询。为了有效地表示时间信息,我们使用时间向量来表示时间段,这样我们就可以根据时间向量的内积来评估数据是否满足时间约束。此外,我们采用两步策略来执行查询。第一步是找到满足空间和时间约束条件的所有兴趣点(POI)。第二步是计算每个兴趣点的得分,并返回得分最高的前 k 个兴趣点。为了提高查询效率,我们建立了一个树形索引结构,可以实现亚线性查询复杂度。此外,我们利用 EASPE 算法对索引和查询进行加密,确保隐私保护能力。安全分析证明,我们的方案满足 CQA2- 安全性要求。同时,实验评估也验证了我们方案的查询性能。
With the rapid advancement of location-based services and mobile devices, spatial keyword query attracts increasing attention. In this paper, we focus on a new query type known as top- spatio-temporal keyword preference query. This kind of query considers both the spatial object itself and other spatial objects in the neighborhood to return spatial objects with the highest score. These spatial objects satisfy spatial and temporal constraints, while their scores are determined by the keyword similarity of the neighboring spatial objects. We propose a scheme to enable privacy-preserving top- spatio-temporal keyword preference queries. To effectively represent temporal information, we employ time vectors to denote time periods, allowing us to assess whether the data satisfies temporal constraints based on the inner product of time vectors. Furthermore, we adopt a two-step strategy to execute the query. The first step is to find all Points of Interest (POIs) that meet the spatial and temporal constraints. The second step is to calculate the score of each POI and return the top- POIs with the highest score. To enhance query efficiency, we build a tree index structure that can achieve sub-linear query complexity. Additionally, we utilize EASPE algorithm to encrypt both the index and the query, ensuring privacy-preserving capabilities. Security analysis proves that our scheme satisfies CQA2-security. At the same time, experimental evaluation validates the query performance of our scheme.
期刊介绍:
The quality of software, well-defined interfaces (hardware and software), the process of digitalisation, and accepted standards in these fields are essential for building and exploiting complex computing, communication, multimedia and measuring systems. Standards can simplify the design and construction of individual hardware and software components and help to ensure satisfactory interworking.
Computer Standards & Interfaces is an international journal dealing specifically with these topics.
The journal
• Provides information about activities and progress on the definition of computer standards, software quality, interfaces and methods, at national, European and international levels
• Publishes critical comments on standards and standards activities
• Disseminates user''s experiences and case studies in the application and exploitation of established or emerging standards, interfaces and methods
• Offers a forum for discussion on actual projects, standards, interfaces and methods by recognised experts
• Stimulates relevant research by providing a specialised refereed medium.