Optimal configurations for peer-to-peer user-private information retrieval

Computers and Mathematics with Applications

Volumn 59, Issue 4, 2010, Pages 1568-1577

  Stokes, Klara ^a   Bras Amorós, Maria ^a  

^a UNIVERSITAT ROVIRA I VIRGILI   (Spain)

Author keywords

Combinatoric configurations; Expander graphs; Private information retrieval; Projective plane; Ramanujan graphs

Indexed keywords

EFFICIENT CONSTRUCTION; EXPANDER GRAPHS; FINITE GEOMETRY; FINITE PROJECTIVE PLANE; OPTIMAL CONFIGURATIONS; OPTIMALITY; PEER TO PEER; PRACTICAL SOLUTIONS; PRIVATE COMMUNICATION; PRIVATE INFORMATION RETRIEVAL; PROJECTIVE PLANES; RAMANUJAN GRAPHS;

DATABASE SYSTEMS; INFORMATION RETRIEVAL SYSTEMS; INFORMATION SERVICES; OPTIMIZATION;

INFORMATION RETRIEVAL;

EID: 75349093213     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2010.01.003     Document Type: Article

References (26)

1. Domingo-Ferrer J., and Bras-Amorós M. Peer-to-peer private information retrieval. In: Domingo-Ferrer J., and Saygin Y. (Eds). Privacy in Statistical Databases. Lecture Notes in Computer Science vol. 5262 (2008), Springer 315-323
2. B. Chor, O. Goldreich, E. Kushilevitz, M. Sudan, Private information retrieval, in: IEEE Symposium on Foundations of Computer Science, FOCS, 1995, pp. 41-50
3. Chor B., Goldreich O., Kushilevitz E., and Sudan M. Private information retrieval. Journal of the ACM 45 (1998) 965-981
4. Chor B., and Gilboa N. Computationally private information retrieval. Proceedings of the 29th Annual ACM Symposium on Theory of Computing. STOC'97, El Paso, Texas, May 4-6, 1997 (1997), ACM Press, New York 304-313
5. Kushilevitz E., and Ostrovsky R. Replication is not needed: Single database, computationally-private information retrieval. Proc. of the 38th Annual IEEE Symposium on Foundations of Computer Science (1997) 364-373
6. C. Aguilar-Melchor, P. Gaborit, Single-database private information retrieval protocols: Overview, usability and trends, Research Report, 2007
7. W. Gasarch, A. Yerukhimovich, Computational inexpensive PIR, 2006. http://www.cs.umd.edu/arkady/papers/pirlattice.pdf
8. Rennhard M., and Plattner B. Practical anonymity for the masses with MorphMix. Financial Cryptography (2004) 233-250
9. Freedman M.J., and Morris R. Tarzan: A peer-to-peer anonymizing network layer. ACM Conference on Computer and Communications Security. CCS02 (2002), ACM Press, Washington, DC, USA 193-206
10. Aguilar-Melchor C., and Deswarte Y. Trustable relays for anonymous communication. Transactions on Data Privacy 2 2 (2009) 101-130
11. The Tor project, inc. Tor: Overview. http://torproject.org/overview.html.en
12. Domingo-Ferrer J., Solanas A., and Castellà-Roca J. h (k)-private information retrieval from privacy-uncooperative queryable databases. Online Information Review 33 4 (2009) 720-744
13. Howe D.C., and Nissenbaum H. Trackmenot: Resisting surveillance in web search. In: Kerr I., Lucock C., and Steeves V. (Eds). Lessons from the Identity Trail: Privacy, Anonymity and Identity in a Networked Society (2009), Oxford University Press, Oxford, UK. http://www.mrl.nyu.edu/dhowe/trackmenot/ Software downloadable from: http://www.mrl.nyu.edu/dhowe/trackmenot/
14. Domingo-Ferrer J., Bras-Amorós M., Wu Q., and Manjón J. User-private information retrieval based on a peer-to-peer community. Data & Knowledge Engineering 68 11 (2009) 1237-1252
15. Gropp H. Configurations. In: Colbourn C.J., and Dinitz J.H. (Eds). Handbook of Combinatorial Designs (2007), Chapman and Hall/CRC, Kenneth H. Rosen 353-355
16. Colbourn C.J., and Dinitz J.H. Handbook of Combinatorial Designs (2007), Chapman and Hall/CRC, Kenneth H. Rosen
17. M. Bras-Amorós, K. Stokes, On the existence of combinatorial configurations, arXiv:0907.4230v2
18. Storme L. Finite geometry. In: Colbourn C.J., and Dinitz J.H. (Eds). Handbook of Combinatorial Designs (2007), Chapman and Hall/CRC, Kenneth H. Rosen 702-729
19. M. Bras-Amorós, K. Stokes, M. Greferath, Using (0,1)-geometries for collusion-free P2P user private information retrieval, in: 19th International Symposium on Mathematical Theory of Networks and Systems, Budapest, 2010
20. Hall M. Projective planes. Transactions of the American Mathematical Society 54 2 (1943) 229-277
21. Hall M. The Theory of Groups (1959), The Macmillan Co., New York, NY
22. Weibel C. Survey of non-desarguesian planes. Notices of the AMS 54 10 (2007)
23. Chung F.R.K. Spectral Graph Theory (1997), American Mathematical Society Press, Providence, RI
24. Lubotzky A., Phillips R., and Sarnak P. Ramanujan graphs. Combinatorica 8 3 (1988) 261-277
25. Morgenstern M. Existence and explicit constructions of q+1 regular Ramanujan graphs for every prime power q. Journal of Combinatorial Theory. Series B 62 1 (1994) 44-62
26. Høholdt T., and Janwa H. Optimal bipartite Ramanujan graphs from balanced incomplete block designs: Their characterizations and applications to expander/ LDPC codes. In: Bras-Amorós M., and Høholdt T. (Eds). Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, AAECC-18. Lecture Notes in Computer Science vol. 5527 (2009), Springer 53-64