Unleashing the Power of Doubling Queries in Polynomial Private Information Retrieval or How to Easily Make the Protocol Verifiable


Speaker:  Stanislav KruglikNanyang Technological University.

Time:       15:00-16:00 am, Sept.07

Location: SIST 1A 200

Host:        Liangfeng Zhang



Private Information Retrieval (PIR) protocols allow a client to retrieve any file of interest while keeping the files' identities hidden from the database servers. While most existing PIR protocols assume servers to be honest but curious, in this talk I will shed a light on my recent investigation of  scenario of dishonest servers that provide incorrect answers to mislead clients into obtaining wrong results. More precisely, I will present a unified framework for polynomial PIR protocols encompassing various existing protocols that optimize the download rate or total communication cost. Later on I will introduce a way to transform a polynomial PIR to a verifiable one without increasing the number of involved servers by doubling the queries.




Stanislav Kruglik received his Ph.D. degree in computer science from Moscow Institute of Physics and Technology (MIPT), Moscow, Russia. Currently, he is a research fellow (postdoc) at Nanyang Technological University, Singapore. His research interests include information theory and its applications, in particular to problems related to data storage and security. Stanislav Kruglik received Russian president scholarship in 2016 and Simons foundation scholarship in 2015.