liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimal configurations for peer-to-peer user-private information retrieval
Universitat Rovira i Virgili, Catalonia, Spain.
Universitat Rovira i Virgili, Catalonia, Spain.
2010 (English)In: Computers and Mathematics with Applications, ISSN 0898-1221, E-ISSN 1873-7668, Vol. 59, no 4, 1568-1577 p.Article in journal (Refereed) Published
Abstract [en]

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.
Keyword [en]
combinatorial design, configuration, projective plane, anonymous database search
National Category
Computer Science Information Systems Discrete Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-91467DOI: 10.1016/j.camwa.2010.01.003OAI: oai:DiVA.org:liu-91467DiVA: diva2:618044
Available from: 2013-04-25 Created: 2013-04-25 Last updated: 2017-12-06

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Stokes, Klara

Search in DiVA

By author/editor
Stokes, Klara
In the same journal
Computers and Mathematics with Applications
Computer ScienceInformation SystemsDiscrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 18 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf