Public Key Encryption That Allows PIR Queries

By Dan Boneh, Eyal Kushilevitz, Rafail M. Ostrovsky, William E. Skeith III. Annual International Cryptology Conference, 2007

307 citations recorded by the source corpus.

Subfields: Artificial Intelligence

View Paper: https://www.semanticscholar.org/paper/81d8247f43e5ee4a6a47afb0cced92e45f90445a

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

1. Kui Ren
2. Wenjing Lou
3. Ming Li
4. Ning Cao
5. Xingming Sun
6. Kristin E. Lauter
7. Seny Kamara
8. Daniel Demmler

Citations in the corpus

• Access Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation (2012, background): “presented a public key solution that can hide access patterns in [5].”
• RAID-PIR: Practical Multi-Server PIR (2014, background): “PIR can also be used to privately query messages from an encrypted mail-box [SCM05, BKOI07, MOT + 11] and is a building block in the recently proposed private presence service DP5 [BDG14].”
• Structured Encryption and Controlled Disclosure (2010, background): “Searchable encryption has also been considered in the public-key setting [5, 36, 1, 10, 7, 9].”
• Privacy-preserving multi-keyword ranked search over encrypted cloud data (2011, background): “Traditional single keyword searchable encryption schemes [5]–[13], [22] usually build an encrypted searchable index such that its content is hidden to the server unless it is given appropriate trapdoors generated via secret key(s) [2].”
• Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data (2014, background): “Traditional single keyword searchable encryption schemes [7], [8], [9], [10], [11], [12], [13], [14], [15], [25], [26] usually build an encrypted searchable index such that its content is hidden to the server unless it is given appropriate trapdoors generated via secret key(s) [4].”
• Searchable symmetric encryption: Improved definitions and efficient constructions (2006, unknown): “For simplicity, the security parameter is not included as a factor for the relevant costs. also been considered in the public-key setting [11, 3], where anyone with access to a user’s public-key can add words to an index, but only the owner of the private-key can generate trapdoors to test for the…”
• A Survey of Provably Secure Searchable Encryption (2014, unknown): “BCK inserts these LSH values into one Bloom filter with storage [Boneh et al. 2007] (BFS) in encrypted form.”
• "Better Than Nothing" Privacy with Bloom Filters: To What Extent? (2012, background): “[12]; composability of the Pohlig-Hellman cipher [10, 11]; blind signatures and oblivious pseudorandom functions [13]; Boneh-Goh-Nissim public key encryption [14]; etc.”
• Cryptographic Cloud Storage (2010, background): “Other issues related to the application of ASE in practical systems have been studied [5,6,22], as well as very strong notions of ASE that can guarantee the complete privacy of queries (at the cost of efficiency) [ 12 ].”