Privately retrieve data from large databases

Authors:
Qianhong Wu;Yi Mu;Willy Susilo;Fangguo Zhang
Affiliations:
Center for Information Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia;Center for Information Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia;Center for Information Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia;School of Information Science and Technology, Sun Yat-sen University, Guangzhou, Guangdong Province, P.R. China
Venue:
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Year:
2006

Citing 13
Cited 0

All-or-nothing disclosure of secrets

Proceedings on Advances in cryptology---CRYPTO '86
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
Factoring N = prq for Large r

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Symmetrically Private Information Retrieval

INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
A New Efficient All-Or-Nothing Disclosure of Secrets Protocol

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
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
Efficient 1-Out-n Oblivious Transfer Schemes

PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: 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
Zero-knowledge proofs of knowledge without interaction

SFCS '92 Proceedings of the 33rd 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
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

We propose a general efficient transformation from Private Information Retrieval (PIR) to Symmetrically Private Information Retrieval (SPIR). Unlike existing schemes using inefficient zero-knowledge proofs, our transformation exploits an efficient construction of Oblivious Transfer (OT) to reduce the communication complexity which is a main goal of PIR and SPIR. The proposed SPIR enjoys almost the same communication complexity as the underlying PIR. As an independent interest, we propose a novel homomorphic public-key cryptosytem derived from Okamoto-Uchiyama cryptosystem and prove its security. The new homomorphic cryptosystem has an additional useful advantage to enable one to encrypt messages in changeable size with fixed extension bits. Based on the proposed cryptosystem, the implementation of PIR/SPIR makes PIR and SPIR applicable to large databases.