Book ChapterDOI
Simultaneous messages vs. communication
László Babai,Peter G. Kimmel,Satyanarayana V. Lokam +2 more
- pp 361-372
TLDR
In the multiparty communication game introduced by Chandra, Furst, and Lipton [CFL] (1983), k players wish to evaluate collaboratively a function f(x0,⋯, xk−1 for which player i sees all inputs except x i .Abstract:
In the multiparty communication game introduced by Chandra, Furst, and Lipton [CFL] (1983), k players wish to evaluate collaboratively a function f(x0,⋯, xk−1 for which player i sees all inputs except x i . The players have unlimited computational power. The objective is to minimize the amount of communication.read more
Citations
More filters
Journal ArticleDOI
Private information retrieval
TL;DR: This work describes schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database, so that each individual server gets no information on the identity of the item retrieved by the user.
Proceedings ArticleDOI
Private information retrieval
TL;DR: Schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database and get no information on the identity of the item retrieved by the user are described.
Proceedings ArticleDOI
Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval
TL;DR: The complexity of information-theoretic k-server PIR is improved to n/sup O(log log k/k log k)/, and the PIR protocols are more efficient than previous ones for every k/spl ges/3, and the locally decodable codes are shorter for everyk/splges/4.
Journal ArticleDOI
Zero-error information theory
János Körner,Alon Orlitsky +1 more
TL;DR: The problem of error-free transmission capacity of a noisy channel was posed by Shannon in 1956 and remains unsolved, Nevertheless, partial results for this and similar channel and source coding problems have had a considerable impact on information theory, computer science, and mathematics.
Book ChapterDOI
Upper Bound on Communication Complexity of Private Information Retrieval
TL;DR: This work constructs a scheme for private information retrieval with k databases and communication complexity O(n 1/(2k−1) ), where n is the number of databases and O is the communication complexity.
References
More filters
Proceedings ArticleDOI
Multi-party protocols
TL;DR: A new model is studied, in which a collection of processes P0, ..., Pk−1 that share information about a set of integers {a0, …,ak−1}, communicate to determine a 0-1 predicate of the numbers.
Journal ArticleDOI
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
TL;DR: In this paper, the authors prove lower bounds of the form Ω(n · c−k), for the number of bits that need to be exchanged in order to compute some (explicitly given) polynomial time computable functions.
Journal ArticleDOI
On the power of small-depth threshold circuits
Johan Håstad,Mikael Goldmann +1 more
TL;DR: It is proved that there are monotone functionsfk that can be computed in depthk and linear size ⋎, ⋏-circuits but require exponential size to compute by a depthk−1 monot one weighted threshold circuit.
Proceedings ArticleDOI
ON ACC and threshold circuits
TL;DR: It is proved that any language in ACC can be approximately computed by two-level circuits of size 2 raised to the (log n)/sup k/ power, with a symmetric-function gate at the top and only AND gates on the first level, giving the first nontrivial upper bound on the computing power of ACC circuits.
Journal ArticleDOI
On ACC
Richard Beigel,Jun Tarui +1 more
TL;DR: It is shown that every languageL in the class ACC can be recognized by depth-two deterministic circuits with a symmetric-function gate at the root and polynomialspn overZ of degree logO(1)n and with coefficients of magnitude.