Skip to main content
SpringerLink
Log in
Book cover

Advanced Research in Data Privacy pp 407–419Cite as

A Survey on the Use of Combinatorial Configurations for Anonymous Database Search

  • Chapter
  • First Online:

Part of the book series: Studies in Computational Intelligence ((SCI,volume 567))

Abstract

The peer-to-peer user-private information retrieval (P2P UPIR) protocol is an anonymous database search protocol in which the users collaborate in order to protect their privacy. This collaboration can be modelled by a combinatorial configuration. This chapter surveys currently available results on how to choose combinatorial configurations for P2P UPIR.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ostrovsky, R., Skeith III W.E.: A survey of single-database private information retrieval: techniques and applications. In: Proceedings of the 10th International Conference on Practice and Theory in Public-Key Cryptography, pp.393411. Springer, Berlin (2007)

    Google Scholar 

  2. Domingo-Ferrer, J., Bras-Amorós, M.: Peer-to-Peer Private Information Retrieval. Lecture Notes in Computer Science, Privacy in Statistical Databases (2008)

    Google Scholar 

  3. Domingo-Ferrer, J., Bras-Amorós, M., Wu, Q., Manjón, J.: User-private information retrieval based on a peer-to-peer community. Data Knowl. Eng. 68(11), 1237–1252 (2009)

    Article  Google Scholar 

  4. Gropp H.: Configurations. In: 2nd Edn. Colbourn, C.J., Dinitz, J.H. (eds.) The CRC Handbook Of Combinatorial Designs, pp. 352–355. CRC Press, Boca Raton, FL, (2007)

    Google Scholar 

  5. Grünbaum, B.: Configurations of Points and Lines. American Mathematical Society, Providence, RI (2009)

    MATH  Google Scholar 

  6. Pisanski, T., Servatius, B.: Configurations from a Graphical Viewpoint. Birkäuser Advanced Texts, Basler Lehrbücher, Springer (2013)

    Book  MATH  Google Scholar 

  7. Stokes, K., Bras-Amorós, M.: Combinatorial structures for an anonymous data search protocol. In: Proceedings of Workshop on Computational Security, CRM (UAB), Barcelona, November 28 Dec 2 (2011)

    Google Scholar 

  8. Stokes, K., Bras-Amorós, M.: Associating a numerical semigroup to the triangle-free configurations. Adv. Math. Commun. 5(2), 351–371 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  9. Stokes, K.: Combinatorial structures for anonymous database search. Doctoral thesis. Universitat Rovira i Virgili (2011)

    Google Scholar 

  10. Stokes, K., Bras-Amorós, M.: On query self-submission in peer-to-peer user-private information retrieval. In: Proceedings of the 4th International Workshop on Privacy and Anonymity in the Information Society (PAIS’11), Uppsala, Sweden (2010)

    Google Scholar 

  11. Spink, A., Wolfram, D., Jansen, M.B.J., Saracevic, T.: Searching the web: the public and their queries. J. Am. Soc. Inform. Sci. Technol. 52(3), 226–234 (2001)

    Article  Google Scholar 

  12. Teevan, J., Adar, E., Jones, R., Potts, M.: History repeats itself: repeat queries in Yahoo’s query logs. In: Proceedings of the 29th Annual ACM Conference on Research and Development in Information Retrieval (SIGIR’06). pp. 703–704. (2005)

    Google Scholar 

  13. Samarati, P.: Protecting respondents’ identities in microdata release. IEEE Trans. Knowl. Data Eng. 13(6), 1010–1027 (2001)

    Article  Google Scholar 

  14. Samarati, P., Sweeney, L.: Protecting privacy when disclosing information: \(k\)-anonymity and its enforcement through generalization and suppression. SRI International Technical Report (1998)

    Google Scholar 

  15. Sweeney, L.: \(k\)-anonymity: a model for protecting privacy. Int. J. of Unc., Fuzz. Knowl. Based Syst. 10(5), 557–570 (2002)

    Google Scholar 

  16. Stokes, K., Farrás, O.: Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search. Des. Codes Crypt. 71(3), 503–524 (2014)

    Article  MATH  Google Scholar 

  17. Swanson, C.M., Stinson, D.R.: Extended combinatorial constructions for peer-to-peer user-private information retrieval. Adv. Math. Commun. 6, 479–497 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  18. Domingo-Ferrer, J., González-Nicolás, Ú.: Rational behavior in peer-to-peer profile obfuscation for anonymous keyword search: the multi-hop scenario. Inf. Sci. 200, 123–134 (2012)

    Article  Google Scholar 

  19. Reiter, M., Rubin, A.: Crowds: anonymity for web transactions. ACM Trans. Inform. Syst. Sec. 1(1), 66–92 (1998)

    Article  Google Scholar 

  20. Bras-Amorós, M., Domingo-Ferrer, J. Stokes, K.: Configuraciones combinatóricas y recuperación privada de información por pares. In: Congreso de la Real Sociedad Matemática Española-RSME 2009, Oviedo, Spain (2009)

    Google Scholar 

  21. Bras-Amorós, M., Stokes, K.: The semigroup of combinatorial configurations. Semigroup Forum, vol. 84, pp. 9196. Springer, New York (2012)

    Google Scholar 

  22. Bras-Amorós, M., Stokes, K, Greferath, M.: Problems related to combinatorial configurations with applications to P2P-user private information retrieval. In: Proceedings of The 19th International Symposium on Mathematics with Applications, pp. 15681577. (2010)

    Google Scholar 

  23. Bras-Amorós, M., Stokes, K.: On the existence of combinatorial configurations. In: Proceedings of the 3rd International Workshop on Optimal Networks Topologies (IWONT), June 9–11 2010, Barcelona, pp. 145–168. (2010)

    Google Scholar 

  24. Stokes, K., Bras-Amorós, M.: Optimal configurations for peer-to-peer user-private information retrieval. Comput. Math. Appl. 59(4), 1568–1577 (2010)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

The authors acknowledge financial support from the Spanish MEC projects ARES (CONSOLIDER INGENIO 2010 CSD2007-00004) and ICWT (TIN2012-32757).

Author information

Authors and Affiliations

  1. Universitat Oberta de Catalunya, Barcelona, Spain

    Klara Stokes

  2. Universitat Rovira i Virgili, Tarragona, Spain

    Maria Bras-Amorós

Authors
  1. Klara Stokes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maria Bras-Amorós
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Klara Stokes .

Editor information

Editors and Affiliations

  1. Department of Information and Communications Engineering, Universitat Autonoma de Barcelona, Catalonia, Spain

    Guillermo Navarro-Arribas

  2. Consejo Superior de Investigaciones Científicas Campus de la UAB, Institut d'Investigació en Intel·ligència Artificial, Catalonia, Spain

    Vicenç Torra

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Stokes, K., Bras-Amorós, M. (2015). A Survey on the Use of Combinatorial Configurations for Anonymous Database Search. In: Navarro-Arribas, G., Torra, V. (eds) Advanced Research in Data Privacy. Studies in Computational Intelligence, vol 567. Springer, Cham. https://doi.org/10.1007/978-3-319-09885-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09885-2_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09884-5

  • Online ISBN: 978-3-319-09885-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation