Name
Abstract | ||
|---|---|---|
In this work we focus on tailoring and optimizing the computational Private Information Retrieval (cPIR) scheme proposed in WAHC 2014 for efficient execution on graphics processing units (GPUs). Exploiting the mass parallelism inGPUs is a commonly used approach in speeding up cPIRs. Our goal is to eliminate the efficiency bottleneck of the Doroz et al. construction which would allow us to take advantage of its excellent bandwidth performance. To this end, we develop custom code to support polynomial ring operations and extend them to realize the evaluation functions in an optimized manner on high end GPUs. Specifically, we develop optimized CUDA code to support large degree/large coefficient polynomial arithmetic operations such asmodularmultiplication/reduction, and modulus switching. Moreover, we choose same prime numbers for both the CRT domain representation of the polynomials and for the modulus switching implementation of the somewhat homomorphic encryption scheme. This allows us to combine two arithmetic domains, which reduces the number of domain conversions and permits us to perform faster arithmetic. Our implementation achieves 14-34 times speedup for index comparison and 4-18 times speedup for data aggregation compared to a pure CPU software implementation. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-662-48051-9_12 | Lecture Notes in Computer Science |
Keywords | DocType | Volume |
Private information retrieval,Homomorphic encryption,NTRU | Conference | 8976 |
ISSN | Citations | PageRank |
0302-9743 | 7 | 0.49 |
References | Authors | |
16 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei Dai | 1 | 40 | 3.25 |
| Yarkin Doröz | 2 | 124 | 10.11 |
| Berk Sunar | 3 | 10 | 0.93 |