Extended combinatorial constructions for peer-to-peer user-private information retrieval

DOI10.3934/AMC.2012.6.479MaRDI QIDQ394836zbMATH OpenOpenAlexFDO

Authors Colleen M. Swanson, D. R. Stinson

Publication date 28 January 2014

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1112.2762

zbMATH Keywords

anonymitycombinatorial designsuser-privacy

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Cryptography (94A60)

Abstract: We consider user-private information retrieval (UPIR), an interesting alternative to private information retrieval (PIR) introduced by Domingo-Ferrer et al. In UPIR, the database knows which records have been retrieved, but does not know the identity of the query issuer. The goal of UPIR is to disguise user profiles from the database. Domingo-Ferrer et al. focus on using a peer-to-peer community to construct a UPIR scheme, which we term P2P UPIR. In this paper, we establish a strengthened model for P2P UPIR and clarify the privacy goals of such schemes using standard terminology from the field of privacy research. In particular, we argue that any solution providing privacy against the database should attempt to minimize any corresponding loss of privacy against other users. We give an analysis of existing schemes, including a new attack by the database. Finally, we introduce and analyze two new protocols. Whereas previous work focuses on a special type of combinatorial design known as a configuration, our protocols make use of more general designs. This allows for flexibility in protocol set-up, allowing for a choice between having a dynamic scheme (in which users are permitted to enter and leave the system), or providing increased privacy against other users.

Recommendations

• Extended results on privacy against coalitions of users in user-private information retrieval protocols
• Optimal configurations for peer-to-peer user-private information retrieval
• Improved user-private information retrieval via finite geometry
• Universal service-providers for private information retrieval
• scientific article; zbMATH DE number 1754644

Cited in

(4)

• Improved user-private information retrieval via finite geometry
• Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search notes
• Extended results on privacy against coalitions of users in user-private information retrieval protocols
• Optimal configurations for peer-to-peer user-private information retrieval

This page was built for publication: Extended combinatorial constructions for peer-to-peer user-private information retrieval

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394836)