Optimal configurations for peer-to-peer user-private information retrieval
2010 (English)In: Computers and Mathematics with Applications, ISSN 0898-1221, Vol. 59, no 4, 1568-1577 p.Article in journal (Refereed) Published
User-private information retrieval systems should protect the user’s anonymity when performing queries against a database, or they should limit the servers capacity of profiling users. Peer-to-peer user-private information retrieval (P2P UPIR) supplies a practical solution: the users in a group help each other in doing their queries, thereby preserving their privacy without any need of the database to cooperate. One way to implement the P2P UPIR uses combinatoric configurations to administrate the keys needed for the private communication between the peers.
This article is devoted to the choice of the configuration in this system. First of all we characterize the optimal configurations for the P2P UPIR and see the relationship with the projective planes as described in finite geometry. Then we give a very efficient construction of such optimal configurations, i.e. finite projective planes. We finally check that the involved graphs are Ramanujan graphs, giving an additional justification of the optimality of the constructed configurations.
Place, publisher, year, edition, pages
Elsevier, 2010. Vol. 59, no 4, 1568-1577 p.
combinatorial design, configuration, projective plane, anonymous database search
Computer Science Information Systems Discrete Mathematics
IdentifiersURN: urn:nbn:se:liu:diva-91467DOI: 10.1016/j.camwa.2010.01.003OAI: oai:DiVA.org:liu-91467DiVA: diva2:618044