10-10【张一炜】五教5206 吴文俊数学重点实验室组合图论系列讲座之174

发布者:万宏艳发布时间:2021-10-09浏览次数:13


报告题目:Private proximity retrieval and its connections with covering designs


报告人:张一炜,山东大学


时间: 10月10号下午16:30-17:30,地点:五教5206


摘要:Proximity retrieval allows a user to search into a database for files which are similar to his or her sample file. By the trivial approach of uploading the exact sample, the user's privacy is completely revealed. In order to partly protect the privacy of the user, we introduce a private proximity retrieval scheme, when the database is stored on several servers. We analyze the tradeoff between the privacy level and the number of servers required. We will show that such schemes are closely related to covering designs. In some sense, the schemes are covering designs with additional “covering” constraints. This is a joint work with Tuvi Etzion and Eitan Yaakobi.