A note on a fatal error of optimized LFC private information retrieval scheme and its corrected results

Authors:
Jin Tamura;Kazukuni Kobara;Hanane Fathi;Hideki Imai
Affiliations:
National Institute of Information and Communications Technology, Japan;National Institute of Advanced, Industrial Science and Technology, Japan;Aalborg University, Denmark;National Institute of Advanced, Industrial Science and Technology, Japan
Venue:
FC'10 Proceedings of the 14th international conference on Financial cryptograpy and data security
Year:
2010

Citing 10
Cited 0

Computationally private information retrieval (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Upper Bound on Communication Complexity of Private Information Retrieval

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System

PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Private information retrieval

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Replication is not needed: single database, computationally-private information retrieval

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Computationally private information retrieval with polylogarithmic communication

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A length-flexible threshold cryptosystem with applications

ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
An oblivious transfer protocol with log-squared communication

ISC'05 Proceedings of the 8th international conference on Information Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

A number of lightweight PIR (Private Information Retrieval) schemes have been proposed in recent years. In JWIS2006, Kwon et al. proposed a new scheme (optimized LFCPIR, or OLFCPIR), which aimed at reducing the communication cost of Lipmaa's O(log2 n) PIR(LFCPIR) to O(log n). However in this paper, we point out a fatal error of overflow contained in OLFCPIR and show how the error can be corrected. Finally, we compare with LFCPIR to show that the communication cost of our corrected OLFCPIR is asymptotically the same as the previous LFCPIR.