TY - GEN
T1 - A novel tamper evident single database information-theoretic private information retrieval for user privacy applications
AU - Bhat, Radhakrishna
AU - Sunitha, N. R.
N1 - Publisher Copyright:
© 2019, Springer Nature Switzerland AG.
PY - 2019
Y1 - 2019
N2 - Providing perfect privacy to the user against analytics enabled trusted-but-curious type of database server during private information retrieval has gained major attention. The major problem with the existing user privacy preserving information retrieval methods is that either server has adopted its own privacy preserving policy (i.e., user privacy is guaranteed through the server privacy policy) or user has conveyed to use intractability assumption based user privacy preserving techniques. Due to this, user privacy is not completely assured till date. We have successfully constructed a perfect user privacy preserving information retrieval scheme in a single database setting called sitPIR using the concept of Private Information Retrieval (PIR). In the proposed scheme, the identically distributed O (5 log N) bits query exhibit perfect privacy where N is the RSA composite. Note that the proposed scheme preserves user privacy (i.e., user interest) using an information-theoretic query against the curious server and preserves data privacy through O(o(n)+ 2 log N response bits against computationally bounded intermediate adversary using Quadratic Residuosity Assumption (QRA) where n is the database size. We have also extended the proposed scheme to a tamper-evident single database information-theoretic Private Block Retrieval (PBR) scheme called sitPBR.
AB - Providing perfect privacy to the user against analytics enabled trusted-but-curious type of database server during private information retrieval has gained major attention. The major problem with the existing user privacy preserving information retrieval methods is that either server has adopted its own privacy preserving policy (i.e., user privacy is guaranteed through the server privacy policy) or user has conveyed to use intractability assumption based user privacy preserving techniques. Due to this, user privacy is not completely assured till date. We have successfully constructed a perfect user privacy preserving information retrieval scheme in a single database setting called sitPIR using the concept of Private Information Retrieval (PIR). In the proposed scheme, the identically distributed O (5 log N) bits query exhibit perfect privacy where N is the RSA composite. Note that the proposed scheme preserves user privacy (i.e., user interest) using an information-theoretic query against the curious server and preserves data privacy through O(o(n)+ 2 log N response bits against computationally bounded intermediate adversary using Quadratic Residuosity Assumption (QRA) where n is the database size. We have also extended the proposed scheme to a tamper-evident single database information-theoretic Private Block Retrieval (PBR) scheme called sitPBR.
UR - http://www.scopus.com/inward/record.url?scp=85061079781&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85061079781&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-12146-4_19
DO - 10.1007/978-3-030-12146-4_19
M3 - Conference contribution
AN - SCOPUS:85061079781
SN - 9783030121457
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 304
EP - 321
BT - Information Security and Cryptology – ICISC 2018 - 21st International Conference, Revised Selected Papers
A2 - Lee, Kwangsu
PB - Springer Verlag
T2 - 21st International Conference on Information Security and Cryptology, ICISC 2018
Y2 - 28 November 2018 through 30 November 2018
ER -