Publication 2013 Issue No. 5 - May Abstract - Single-Database Private Information Retrieval from Fully Homomorphic Encryption
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Xun Yi Articles by Mohammed Golam Kaosar Articles by Russell Paulet Articles by Elisa Bertino
Single-Database Private Information Retrieval from Fully Homomorphic Encryption
May 2013 (vol. 25 no. 5)
pp. 1125-1134
 ASCII Text x Xun Yi, Mohammed Golam Kaosar, Russell Paulet, Elisa Bertino, "Single-Database Private Information Retrieval from Fully Homomorphic Encryption," IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 5, pp. 1125-1134, May, 2013.
 BibTex x @article{ 10.1109/TKDE.2012.90,author = {Xun Yi and Mohammed Golam Kaosar and Russell Paulet and Elisa Bertino},title = {Single-Database Private Information Retrieval from Fully Homomorphic Encryption},journal ={IEEE Transactions on Knowledge and Data Engineering},volume = {25},number = {5},issn = {1041-4347},year = {2013},pages = {1125-1134},doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2012.90},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Knowledge and Data EngineeringTI - Single-Database Private Information Retrieval from Fully Homomorphic EncryptionIS - 5SN - 1041-4347SP1125EP1134EPD - 1125-1134A1 - Xun Yi, A1 - Mohammed Golam Kaosar, A1 - Russell Paulet, A1 - Elisa Bertino, PY - 2013KW - ProtocolsKW - EncryptionKW - ServersKW - Complexity theoryKW - IndexesKW - fully homomorphic encryptionKW - Private information retrievalKW - private block retrievalVL - 25JA - IEEE Transactions on Knowledge and Data EngineeringER -
Xun Yi, Victoria University, Melbourne
Mohammed Golam Kaosar, Victoria University, Melbourne
Russell Paulet, Victoria University, Melbourne
Elisa Bertino, Purdue University, West Lafayette
Private Information Retrieval (PIR) allows a user to retrieve the $(i)$th bit of an $(n)$-bit database without revealing to the database server the value of $(i)$. In this paper, we present a PIR protocol with the communication complexity of $(O(\gamma \log n))$ bits, where $(\gamma)$ is the ciphertext size. Furthermore, we extend the PIR protocol to a private block retrieval (PBR) protocol, a natural and more practical extension of PIR in which the user retrieves a block of bits, instead of retrieving single bit. Our protocols are built on the state-of-the-art fully homomorphic encryption (FHE) techniques and provide privacy for the user if the underlying FHE scheme is semantically secure. The total communication complexity of our PBR is $(O(\gamma \log m+\gamma n/m))$ bits, where $(m)$ is the number of blocks. The total computation complexity of our PBR is $(O(m\log m))$ modular multiplications plus $(O(n/2))$ modular additions. In terms of total protocol execution time, our PBR protocol is more efficient than existing PBR protocols which usually require to compute $(O(n/2))$ modular multiplications when the size of a block in the database is large and a high-speed network is available.
Index Terms:
Protocols,Encryption,Servers,Complexity theory,Indexes,fully homomorphic encryption,Private information retrieval,private block retrieval
Citation:
Xun Yi, Mohammed Golam Kaosar, Russell Paulet, Elisa Bertino, "Single-Database Private Information Retrieval from Fully Homomorphic Encryption," IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 5, pp. 1125-1134, May 2013, doi:10.1109/TKDE.2012.90