Welcome to the resource topic for 2009/395
Title:
First CPIR Protocol with Data-Dependent Computation
Authors: Helger Lipmaa
Abstract:We design a new (n, 1)-CPIR protocol \mathsf{BddCpir} for \ell-bit strings as a combination of a noncryptographic (BDD-based) data structure and a more basic cryptographic primitive (communication-efficient (2, 1)-CPIR). \mathsf{BddCpir} is the first CPIR protocol where server’s online computation depends substantially on the concrete database. We then show that (a) for reasonably small values of \ell, \mathsf{BddCpir} is guaranteed to have simultaneously log-squared communication and sublinear online computation, and (b) \mathsf{BddCpir} can handle huge but sparse matrices, common in data-mining applications, significantly more efficiently compared to all previous protocols. The security of \mathsf{BddCpir} can be based on the well-known Decisional Composite Residuosity assumption
ePrint: https://eprint.iacr.org/2009/395
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .