%% ToC#304 Razborov-Yekhanin au version 12-19-2007 
%% revised LB 12-20 pruned LB 12-20 DB 12-27
%% re-revised LB 12-28 3am, restored first names of authors

@INPROCEEDINGS{Amb,
  AUTHOR = {Andris Ambainis},
  TITLE = {Upper bound on the communication complexity of private information retrieval},
  BOOKTITLE = {Proc. 32nd Intern. Colloquium on Automata, Languages and Programming (ICALP'97)},
  VOLUME = {1256},
  SERIES = {Lecture Notes in Computer Science},
  publisher = "Springer",
  YEAR = 1997,
  PAGES = {401--407},
  eprint="icalp:j210805656376051"
  }

@ARTICLE{BFG,
  AUTHOR = {Richard Beigel and Lance Fortnow and William Gasarch},
  TITLE = {A tight lower bound for restricted {PIR} protocols},
  JOURNAL = {Computational Complexity},
  VOLUME = 15,
  YEAR = 2006,
  PAGES = {82--91},
  eprint="springer:10.1007/s00037-006-0208-3"
  }

@ARTICLE{BIK,
  AUTHOR = {Amos Beimel and Yuval Ishai and Eyal Kushilevitz},
  TITLE = {General constructions for information-theoretic private information retrieval},
  JOURNAL = {J. Computer and System Sciences},
  VOLUME = 71,
  YEAR = 2005,
  PAGES = {213--247},
  eprint="jcss:10.1016/j.jcss.2005.03.002"
  }

@INPROCEEDINGS{BIKR,
  AUTHOR = {Amos Beimel and Yuval Ishai and Eyal Kushilevitz and Jean-Francios Raymond},
  TITLE = {Breaking the ${O}\left(n^{1/(2k-1)}\right)$ barrier for information-theoretic private information retrieval},
  BOOKTITLE = {Proc. 43rd FOCS},
  publisher = {IEEE Computer Society Press},
  YEAR = 2002,
  PAGES = {261--270},
  eprint="focs:10.1109/SFCS.2002.1181949"
  }

@ARTICLE{CGKS,
  AUTHOR = {Benny Chor and Oded Goldreich and Eyal Kushilevitz and Madhu Sudan},
  TITLE = {Private information retrieval},
  JOURNAL = {J. ACM},
  VOLUME = 45,
  YEAR = 1998,
  PAGES = {965--981},
  eprint="jacm:10.1145/293347.293350"
  }

@ARTICLE{Gasarch,
  AUTHOR = {William Gasarch},
  TITLE = {A survey on private information retrieval},
  JOURNAL = {The Bulletin of the EATCS},
  VOLUME = 82,
  YEAR = 2004,
  PAGES = {72--107},
  pdf="http://www.eatcs.org/bulletin/beatcs82.pdf"
  }

@INPROCEEDINGS{GKST,
  AUTHOR = {Oded Goldreich and Howard Karloff and Leonard Schulman and Luca Trevisan,},
  TITLE = {Lower bounds for linear locally decodable codes and private information retrieval},
  BOOKTITLE = {Proc. 17th Computational Complexity Conf. (CCC'02)},
  publisher = {IEEE Computer Society Press},
  YEAR = 2002,
  PAGES = {175--183},
  eprint="ccc:10.1109/CCC.2002.1004353"
  }

@BOOK{Isaacs,
  AUTHOR = {I. Martin Isaacs},
  TITLE = {Character theory of finite groups},
  PUBLISHER = {Academic Press},
  YEAR = 1976
}

@ARTICLE{Itoh_upper,
  AUTHOR = {Toshiya Itoh},
  TITLE = {Efficient private information retrieval},
  JOURNAL = {IEICE Trans. Fund. of Electronics, Commun. and Comp. Sci.},
  VOLUME = "E82-A",
  YEAR = 1999,
  PAGES = {11--20}
  }

@ARTICLE{Itoh_lower,
  AUTHOR = {Toshiya Itoh},
  TITLE = {On lower bounds for the communication complexity of private information retrieval},
  JOURNAL = {IEICE Trans. Fund. of Electronics, Commun. and Comp. Sci.},
  VOLUME = "E82-A",
  YEAR = 2001,
  PAGES = {157--164}
  }

@INPROCEEDINGS{KT,
  AUTHOR = {Jonathan Katz and Luca Trevisan},
  TITLE = {On the efficiency of local decoding procedures for error-correcting codes},
  BOOKTITLE = {Proc. 32nd STOC},
  publisher = {ACM Press},
  YEAR = 2000,
  PAGES = {80--86},
  eprint="stoc:10.1145/335305.335315"
  }

@TECHREPORT{KY,
  AUTHOR = {Kiran S. Kedlaya and Sergey Yekhanin},
  TITLE = {Locally decodable codes from nice subsets of finite fields and prime factors of {M}ersenne numbers},
  TYPE = {Electronic Colloquium on Computational Complexity (ECCC)},
  NUMBER = {TR07-040},
  YEAR = {2007},
  eprint="eccc:TR07-040"
}

@ARTICLE{KdW,
  AUTHOR = {Iordanis Kerenidis and Ronald de Wolf},
  TITLE = {Exponential lower bound for 2-query locally decodable codes via a quantum argument},
  JOURNAL = {J. of Computer and System Sciences},
  VOLUME = 69,
  YEAR = 2004,
  PAGES = {395--420},
  eprint="jcss:10.1016/j.jcss.2004.04.007"
  }

@MASTERSTHESIS{Mann,
  AUTHOR = {Eran Mann},
  TITLE = {Private access to distributed information},
  SCHOOL = {Technion - Israel Institute of Technology},
  ADDRESS = {Haifa},
  YEAR = 1998
}

@INPROCEEDINGS{RY,
  AUTHOR = {Alexander Razborov and Sergey Yekhanin},
  TITLE = {An ${\Omega}(n^{1/3})$ lower bound for bilinear group based private information retrieval},
  BOOKTITLE = {Proc. 47th FOCS},
  publisher = {IEEE Computer Society Press},
  YEAR = 2006,
  PAGES = {739--748},
  eprint="focs:10.1109/FOCS.2006.10"
  }

@BOOK{VdWaerden,
  AUTHOR = {B. L. van der Waerden},
  TITLE = {Algebra},
  PUBLISHER = {Springer},
  YEAR = 2003
  }

@INPROCEEDINGS{WdW,
  AUTHOR = {Stephanie Wehner and Ronald de Wolf},
  TITLE = {Improved lower bounds for locally decodable codes and private information retrieval},
  BOOKTITLE = {Proc. 32nd Intern. Colloquium on Automata, Languages and Programming (ICALP'05)},
  VOLUME = {3580},
  SERIES = {Lecture Notes in Computer Science},
  publisher = {Springer},
  YEAR = 2005,
  PAGES = {1424--1436},
  eprint="icalp:1utwmhj4me3lr582"
  }

@INCOLLECTION{Weintraub,
  AUTHOR = {Steven H. Weintraub},
  TITLE = {Representation theory of finite groups: algebra and arithmetic},
  PUBLISHER = {AMS},
  SERIES = {Graduate {S}tudies in {M}athematics},
  VOLUME = 59,
  YEAR = 2003
  }

@INPROCEEDINGS{WY,
  AUTHOR = {David Woodruff and Sergey Yekhanin},
  TITLE = {A geometric approach to information-theoretic private information retrieval},
  BOOKTITLE = {Proc. 20th IEEE Computational Complexity Conf. (CCC'05)},
  publisher = {IEEE Computer Society Press},
  YEAR = 2005,
  PAGES = {275--284},
  eprint="ccc:10.1109/CCC.2005.2"
  }

@PHDTHESIS{Y_thesis,
  AUTHOR = {Sergey Yekhanin},
  TITLE = {Locally decodable codes and private information retrieval schemes},
  SCHOOL = {Massachusetts Institute of Technology},
  YEAR = 2007
  }

@INPROCEEDINGS{Y_nice,
  AUTHOR = {Sergey Yekhanin},
  TITLE = {Towards $3$-query locally decodable codes of subexponential length},
  BOOKTITLE = {Proc. 39th STOC},
  publisher = {ACM Press},
  YEAR = 2007,
  PAGES = {266--274},
  eprint="stoc:10.1145/1250790.1250830"
  }