ACM Home Page
Please provide us with feedback. Feedback
Computationally private information retrieval (extended abstract)
Full text PdfPdf (1.10 MB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing table of contents
El Paso, Texas, United States
Pages: 304 - 313  
Year of Publication: 1997
ISBN:0-89791-888-6
Authors
Benny Chor  Computer Science Dept., Technion, Haifa, Israel
Niv Gilboa  Computer Science Dept., Technion, Haifa, Israel
Sponsor
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 28,   Citation Count: 23
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/258533.258609
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
A. Ambainis, "A n upper bound for Private Information Retrieval", manuscript, 1996.
 
2
 
3
4
5
6
 
7
G. Itkis, private communication, 1996.
 
8
9
 
10
A. Yao, "Theory and Applications of Trapdoor Functions", Proc. of 23~d FOCS (1982), pp. 80-91.

CITED BY  23