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

DOI10.1016/j.camwa.2010.01.003zbMath1189.05169OpenAlexW2013023581WikidataQ57728700 ScholiaQ57728700MaRDI QIDQ980206

Maria Bras-Amorós, Klara Stokes

Publication date: 28 June 2010

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2010.01.003

zbMATH Keywords

projective planeexpander graphsprivate information retrievalRamanujan graphscombinatoric configurations

Mathematics Subject Classification ID

Applications of graph theory (05C90) Database theory (68P15) Network design and communication in computer systems (68M10) Combinatorial aspects of finite geometries (05B25) Authentication, digital signatures and secret sharing (94A62)

Related Items

Extended results on privacy against coalitions of users in user-private information retrieval protocols, Linear spaces and transversal designs: \(k\)-anonymous combinatorial configurations for anonymous database search notes, Improved user-private information retrieval via finite geometry, Multi-value private information retrieval with colluding databases via trace functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramanujan graphs
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• Private information retrieval
• Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes
• Projective Planes