Author:
Kesdogan Dogan,Borning Mark,Schmeink Michael
Reference32 articles.
1. A. Ambainis: Upper Bound on the Communication Complexity of Private Infor-
mation Retrieval, ICALP, LNCS 1256, Springer-Verlag, Berlin 1997.
2. A. Beimel, Y. Isahi, T. Malkin: Reducing the Servers Computation in Private Information Retrieval PIR with Preprocessing, CRYPTO 2000, LNCS 1880, Springer-Verlag, 2000.
3. A. Beimel, Y. Isahi, T. Malkin, and E. Kushilevitz: One-way functions are essential for single-server private information retrieval, In Proc. of the 31st Annu. ACM Symp. on the Theory of Computing (STOC), 1999.
4. O. Berthold, S. Clauß, S. Köpsell, A. Pfitzmann: Efficiency Improvements of the Private Message Service, 4th International Information Hiding Workshop, Pittsburgh, PA, USA, 25–27 April 2001.
5. O. Berthold, H. Federrath, S. Köpsell: Web MIXes: A System for Anonymous and Unobservable Internet Access, IWDIAU, LNCS 2009, Springer-Verlag, 2001.