Upper bound on the communication complexity of private information retrieval
- 1 January 1997
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Private information retrievalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Upper bounds on multiparty communication complexity of shiftsLecture Notes in Computer Science, 1996
- Simultaneous messages vs. communicationLecture Notes in Computer Science, 1995
- Modified ranks of tensors and the size of circuitsPublished by Association for Computing Machinery (ACM) ,1993
- Hiding instances in multioracle queriesLecture Notes in Computer Science, 1990
- Security-control methods for statistical databases: a comparative studyACM Computing Surveys, 1989
- On hiding information from an oracleJournal of Computer and System Sciences, 1989