pith. sign in

arxiv: 1907.02518 · v1 · pith:OBZUCRZWnew · submitted 2019-07-03 · 💻 cs.NI · cs.CR

Location Privacy in Cognitive Radios with Multi-Server Private Information Retrieval

Mohamed Grissa , Attila A. Yavuz , Bechir Hamdaoui This is my paper

Pith reviewed 2026-05-25 09:23 UTC · model grok-4.3

classification 💻 cs.NI cs.CR
keywords cognitive radio networkslocation privacymulti-server PIRspectrum databasessecondary usersprimary usersinformation-theoretic privacy
0
0 comments X

The pith

Multi-server PIR achieves information-theoretic location privacy for both SUs and PUs in database-driven CRNs by exploiting FCC-mandated synchronized databases.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that database-driven cognitive radio networks already operate multiple synchronized spectrum databases under FCC rules, and that this setup can be used directly as the servers for multi-server private information retrieval protocols. Doing so yields information-theoretic privacy guarantees for secondary users querying spectrum availability and for primary users whose channel data is stored, while keeping communication and computation costs low enough for practical use. A sympathetic reader would care because earlier single-server PIR approaches imposed heavy overheads and provided only computational privacy that has proven breakable in some cases. The work demonstrates both analytical bounds and real deployments on cloud infrastructure to support these efficiency and privacy claims.

Core claim

By design, database-driven CRNs comprise multiple databases required by the FCC to synchronize their records; this architecture can be harnessed to run multi-server PIR protocols that deliver optimal privacy for both SUs and PUs without the overheads of single-server methods.

What carries the argument

Multi-server private information retrieval applied to the set of FCC-synchronized spectrum databases, which serve as the non-colluding servers.

If this is right

  • Secondary users obtain spectrum availability data without disclosing their locations to any individual database.
  • Primary user channel occupancy records stay hidden from queriers under information-theoretic security.
  • Communication and computation overheads drop substantially relative to single-server PIR protocols.
  • The same multi-server approach simultaneously protects both classes of users rather than only one.
  • Practical performance is confirmed through both closed-form analysis and live cloud-system tests.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The technique could be tested in other regulated multi-source data systems where synchronization is already mandated by policy.
  • If the non-collusion property holds only under current FCC rules, changes in regulation could require new PIR variants or additional safeguards.
  • Extensions might examine how the protocol behaves when the number of synchronized databases varies over time.

Load-bearing premise

The FCC synchronization requirement produces independent, non-colluding servers that can be used directly for multi-server PIR without extra coordination or trust assumptions.

What would settle it

Empirical evidence that any two of the synchronized databases exchange query information, or that measured query costs remain comparable to single-server PIR in cloud deployments, would falsify the central claim.

Figures

Figures reproduced from arXiv: 1907.02518 by Attila A. Yavuz, Bechir Hamdaoui, Mohamed Grissa.

