Topic
Communication complexity
About: Communication complexity is a research topic. Over the lifetime, 3870 publications have been published within this topic receiving 105832 citations.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: An analysis and new results holding for this model of oblivious transfer are presented: lower bounds on the resources required to implement such a scheme, as well as new one-round and two-round distributed oblivious transfer protocols, both for threshold and general access structures on the set of Servers, which are optimal with respect to some of the given bounds.
Abstract: This paper is about the oblivious transfer in the distributed model proposed by Naor and Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one of them. During a set-up phase, the Sender gives informationabout the secrets to m Servers. Afterwards, in a recovering phase, the Receiver can compute the secret she wishes by interacting with any k of them. More precisely, from the answers received she computes the secret in which she is interested but she gets no information on the others and, at the same time, any coalition of k - 1 Servers can neither compute any secret nor figure out which one the Receiver has recovered. We present an analysis and new results holding for this model: lower bounds on the resources required to implement such a scheme (i.e., randomness, memory storage, communication complexity); some impossibility results for one-round distributed oblivious transfer protocols; two polynomial-based constructions implementing 1-out-of-n distributed oblivious transfer, which generalize and strengthen the two constructions for 1-out-of-2 given by Naor and Pinkas; as well as new one-round and two-round distributed oblivious transfer protocols, both for threshold and general access structures on the set of Servers, which are optimal with respect to some of the given bounds. Most of these constructions are basically combinatorial in nature.
29 citations
••
10 Aug 2009TL;DR: A fast deterministic consensus algorithm that has processes exchange messages according to topologies of overlay graphs that have suitable robustness and connectivity properties related to graph expansion is given.
Abstract: We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaulty processes agree on a common value from among the input ones, after each process has been initialized with a binary input value. The system consists of n processes and it is assumed that at most t
29 citations
••
07 May 2007TL;DR: This work addresses two key optimization problems that arise in this context - placement, i.e., assigning computations to PEs on the NoC, and scheduling, ie.
Abstract: Many DSP algorithms are very computationally intensive. They are typically implemented using an ensemble of processing elements (PEs) operating in parallel. The results from PEs need to be communicated with other PEs, and for many applications the cost of implementing the communication between PEs is very high. Given a DSP algorithm with high communication complexity, it is natural to use a network-on-chip (NoC) to implement the communication. We address two key optimization problems that arise in this context - placement, i.e., assigning computations to PEs on the NoC, and scheduling, i.e., constructing a detailed cycle-by-cycle scheme for implementing the communication between PEs on the NoC
29 citations
••
TL;DR: An explicit function f that can be computed by a nondeterministic number-on-forehead protocol communicating O(logn) bits, but that requires n bits of communication for randomized number- on-fore head protocols is exhibited.
Abstract: We exhibit an explicit function f : {0, 1}n →{0, 1} that can be computed by a nondeterministic number-on-forehead protocol communicating O(logn) bits, but that requires nΩ(1) bits of communication for randomized number-on-forehead protocols with k = δ·logn players, for any fixed δ
29 citations