A fast private information retrieval protocol

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 1848-1852

  Melchor, Carlos Aguilar ^a   Gaborit, Philippe ^a  

^a UNIVERSITY OF LIMOGES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIT-OPERATIONS; CODING THEORY; COMMUNICATION PERFORMANCES; COMPUTATIONAL COSTS; COMPUTATIONAL PERFORMANCE; INTERNATIONAL SYMPOSIUM; NP-COMPLETE; ORDERS-OF-MAGNITUDE; PRIVATE INFORMATION RETRIEVAL;

COMPUTER PROGRAMMING; CYBERNETICS; HELIUM; INFORMATION SERVICES; INFORMATION THEORY; LAWS AND LEGISLATION; NUCLEAR PROPULSION; PROGRAMMING THEORY; SEARCH ENGINES; TECHNICAL PRESENTATIONS;

DATABASE SYSTEMS;

EID: 52349090004     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595308     Document Type: Conference Paper

References (8)

1. Wieschebrink, C.: Two NP-complete Problems in Coding Theory with an Application in Code Based Cryptography. In:2006 IEEE International Symposium on Information Theory, (2006) 1733-1737
2. Kushilevitz, E., Ostrovsky, R.: Replication Is Not Needed: Single Database, Computationally-Private Information Retrieval (extended abstract). In: FOCS: IEEE Symposium on Foundations of Computer Science (FOCS). (1997) 364-373
3. Stern, J.P.: A New Efficient All-Or-Nothing Disclosure of Secrets Protocol. In:13th Annual International Conference on the Theory and Application of Cryptology & Information Security (ASIACRYPT'98), Beijing, China. Volume 1514 of Lecture Notes in Computer Science., Springer (1998) 357-371
4. Lipmaa, H.: An Oblivious Transfer Protocol with Log-Squared Communication. In:8th Information Security Conference (ISC'05), Singapore, Volume 3650 of Lecture Notes in Computer Science., Springer (2005) 314-328
5. Gentry, C., Ramzan, Z.: Single-Database Private Information Retrieval with Constant Communication Rate, In: ICALP'05, Lisbon, Portugal, Volume 3580 of Lecture Notes in Computer Science., Springer (2005) 803-815
6. Gasarch, W., Yerukhimovich, A.: Computational inexpensive PIR (2006) Draft available online at http://www.cs.umd.edu/~arkady/pir/pirComp.pdf.
7. Aguilar Melchor, C., Gaborit, P.: A Lattice-Based Computationally- Efficient Private Information Retrieval Protocol. In: Western European Workshop on Research in Cryptology (WEWoRC'2007), Bochum, Germany. Book of Abstracts, (2007) 50-54, Extended version available on IACR eprints http://eprint.iacr.org/ 2007/446
8. Phong Q. Nguyen and Jacques Stern: The two faces of lattices in cryptology. In: Cryptography and Lattices, International Conference, CaLC 2001, Providence, RI, USA, March 29-30, 2001, Revised Papers. Volume 2146 of Lecture Notes in Computer Science., Springer (2001) 146-180