Figure 1
Figure 1. Figure 1: Main steps of LP-Chor Algorithm Algorithm 1 Dβ ←LP-Chor (ℓ, r , b) SU 1: β ← InvIndex(lx , ly , C, ts) 2: Sets standard basis vector eβ ← −→1 β ∈ Z r 3: Generates ρ1, · · · , ρℓ−1 ∈R GF(2)r 4: ρℓ ← ρ1 ⊕ · · · ⊕ eβ 5: Sends ρi to DBi , for 1 ≤ i ≤ ℓ Each DB i 6: Receives ρi = ρi1 · · · ρir ∈ {0, 1} r 7: Ri ← L 1≤j≤r ρij=1 Dj , Dj is the j th block of D 8: Sends Ri to SU SU 9: Receives R1, · · · , Rℓ 10: Dβ … view at source ↗
Figure 2
Figure 2. Figure 2: Illustration of LP-Goldberg To determine the index β of the record that corre￾sponds to its location, SU starts by invoking the subroutine InvIndex(lx , ly , C, ts) then constructs the standard basis vec￾tor eβ ∈ F r as explained earlier. SU then uses (ℓ, t)-Shamir secret sharing to divide the vector eβ into ℓ independent shares (α1, , ρ1)· · · ,(αℓ, ρℓ) to ensure a t-private PIR protocol as in Definition … view at source ↗
Figure 3
Figure 3. Figure 3: RAID-PIR [39] security parameter, and expands each seed si into π−1 random chunks rndi [j], using P RG, each of size r ℓ as depicted in step 4 of Algorithm 4. The first chunk of query qi , denoted as fi , is computed to cancel out the π−1 other i th chunks rndi [j] of each of the other DBs, if applicable, and is obtained by xoring those π−1 chunks with the i th chunk of eβ. Thanks to the use of the P RG, S… view at source ↗
Figure 4
Figure 4. Figure 4: We also include the delay introduced by the existing [PITH_FULL_IMAGE:figures/full_fig_p009_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Computation Comparison We also compare the computational complexity experienced by each SU and DB separately in the different approaches as shown in Table III. We further illustrate this through experimentation and we plot the results in Fig. 5a, which shows that the proposed schemes incur lower overhead on the SU than the existing approaches. The same observation applies to the computation experienced by … view at source ↗
Figure 4
Figure 4. Figure 4: Query RTT of the different PIR-based approaches [PITH_FULL_IMAGE:figures/full_fig_p010_4.png] view at source ↗
Figure 8
Figure 8. Figure 8: Performance of LP-Goldberg in the presence of byzan￾tine DBs 1 2 3 4 5 6 0 1 2 3 4 5 [PITH_FULL_IMAGE:figures/full_fig_p011_8.png] view at source ↗
Figure 7
Figure 7. Figure 7: Impact of increasing query privacy level, [PITH_FULL_IMAGE:figures/full_fig_p011_7.png] view at source ↗
Figure 10
Figure 10. Figure 10: Query RTT for a moving SU We also demonstrate the benefit of relying on RAID-LP-Chor and partitioning the database content among DBs, instead of simply replicating it, on the DBs’ side for several values of the redundancy parameter π. As expected, π = 2 yields the best performance however it also offers the lowest level of resistance to collusion. Setting π to be equal to ℓ will is equivalent to the origi… view at source ↗
Figure 12
Figure 12. Figure 12: Comparison of the communication overhead of the [PITH_FULL_IMAGE:figures/full_fig_p012_12.png] view at source ↗
Figure 11
Figure 11. Figure 11: DB’s processing time under RAID-LP-Chor com￾pared to LP-Chor In terms of communication overhead, most of the ap￾proaches, including ours, have linear cost in the number of records in the database as shown in Table III. What really makes a difference between these schemes’ communication overheads is the associated constant factor which could be very large for some protocols. Based on our experiment and the… view at source ↗
read the original abstract

Spectrum database-based cognitive radio networks (CRNs) have become the de facto approach for enabling unlicensed secondary users (SUs) to identify spectrum vacancies in channels owned by licensed primary users (PUs). Despite its merits, the use of spectrum databases incurs privacy concerns for both SUs and PUs. Single-server private information retrieval (PIR) has been used as the main tool to address this problem. However, such techniques incur extremely large communication and computation overheads while offering only computational privacy. Besides, some of these PIR protocols have been broken. In this paper, we show that it is possible to achieve high efficiency and (information-theoretic) privacy for both PUs and SUs in database-driven CRN with multi-server PIR. Our key observation is that, by design, database-driven CRNs comprise multiple databases that are required, by the Federal Communications Commission, to synchronize their records. To the best of our knowledge, we are the first to exploit this observation to harness multi-server PIR technology to guarantee an optimal privacy for both SUs and PUs, thanks to the unique properties of database-driven CRN . We showed, analytically and empirically with deployments on actual cloud systems, that multi-server PIR is an ideal tool to provide efficient location privacy in database-driven CRN.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper claims that multi-server private information retrieval (PIR) can be applied directly to the multiple FCC-mandated spectrum databases in cognitive radio networks (CRNs), which synchronize their records by design, to deliver information-theoretic privacy for both primary users (PUs) and secondary users (SUs) at high efficiency. It contrasts this with single-server PIR approaches that incur large overheads and provide only computational privacy (some of which have been broken). The work provides analytical proofs of the efficiency and privacy properties together with empirical validation via deployments on actual cloud systems.

Significance. If the non-collusion premise holds, the result would be significant for practical deployment of strong privacy in database-driven CRNs by reusing existing synchronized infrastructure rather than adding new trusted parties. The combination of analytical derivations and reproducible cloud experiments is a strength that supports falsifiable efficiency claims.

major comments (2)
  1. [Abstract] Abstract (key observation paragraph): The claim that 'by design, database-driven CRNs comprise multiple databases that are required, by the Federal Communications Commission, to synchronize their records' directly supplies the independent non-colluding servers needed for information-theoretic multi-server PIR is unsupported. Synchronization enforces identical records but imposes no regulatory constraint on operator independence or collusion resistance; commercial database operators could share infrastructure or collude, reducing the protocol to single-server PIR and eliminating the information-theoretic guarantee contrasted with prior work.
  2. [Abstract] Abstract (privacy claim): The assertion of '(information-theoretic) privacy for both PUs and SUs' rests on the multi-server PIR construction inheriting the standard t-private threshold from the cited protocols, yet no section demonstrates that the FCC synchronization requirement satisfies the non-collusion threshold or provides a mechanism to enforce it.
minor comments (1)
  1. [Abstract] The abstract states 'we showed, analytically and empirically' but does not preview the specific metrics (communication/computation overhead, privacy leakage bounds) or the cloud platform used; adding these would improve clarity.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed and constructive comments. We respond point by point to the major comments and propose targeted revisions to clarify assumptions without altering the core technical contributions.

read point-by-point responses

  1. Referee: [Abstract] Abstract (key observation paragraph): The claim that 'by design, database-driven CRNs comprise multiple databases that are required, by the Federal Communications Commission, to synchronize their records' directly supplies the independent non-colluding servers needed for information-theoretic multi-server PIR is unsupported. Synchronization enforces identical records but imposes no regulatory constraint on operator independence or collusion resistance; commercial database operators could share infrastructure or collude, reducing the protocol to single-server PIR and eliminating the information-theoretic guarantee contrasted with prior work.

    Authors: We agree that the FCC synchronization mandate ensures record consistency across databases but does not by itself constitute a regulatory prohibition on collusion. The manuscript's key observation is that the existence of multiple synchronized databases (as required by FCC rules for database-driven CRNs) supplies the data replication needed for multi-server PIR; the non-collusion property is an operating assumption inherited from the standard multi-server PIR model. We will revise the abstract and add a short clarifying paragraph in the introduction to state this assumption explicitly and note that, in current FCC-approved deployments, the databases are administered by distinct entities. revision: yes

  2. Referee: [Abstract] Abstract (privacy claim): The assertion of '(information-theoretic) privacy for both PUs and SUs' rests on the multi-server PIR construction inheriting the standard t-private threshold from the cited protocols, yet no section demonstrates that the FCC synchronization requirement satisfies the non-collusion threshold or provides a mechanism to enforce it.

    Authors: The information-theoretic privacy guarantee is conditional on the t-non-collusion threshold of the underlying multi-server PIR protocol. The manuscript does not claim that FCC rules enforce non-collusion; it relies on the standard assumption used throughout the PIR literature. We will add an explicit discussion of this assumption (including its implications if violated) in a revised version of the abstract and in Section II, while retaining the analytical and empirical results that hold under the assumption. revision: yes

Circularity Check

0 steps flagged

No significant circularity; standard PIR applied to observed system feature

full rationale

The paper's derivation consists of identifying multiple FCC-synchronized databases as candidate servers for existing multi-server PIR protocols and then analyzing the resulting communication/computation costs. No equations reduce a claimed result to a fitted parameter or self-referential definition; the information-theoretic privacy guarantee is imported directly from the cited PIR literature rather than constructed inside the paper. The key observation about synchronization is presented as an external system property, not derived from the authors' own prior results or ansatzes. Self-citations, if present, are not load-bearing for the central claim. The construction is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The proposal rests on standard cryptographic assumptions for multi-server PIR and the regulatory fact of database synchronization; no new entities or fitted parameters are introduced in the abstract.

axioms (2)
  • domain assumption Multi-server PIR protocols achieve information-theoretic privacy when a threshold of servers do not collude.
    Standard assumption stated in the PIR literature referenced by the abstract.
  • domain assumption FCC-mandated synchronization produces servers that behave as independent, non-colluding parties for PIR purposes.
    Central observation in the abstract that enables the multi-server approach.

pith-pipeline@v0.9.0 · 5764 in / 1264 out tokens · 18442 ms · 2026-05-25T09:23:08.620717+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

55 extracted references · 55 canonical work pages

  1. [1]

    Cognitive radio: making sof tware radios more personal,

    J. Mitola and G. Q. Maguire, “Cognitive radio: making sof tware radios more personal,” IEEE personal comm. , vol. 6, no. 4, pp. 13–18, 1999

    work page 1999

  2. [2]

    Location privacy in database-driven cognitive radio networks: Attacks and cou ntermeasures,

    Z. Gao, H. Zhu, Y . Liu, M. Li, and Z. Cao, “Location privacy in database-driven cognitive radio networks: Attacks and cou ntermeasures,” in INFOCOM, 2013 Proceedings IEEE , 2013, pp. 2751–2759

    work page 2013

  3. [3]

    Protoco l to access white-space (paws) databases,

    V . Chen, S. Das, L. Zhu, J. Malyar, and P . McCann, “Protoco l to access white-space (paws) databases,” Tech. Rep., 2015

    work page 2015

  4. [4]

    Google spectrum database,

    “Google spectrum database,” https://www.google.com/ get/spectrumdatabase/ , accessed: 2017-04-14

    work page 2017

  5. [5]

    iconectiv white spaces database,

    “iconectiv white spaces database,” https://spectrum. iconectiv.com/main/home/ , accessed: 2017-04-14

    work page 2017

  6. [6]

    Microsoft white spaces database,

    “Microsoft white spaces database,” http://whitespace s.microsoftspectrum.com/ , accessed: 2017-04-14

    work page 2017

  7. [7]

    Protocol to acces s white-space (paws) databases: Use cases and requirements,

    A. Mancuso, S. Probasco, and B. Patil, “Protocol to acces s white-space (paws) databases: Use cases and requirements,” Tech. Rep., 2013

    work page 2013

  8. [8]

    Next generation of radio spectrum manageme nt: Licensed shared access for 5g,

    M. Massaro, “Next generation of radio spectrum manageme nt: Licensed shared access for 5g,” Telecommunications Policy, vol. 41, no. 5-6, pp. 422–433, 2017

    work page 2017

  9. [9]

    Location privac y in cognitive radio networks: A survey,

    M. Grissa, B. Hamdaoui, and A. A. Y avuz, “Location privac y in cognitive radio networks: A survey,” IEEE Communications Surveys Tutorials , vol. PP , no. 99, pp. 1–1, 2017

    work page 2017

  10. [10]

    Locat ion privacy preservation in collaborative spectrum sensing,

    S. Li, H. Zhu, Z. Gao, X. Guan, K. Xing, and X. Shen, “Locat ion privacy preservation in collaborative spectrum sensing,” in INFOCOM, 2012 Proceedings IEEE . IEEE, 2012, pp. 729–737

    work page 2012

  11. [11]

    Lpos: Location privacy for optimal sensing in cognitive radio networks,

    M. Grissa, A. A. Y avuz, and B. Hamdaoui, “Lpos: Location privacy for optimal sensing in cognitive radio networks,” in Global Communications Conference (GLOBECOM), 2015 IEEE . IEEE, 2015

    work page 2015

  12. [12]

    Privacy-preserving collaborati ve spectrum sensing with multipleservice providers,

    W. Wang and Q. Zhang, “Privacy-preserving collaborati ve spectrum sensing with multipleservice providers,” Wireless Communications, IEEE Transactions on, 2015

    work page 2015

  13. [13]

    An efficient tec hnique for protecting location privacy of cooperative spectrum sensi ng users,

    M. Grissa, A. A. Y avuz, and B. Hamdaoui, “An efficient tec hnique for protecting location privacy of cooperative spectrum sensi ng users,” in INFOCOM WKSHPS . IEEE, 2016

    work page 2016

  14. [14]

    Preserving the location privacy of secondary user s in cooperative spectrum sensing,

    ——, “Preserving the location privacy of secondary user s in cooperative spectrum sensing,” IEEE Transactions on Information F orensics and Security, vol. 12, no. 2, pp. 418–431, 2017

    work page 2017

  15. [15]

    Location priv acy preserving dynamic spectrum auction in cognitive radio net work,

    S. Liu, H. Zhu, R. Du, C. Chen, and X. Guan, “Location priv acy preserving dynamic spectrum auction in cognitive radio net work,” in ICDCS. IEEE, 2013, pp. 256–265

    work page 2013

  16. [16]

    A software-defi ned wireless networking enabled spectrum management architecture,

    W. Wang, Y . Chen, Q. Zhang, and T. Jiang, “A software-defi ned wireless networking enabled spectrum management architecture,” IEEE Commu- nications Magazine , vol. 54, no. 1, pp. 33–39, 2016

    work page 2016

  17. [17]

    Optimal str ategies for defending location inference attack in database-drive n crns,

    L. Zhang, C. Fang, Y . Li, H. Zhu, and M. Dong, “Optimal str ategies for defending location inference attack in database-drive n crns,” in Communications (ICC), 2015 IEEE International Conference on

    work page 2015

  18. [18]

    Leveraging p2p interactions f or efficient loca- tion privacy in database-driven dynamic spectrum access,

    E. Troja and S. Bakiras, “Leveraging p2p interactions f or efficient loca- tion privacy in database-driven dynamic spectrum access,” in Proceedings of the 22nd ACM SIGSPATIAL International Conference on Adva nces in Geographic Information Systems . ACM, 2014

    work page 2014

  19. [19]

    Efficient location privacy for moving clients in da tabase-driven dynamic spectrum access,

    ——, “Efficient location privacy for moving clients in da tabase-driven dynamic spectrum access,” in ICCCN. IEEE, 2015

    work page 2015

  20. [20]

    Achieving bilat eral utility maximization and location privacy preservation in databas e-driven cog- nitive radio networks,

    Z. Zhang, H. Zhang, S. He, and P . Cheng, “Achieving bilat eral utility maximization and location privacy preservation in databas e-driven cog- nitive radio networks,” in MASS. IEEE, 2015

    work page 2015

  21. [21]

    Location priva cy preser- vation in database-driven wireless cognitive networks thr ough encrypted probabilistic data structures,

    M. Grissa, A. A. Y avuz, and B. Hamdaoui, “Location priva cy preser- vation in database-driven wireless cognitive networks thr ough encrypted probabilistic data structures,” IEEE Transactions on Cognitive Commu- nications and Networking , vol. 3, no. 2, pp. 255–266, 2017

    work page 2017

  22. [22]

    Anonymous usage of locati on-based services through spatial and temporal cloaking,

    M. Gruteser and D. Grunwald, “Anonymous usage of locati on-based services through spatial and temporal cloaking,” in Proceedings of the 1st international conference on Mobile systems, applications and services . ACM, 2003, pp. 31–42

    work page 2003

  23. [23]

    Differential privacy: A survey of results,

    C. Dwork, “Differential privacy: A survey of results,” in International Conference on Theory and Applications of Models of Computat ion. Springer, 2008, pp. 1–19

    work page 2008

  24. [24]

    Pr ivate informa- tion retrieval,

    B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan, “Pr ivate informa- tion retrieval,” J. ACM, vol. 45, no. 6, pp. 965–981, Nov. 1998

    work page 1998

  25. [25]

    Anonymization of location data do es not work: A large-scale measurement study,

    H. Zang and J. Bolot, “Anonymization of location data do es not work: A large-scale measurement study,” in Proc. of the 17th annual int’l conf. on Mobile computing and networking . ACM, 2011, pp. 145–156

    work page 2011

  26. [26]

    Xpir: Private information retrieval for everyone,

    C. Aguilar-Melchor, J. Barrier, L. Fousse, and M.-O. Ki llijian, “Xpir: Private information retrieval for everyone,” Proceedings on Privacy Enhancing Technologies, vol. 2, pp. 155–174, 2016

    work page 2016

  27. [27]

    Efficient computationally p rivate information retrieval from anonymity or trapdoor groups,

    J. Trostle and A. Parrish, “Efficient computationally p rivate information retrieval from anonymity or trapdoor groups,” in International Confer- ence on Information Security . Springer, 2010, pp. 114–128

    work page 2010

  28. [28]

    White space database administrator group database-t o-database synchro- nization interoperability specification,

    “White space database administrator group database-t o-database synchro- nization interoperability specification,” FCC, Tech. Rep. , 2012

    work page 2012

  29. [29]

    TVWS database system requirements and test s,

    F. (2012), “TVWS database system requirements and test s,” https://transition.fcc.gov/oet/whitespace/guides/TVWS Database Tests4.doc

    work page 2012

  30. [30]

    A critique of fc c’s tv white space regulations,

    R. Ramjee, S. Roy, and K. Chintalapudi, “A critique of fc c’s tv white space regulations,” GetMobile: Mobile Computing and Communications , vol. 20, no. 1, pp. 20–25, 2016

    work page 2016

  31. [31]

    White space database administrators guide,

    “White space database administrators guide,” https://www.fcc.gov/general/white-space-database-administrators-guide , FCC, accessed: 2017-04-14

    work page 2017

  32. [32]

    Pir with compr essed queries and amortized query processing,

    S. Angel, H. Chen, K. Laine, and S. Setty, “Pir with compr essed queries and amortized query processing,” in 2018 IEEE Symposium on Security and Privacy (SP) . IEEE, 2018, pp. 962–979

    work page 2018

  33. [33]

    Improving the robustness of private info rmation retrieval,

    I. Goldberg, “Improving the robustness of private info rmation retrieval,” in Security and Privacy, 2007. IEEE Symp. on , pp. 131–148

    work page 2007

  34. [34]

    Report on post-quantum cryptography. nist ir 8105,

    L. Chen, S. Jordan, Y . Liu, D. Moody, R. Peralta, R. Perln er, and D. Smith-Tone, “Report on post-quantum cryptography. nist ir 8105,” 2016

    work page 2016

  35. [35]

    Single-database private info rmation retrieval with constant communication rate,

    C. Gentry and Z. Ramzan, “Single-database private info rmation retrieval with constant communication rate,” Automata, Languages and Program- ming, pp. 103–103, 2005

    work page 2005

  36. [36]

    Geni: A federated testbed for innovative network experiments,

    M. Berman, J. S. Chase, L. Landweber, A. Nakao, M. Ott, D. Raychaud- huri, R. Ricci, and I. Seskar, “Geni: A federated testbed for innovative network experiments,” Computer Networks , vol. 61, no. 0, pp. 5 – 23, 2014, special issue on Future Internet Testbeds Part I

    work page 2014

  37. [37]

    When the hammer meets the nail: Multi-server pir for database-driven crn with loc ation privacy assurance,

    M. Grissa, A. A. Y avuz, and B. Hamdaoui, “When the hammer meets the nail: Multi-server pir for database-driven crn with loc ation privacy assurance,” in 2017 IEEE Conference on Communications and Network Security (CNS) , Oct 2017, pp. 1–9

    work page 2017

  38. [38]

    Unleashing the power of multi-server pir for enabling private access to spectrum da tabases,

    M. Grissa, B. Hamdaoui, and A. A. Y avuz, “Unleashing the power of multi-server pir for enabling private access to spectrum da tabases,” IEEE Communications Magazine, vol. 56, no. 12, pp. 171–177, 2018

    work page 2018

  39. [39]

    Raid-pir: P ractical multi- server pir,

    D. Demmler, A. Herzberg, and T. Schneider, “Raid-pir: P ractical multi- server pir,” in Proceedings of the 6th edition of the ACM W orkshop on Cloud Computing Security . ACM, 2014, pp. 45–56

    work page 2014

  40. [40]

    Information-theoretic privat e information re- trieval: A unified construction,

    A. Beimel and Y . Ishai, “Information-theoretic privat e information re- trieval: A unified construction,” in International Colloquium on Au- tomata, Languages, and Programming . Springer, 2001, pp. 912–926

    work page 2001

  41. [41]

    A fast private informatio n retrieval protocol,

    C. A. Melchor and P . Gaborit, “A fast private informatio n retrieval protocol,” in ISIT 2008 . IEEE, pp. 1848–1852

    work page 2008

  42. [42]

    How to share a secret,

    A. Shamir, “How to share a secret,” Communications of the ACM, vol. 22, no. 11, pp. 612–613, 1979

    work page 1979

  43. [43]

    Optimally robu st private information retrieval

    C. Devet, I. Goldberg, and N. Heninger, “Optimally robu st private information retrieval.” in USENIX Security Symp. , 2012, pp. 269–283

    work page 2012

  44. [44]

    Improved decoding of reed-s olomon and algebraic-geometric codes,

    V . Guruswami and M. Sudan, “Improved decoding of reed-s olomon and algebraic-geometric codes,” in F oundations of Computer Science, 1998. Proceedings. 39th Annual Symposium on . IEEE, 1998, pp. 28–37

    work page 1998

  45. [45]

    Sublinear scaling for multi- client private information retrieval,

    W. Lueks and I. Goldberg, “Sublinear scaling for multi- client private information retrieval,” in International Conference on Financial Cryp- tography and Data Security . Springer, 2015, pp. 168–186

    work page 2015

  46. [46]

    B atch codes and their applications,

    Y . Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai, “B atch codes and their applications,” in Proceedings of the thirty-sixth annual ACM symposium on Theory of computing . ACM, 2004, pp. 262–271

    work page 2004

  47. [47]

    Gaussian elimination is not optimal,

    V . Strassen, “Gaussian elimination is not optimal,” Numerische mathe- matik, vol. 13, no. 4, pp. 354–356, 1969

    work page 1969

  48. [48]

    Cryptanalysis of a (somewh at) additively homomorphic encryption scheme used in pir,

    T. Lepoint and M. Tibouchi, “Cryptanalysis of a (somewh at) additively homomorphic encryption scheme used in pir,” in Int’l Conf. on Financial Cryptography and Data Security . Springer, 2015, pp. 184–193

    work page 2015

  49. [49]

    Percy++ library,

    “Percy++ library,” http://percy.sourceforge.net, a ccessed: 2017-04-14

    work page 2017

  50. [50]

    Xpir implementation,

    “Xpir implementation,” https://github.com/XPIR-te am/XPIR, accessed: 2017-04-14

    work page 2017

  51. [51]

    Sealpir implementation,

    “Sealpir implementation,” https://github.com/sga0 01/SealPIR, accessed: 2018-08-14

    work page 2018

  52. [52]

    Cdbs data,

    “Cdbs data,” https://transition.fcc.gov/Bureaus/M B/Databases/cdbs/ , ac- cessed: 2017-04-20

    work page 2017

  53. [53]

    Somewhat practical fully ho momorphic encryption

    J. Fan and F. V ercauteren, “Somewhat practical fully ho momorphic encryption.” IACR Cryptology ePrint Archive , vol. 2012, p. 144, 2012

    work page 2012

  54. [54]

    Cuckoo filter-b ased location- privacy preservation in database-driven cognitive radio n etworks,

    M. Grissa, A. A. Y avuz, and B. Hamdaoui, “Cuckoo filter-b ased location- privacy preservation in database-driven cognitive radio n etworks,” in Computer Networks and Information Security (WSCNIS), 2015 W orld Symposium on . IEEE, 2015, pp. 1–7

    work page 2015

  55. [55]

    Geo-indistinguishability: Differential privacy for loc ation-based sys- tems,

    M. E. Andr´ es, N. E. Bordenabe, K. Chatzikokolakis, and C. Palamidessi, “Geo-indistinguishability: Differential privacy for loc ation-based sys- tems,” in Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security . ACM, 2013, pp. 901–914. Mohamed Grissa (S’15) received the Diploma of Engineering (with highest distinction) in tel...

    work page 2013