Title: A secure two-party PIR for privacy applications

Authors: Radhakrishna Bhat; N.V. Subba Reddy

Addresses: Department of Computer Science and Engineering, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, 576104, India ' Department of Information Technology, Manipal Institute of Technology Bengaluru, Manipal Academy of Higher Education, Manipal, India

Abstract: The major drawback of existing information retrieval schemes in preserving user privacy is that they either exhibit computationally bounded privacy with intractability assumptions or perfect privacy with high bandwidth utilisation. Today, the essential requirement is to have a bandwidth efficient perfect privacy preserving information retrieval scheme in order to provide effective and guaranteed service to the information retrieving user. Therefore, in this paper, we have constructed a new single database perfect privacy preserving private block retrieval scheme called as 'pepperPBR' using quadratic residuosity as the underlying primitive where private block retrieval (PBR) is a natural extension to private information retrieval (PIR). In this paper, user generates O(6k) bit query and server generates O(2ku + o(n)) bit response where n is the database size, o(n) is the non-trivial server communication cost, u is the number of database blocks, k is the security parameter.

Keywords: database system; private information retrieval; PIR; quadratic residuosity assumption; QRA; probabilistic encryption.

DOI: 10.1504/IJIIDS.2022.126513

International Journal of Intelligent Information and Database Systems, 2022 Vol.15 No.4, pp.450 - 467

Received: 29 Jul 2021
Accepted: 26 Apr 2022
Published online: 27 Oct 2022 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article