课题基金 / 基金详情

EAGER: Efficient Privacy-aware Document Search in the Cloud

EAGER: Efficient Privacy-aware Document Search in the Cloud
EAGER:云端高效的隐私意识文档搜索
批准号:
2040146
负责人:
Tao Yang
金额:
$21.75万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2020
资助国家:
美国
项目状态:
已结题
起止时间:
2020-08-01 至 2023-01-31

项目摘要

项目成果

Tao Yang的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
As sensitive information is increasingly stored in the cloud, privacy protection is a critical factor for users to adopt cloud-based information services such as document search. A cloud server can observe the client-initiated query processing flow, extract statistical patterns, and reason about client's data. As a result, the risk of leakage-abuse attacks exists when searching in the cloud. The main challenge to perform privacy-preserving search is that index visitation can reveal sensitive data patterns, and computation involved in advanced ranking can further expose private feature information. On the other hand, hiding index and feature information through full encryption prevents the server from performing effective scoring and result comparison. This project explores the challenging open problems in algorithmic indexing and ranking solutions for privacy-aware cloud data search. The approach emphasizes an evaluation-driven design where search performance is assessed in multiple aspects of relevance, efficiency, and privacy for practical system deployment. The project integrates the proposed research with an educational plan including undergraduate and graduate students' involvement in the research project, instructional material development, and outreach activities.The exploratory research addresses two fundamental research challenges: (1) privacy-aware indexing and runtime support in matching documents for a given query with an emphasis to curtail statistical text information leakage while providing efficient and private access of ranking features; (2) privacy-aware end-to-end top-K ranking with a multi-stage scheme which seeks a combination of linear and nonlinear methods such as neural nets and learning ensembles. The design goal is to minimize the leakage of document features and characteristics while still accomplishing a reasonable response time and competitive relevance. The evaluation process will use public datasets to assess the effectiveness of the developed techniques for practical system deployment. This research effort will open the door for bridging the gap between privacy and advanced information retrieval in searching large encrypted datasets. The developed research results will be made public for research and industry communities.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
期刊论文(4)
专著(0)
科研奖励(0)
会议论文
DOI: 10.1145/3340531.3412035
发表时间: 2020-10
期刊: Proceedings of the 29th ACM International Conference on Information & Knowledge Management
影响因子: --
作者: [Jinjin Shao;Shiyu Ji;A. O. Glova;Yifan Qiao;Tao Yang;T. Sherwood]
通讯作者: Jinjin Shao;Shiyu Ji;A. O. Glova;Yifan Qiao;Tao Yang;T. Sherwood
Compact Token Representations with Contextual Quantization for Efficient Document Re-ranking
具有上下文量化的紧凑令牌表示,可实现高效的文档重新排序
DOI: 10.18653/v1/2022.acl-long.51
发表时间: 2022
期刊: Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics
影响因子: --
作者: [Yang, Yingrui, Qiao, Yifan, Yang, Tao]
通讯作者: Yang, Tao
DOI: 10.1145/3488560.3498495
发表时间: 2021-03
期刊: Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining
影响因子: --
作者: [Yingrui Yang;Yifan Qiao;Jinjin Shao;Xifeng Yan;Tao Yang]
通讯作者: Yingrui Yang;Yifan Qiao;Jinjin Shao;Xifeng Yan;Tao Yang
Window Navigation with Adaptive Probing for Executing BlockMax WAND
用于执行 BlockMax WAND 的带有自适应探测的窗口导航
DOI: 10.1145/3404835.3463109
发表时间: 2021
期刊: Proc. of 2021 ACM SIGIR conference on Research and Development in Information Retrieval (SIGIR 2021
影响因子: --
作者: [Shao, J., Qiao, Y., Ji, S., Yang, T.]
通讯作者: Yang, T.
III: Small: Efficiency Optimization for Neural Document Ranking with Compact Representations
III: Small: Low-Cost Deduplication and Search for Versioned Datasets
III: Small: Parallel Similarity Comparison and Duplicate Detection with Incremental Computing
SOFTWARE:"Cluster-based Runtime Support for Data-Intensive Online Applications"
海外基金