Please use this identifier to cite or link to this item:
|標題:||A NOVEL PRIVATE INFORMATION RETRIEVAL SCHEME WITH FAIR PRIVACY IN THE USER SIDE AND THE SERVER SIDE||作者:||Chen, C.H.
|關鍵字:||Users' privacy protection;Private information retrieval (PIR);Fair;privacy||Project:||International Journal of Innovative Computing Information and Control||期刊/報告no：:||International Journal of Innovative Computing Information and Control, Volume 5, Issue 3, Page(s) 801-810.||摘要:||
Kushilevitz et al. proposed a private information retrieval (PIR) scheme based on the quadratic-residue assumption and using only one server. It conquers the problem of PIR schemes using k servers: the big overheads for managing these servers. In this paper, we point out that Kushilevitz's PIR scheme will let the user get much more information than he should get in one query of the database. In addition, a novel PIR scheme with fair privacy in the user side and the server side is proposed. It protects not only the privacy of the users like previous PIR schemes, but also protects the privacy of the server to avoid revealing the information more than the user queried. The security analyses of the proposed scheme are included in this paper. The security of the proposed scheme is based on the hard Problem of factoring a big number multiplied by two big primes. Finally, we give some comparisons between our scheme and other PIR schemes.
|Appears in Collections:||資訊科學與工程學系所|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.