PIRpeer: Distributed, Oblivious Keyword Search
msra
摘要
Weexaminetheproblemofobliviouskeywordsearching in a distributed setting. In this problem, a client con- tacts a server or set of distributed servers and makes a request for a piece of information, but without re- vealing to the server what information is sought. Nev- ertheless, the server returns the correct answer. This problem,calledthe Private Information Retrieval(PIR) problem,hasbeenextensivelystudiedinthecryptogra- phyliterature.Weconstructareal,distributedsystem, PIRpeer, comprised of search servers built upon PIR primitivestoachievepracticalkeywordsearchinginthe contextofkeywordsearchesforpeer-to-peerdistributed hash tables (DHTs) or the like. In particular, our sys- tem, combined with existing anonymity routing layers and strong-data anonymity DHT-like flle storage sys- tems, provides the last piece in an end-to-end anony- mous lookup and retrieval system.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络