Single-Database Private Information Retrieval from Fully Homomorphic Encryption
By Xun Yi, Md. Golam Kaosar, Russell Paulet, Elisa Bertino. 2013
102 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Kim Laine
- Hao Chen
- Srinath T. V. Setty
- Sebastian Angel
- Antoni Martínez-Ballesté
- Agusti Solanas
- Changyu Dong
- Liqun Chen
In Computational Theory and Mathematics
- Kim Laine
- Hao Chen
- Srinath T. V. Setty
- Sebastian Angel
- Changyu Dong
- Liqun Chen
- Justin Thaler
- Michael Walfish
Citations in the corpus
- PIR with Compressed Queries and Amortized Query Processing (2018, methodology): “On the other hand, CPIR protocols [4, 19, 22, 35, 40, 52, 53, 56, 57, 76] can be used with a database controlled by a single administrative domain (e.”
- The pursuit of citizens' privacy: a privacy-aware smart city is possible (2013, background): “Since the problem was stated in 1995, a number of protocols have been proposed to reduce the computational and communication costs [10] .”
- A Fast Single Server Private Information Retrieval Protocol with Low Communication Cost (2014, methodology): “The server homomorphically evaluates =1 x t · (cid:98) log n +1 j =1 ( t j − i j + 1) , where t j , i j are the j th bit of indexes t and i . et This approach is also used by Yi al [12], instantiated using the DGHV FHE scheme [31].”