[freehaven-cvs] r1776: Minor updates (doc/trunk/pynchon-gate/bp-ringstwice)

[rabbi@xxxxxxxx]

Author: rabbi
Date: 2007-04-16 08:48:23 -0400 (Mon, 16 Apr 2007)
New Revision: 1776

Modified:
   doc/trunk/pynchon-gate/bp-ringstwice/byzantine-postman-rings-twice.bib
   doc/trunk/pynchon-gate/bp-ringstwice/byzantine-postman-rings-twice.tex
Log:
Minor updates


Modified: doc/trunk/pynchon-gate/bp-ringstwice/byzantine-postman-rings-twice.bib
===================================================================
--- doc/trunk/pynchon-gate/bp-ringstwice/byzantine-postman-rings-twice.bib	2007-04-16 12:43:00 UTC (rev 1775)
+++ doc/trunk/pynchon-gate/bp-ringstwice/byzantine-postman-rings-twice.bib	2007-04-16 12:48:23 UTC (rev 1776)
@@ -203,6 +203,40 @@
     www_pdf_url =  {http://www.cs.bgu.ac.il/~beimel/Papers/BI.pdf},
 }
 
+@inproceedings{woodruffY05,
+  author = {David P. Woodruff and Sergey Yekhanin},
+  title = {A Geometric Approach to Information-Theoretic Private Information Retrieval},
+  booktitle = {Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005)},
+  year      = {2005},
+  month  = {June},
+  pages     = {275-284},
+  publisher = {IEEE Computer Society},
+  isbn      = {0-7695-2364-1},
+  address = {San Jose, CA, USA},
+}
+
+@inproceedings{razborov06,
+ author = {Alexander A. Razborov and Sergey Yekhanin},
+ title = {{An $\Omega(n^1/3)$ Lower Bound for Bilinear Group Based Private Information Retrieval}},
+ booktitle = {Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)},
+ year = {2006},
+ isbn = {0-7695-2720-5},
+ pages = {739--748},
+ doi = {http://dx.doi.org/10.1109/FOCS.2006.10},
+ publisher = {IEEE Computer Society},
+ address = {Washington, DC, USA},
+ }
+ 
+@inproceedings{yekhanin07,
+    author = {Sergey Yekhanin},
+    title = {{Towards 3-Query Locally Decodable Codes of Subexponential Length}},
+    booktitle = {Proceedings of the 39th ACM Symposium on Theory of Computing (STOC)},
+    year = {2007},
+    month  = {June},
+    address = {San Diego, CA, USA},
+    publisher = {ACM Press},
+ }
+
 @techreport{cosic-2007-001,
    author = {Len Sassaman and Bart Preneel},
    title = {{The Byzantine Postman Problem: A Trivial Attack Against PIR-based Nym Servers}},

Modified: doc/trunk/pynchon-gate/bp-ringstwice/byzantine-postman-rings-twice.tex
===================================================================
--- doc/trunk/pynchon-gate/bp-ringstwice/byzantine-postman-rings-twice.tex	2007-04-16 12:43:00 UTC (rev 1775)
+++ doc/trunk/pynchon-gate/bp-ringstwice/byzantine-postman-rings-twice.tex	2007-04-16 12:48:23 UTC (rev 1776)
@@ -5,8 +5,8 @@
 \usepackage{amsmath}
 \usepackage{subfigure}
 \usepackage{epsfig}
-\usepackage{theorem}
-\newtheorem{observation}{Observation}
+%\usepackage{theorem}
+%\newtheorem{observation}{Observation}
 
 % Cut down on whitespace above and below figures displayed at head/foot of
 % page.
@@ -76,7 +76,7 @@
 
 \section{Introduction}
 
-Since the seminal paper by Chor, et al. in 1995~\cite{pir}, information-theoretic private information retrieval protocols have received considerable attention in the information theory community~\cite{beimel01informationtheoretic,beimel-barrier,beimel-robust,tau-indy,goldberg-2007}. However, comparatively little work has been done to evaluate these privacy primitives within the broader scope of a secure privacy system. We examine one consideration that designers of systems based on information-theoretic PIR may need to consider within their threat model: subliminal channels between independent PIR databases. 
+Since the seminal paper by Chor, Goldreich, Kuzhelevitz and Sudan in 1995~\cite{pir}, information-theoretic private information retrieval protocols have received considerable attention in the information theory community~\cite{beimel01informationtheoretic,beimel-barrier,beimel-robust,tau-indy,woodruffY05,razborov06,goldberg-2007,yekhanin07}. However, comparatively little work has been done to evaluate these privacy primitives within the broader scope of a secure privacy system. We examine one consideration that designers of systems based on information-theoretic PIR may need to consider within their threat model: subliminal channels between independent PIR databases. 
 
 \subsection{Background}
 
@@ -248,7 +248,8 @@
 
 Meredith L. Patterson's would like to thank the COSIC group at K.U. Leuven, for its hospitality during her visit to Leuven, and for the discussions which lead in part to this work.
 
-Len Sassaman's work was supported in part by the EU within the PRIME Project under contract IST-2002-507591. 
+Len Sassaman's work was supported was supported in part by the Concerted Research Action
+(GOA) Ambiorics 2005/11 of the Flemish Government, by the IAP Programme P6/26 BCRYPT of the Belgian State (Belgian Science Policy), and by the EU within the PRIME Project under contract IST-2002-507591. 
 
 
 

***********************************************************************
To unsubscribe, send an e-mail to majordomo@xxxxxxxx with
unsubscribe freehaven-cvs       in the body. http://freehaven.net/