Improving the robustness of private information retrieval

Proceedings - IEEE Symposium on Security and Privacy

Volumn , Issue , 2007, Pages 131-145

  Goldberg, Ian ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATA PRIVACY; DATABASE SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SENSITIVITY ANALYSIS; SERVERS;

PRIVACY PROTECTION; PRIVATE INFORMATION RETRIEVAL (PIR);

INFORMATION RETRIEVAL;

EID: 34548787882     PISSN: 10816011     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SP.2007.23     Document Type: Conference Paper

References (17)

1. D. Asonov. Private Information Retrieval: An overview and current trends. In Proceedings of the ECDPvA Workshop, Informatik 2001, September 2001.
2. A. Beimel and Y. Stahl. Robust Information-Theoretic Private Information Retrieval. In Third Conference on Security in Communication Networks, Lecture Notes in Computer Science 2576, pages 326-341. Springer-Verlag, 2002.
3. B. Chor and N. Gilboa. Computationally Private Information Retrieval. In 29th Annual ACM Symposium on Theory of Computing, pages 304-313, 1997.
4. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private Information Retrieval. In 36th Annual Symposium on Foundations of Computer Science, pages 41-50, 1995.
5. Y. Gertner, S. Goldwasser, and T. Malkin. A Random Server Model for Private Information Retrieval. In 2nd International Workshop on Randomization and Approximation Techniques in Computer Science, Lecture Notes in Computer Science 1518, pages 200-217. Springer-Verlag, 1998.
6. I. Goldberg. Percy++ project on SourceForge. http://percy.sourceforge. net/.
7. V. Guruswami and M. Sudan. Improved Decoding of Reed-Solomon and Algebraic-Geometry Codes. IEEE Transactions on Information Theory, 45(6):1757-1767, September 1999.
8. E. Kushilevitz and R. Ostrovsky. Replication is Not Needed: Single Database, Computationally Private Information Retrieval. In 38th Annual Symposium on Foundations of Computer Science, pages 364-373, October 1997.
9. S. Micali, C. Peikert, M. Sudan, and D. A. Wilson. Optimal Error Correction Against Computationally Bounded Noise. In Theory of Cryptography, Second Theory of Cryptography Conference, Lecture Notes in Computer Science 3378, pages 1-16. Springer-Verlag, February 2005.
10. P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Advances in Cryptology - Eurocrypt '99, Lecture Notes in Computer Science 1592, pages 223-238. Springer-Verlag, 1999.
11. L. Sassaman, B. Cohen, and N. Mathewson. The Pynchon Gate: A Secure Method of Pseudonymous Mail Retrieval. In Workshop on Privacy in the Electronic Society (WPES 2005), pages 1-9, November 2005.
12. L. Sassaman and B. Preneel. The Byzantine Postman Problem: A Trivial Attack against PIR-based Nym Servers. Technical Report ESAT-COSIC 2007-001, Katholieke Universiteit Leuven, February 2007.
13. SciFace Software. Mathematics Mastered with MuPAD Pro. http://www.sciface.com/products/mupadpro.php.
14. A. Shamir. How to Share a Secret. Communications of the ACM, 22(11):612-613, 1979.
15. V. Shoup. NTL: A Library for doing Number Theory. http://shoup.net/ntl/.
16. M. Tompa and H. Woll. How to Share a Secret with Cheaters. J. Cryptology, 1(2):133-138, 1988.
17. E. Y. Yang, J. Xu, and K. H. Bennett. Private Information Retrieval in the Presence of Malicious Failures. In Computer Software and Applications Conference 2002 (COMPSAC 2002), August 2002.