A New Method for Computational Private Information Retrieval

Tillem, Gamze; Savaş, Erkay; Kaya, Kamer

doi:10.1093/comjnl/bxx025

Cited by 1 publication

(4 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lipmaa's BddCPIR is not the only tree‐based CPIR scheme in the literature; the protocol can easily be generalized to larger databases and other types of trees, which employ a multi‐exponentation for each internal node in the tree with the same number of bases and exponents. Furthermore, there exist approaches employing different labels, which are shown to be more efficient in terms of bandwidth usage …”

Section: Notation and Backgroundmentioning

confidence: 99%

“…These techniques are analyzed and improved on other studies, eg, the work of Möller . Our work is based on Lim and Lee's multi‐exponentiation method that uses pre‐computation, which we employed for faster privacy preserving query processing without any parallelization.…”

Section: Related Workmentioning

confidence: 99%

“…BddCPIR's security depends on the decisional composite residuosity problem . Lately, using octal and hexadecimal trees have been investigated instead of binary trees …”

Section: Introductionmentioning

confidence: 99%

“…8 Lately, using octal and hexadecimal trees have been investigated instead of binary trees. 9,10 To execute tree-based CPIR schemes, several modular multi-exponentiation operations need to be performed. A modular multi-exponentiation takes n bases X [.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A generic Private Information Retrieval scheme with parallel multi‐exponentiations on multicore processors

Topçuoğlu

Kaya

Savaş

2018

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

Summary Private Information Retrieval (PIR) enables the data owners to share and/or retrieve data on remote repositories without leaking any information as to which a data item is requested. Although it is always possible to download the entire dataset, this is clearly a waste of bandwidth. A fundamental approach in the literature for PIR is exploiting homomorphic cryptosystems. In these approaches, not one but many modular exponentiations need to be computed and multiplied to obtain the desired result. This multi‐exponentiation operation can be implemented by exponentiating the bases to their corresponding exponents one‐by‐one. However, when the operation is considered as a whole, it can be performed in a more efficient way. Although individual exponentiations are pleasingly parallelizable, the combined multi‐exponentiation requires a careful parallel implementation. In this work, we propose a generic tensor‐based PIR scheme and efficient and novel techniques to parallelize multi‐exponentiations on multicore processors with perfect load balance. The experimental results show that our load balancing techniques make a parallel multi‐exponentiation up to %27 faster when the size of the bases and the exponents are 4096 bits and the number of threads is 16.

show abstract

Section: Notation and Backgroundmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

“…BddCPIR's security depends on the decisional composite residuosity problem . Lately, using octal and hexadecimal trees have been investigated instead of binary trees …”

Section: Introductionmentioning

confidence: 99%