First CPIR Protocol with Data-Dependent Computation

By Helger Lipmaa. 2009

83 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

Citations in the corpus

PIR with Compressed Queries and Amortized Query Processing (2018, methodology): “On the other hand, CPIR protocols [4, 19, 22, 35, 40, 52, 53, 56, 57, 76] can be used with a database controlled by a single administrative domain (e.”
XPIR : Private Information Retrieval for Everyone (2016, background): “As number theoretic approaches failed to provide efﬁcient cPIR schemes, some alternatives were explored [6, 7, 8], but all of them were based on non-standard problems and have been broken [9, 10, 11, 12, 13].”
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups (2010, background): “Although there has been success in devising cPIR protocols with reduced communication complexity including [4] (see [9] for related work), there has been little work aimed at improving computational costs on the server (but see [ 7 ]).”
Linear Batch Codes (2014, background): “(The only exception is [8], where the per-query computational complexity is O(n/ logn).”
Single-Database Private Information Retrieval from Fully Homomorphic Encryption (2013, methodology): “Like the original single-database PIR of Kushilevitz and Ostrovsky [23], Chang [8] and Lipmaa [25], [26] also constructed PIR protocols with communication complexity of Oðlog(2) nÞ.”
Optimal Rate Private Information Retrieval from Homomorphic Encryption (2015, methodology): “However, the Laur-Lipmaa transformation — that relies on concrete properties of the Damgård-Jurik cryptosystem — is not rate preserving.”
A Fast Single Server Private Information Retrieval Protocol with Low Communication Cost (2014, methodology): “Lipmaa proposed a BDD-based protocol [17] that is very efﬁcient when the database is sparse, but in general case it requires O ( n/ log n ) modular exponentiations, which is more expensive than n modular multi-plications.”
A Simpler Rate-Optimal CPIR Protocol (2017, methodology): “In [Lip05], Lipmaa additionally noted that one can reduce the communication (assuming `/κ log2 n) by executing the protocol from Sect.”