scispace - formally typeset
Search or ask a question
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
More filters
Journal Article
TL;DR: In this paper, the authors present an efficient multi-party computation protocol for the passive model, where the corrupted players are guaranteed not to deviate from the protocol, and the complexity of the protocol is O(mn 2 ) field elements.
Abstract: We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/3 of the n players is tolerated. The communication complexity for securely evaluating a circuit with m multiplication gates over a finite field is O(mn 2 ) field elements, including the communication required for simulating broadcast, but excluding some overhead costs (independent of m) for sharing the inputs and reconstructing the outputs. This corresponds to the complexity of the best known protocols for the passive model, where the corrupted players are guaranteed not to deviate from the protocol. The complexity of our protocol may well be optimal. The constant overhead factor for robustness is small and the protocol is practical.

81 citations

Proceedings ArticleDOI
06 Jun 2011
TL;DR: In this paper, the authors study the verification problem in distributed networks, and give almost tight lower bounds on the running time of distributed verification algorithms for many fundamental problems such as connectivity, spanning connected subgraph, and s-t cut verification.
Abstract: We study the verification problem in distributed networks, stated as follows. Let H be a subgraph of a network G where each vertex of G knows which edges incident on it are in H. We would like to verify whether H has some properties, e.g., if it is a tree or if it is connected (every node knows in the end of the process whether H has the specified property or not). We would like to perform this verification in a decentralized fashion via a distributed algorithm. The time complexity of verification is measured as the number of rounds of distributed communication.In this paper we initiate a systematic study of distributed verification, and give almost tight lower bounds on the running time of distributed verification algorithms for many fundamental problems such as connectivity, spanning connected subgraph, and s-t cut verification. We then show applications of these results in deriving strong unconditional time lower bounds on the hardness of distributed approximation for many classical optimization problems including minimum spanning tree, shortest paths, and minimum cut. Many of these results are the first non-trivial lower bounds for both exact and approximate distributed computation and they resolve previous open questions. Moreover, our unconditional lower bound of approximating minimum spanning tree (MST) subsumes and improves upon the previous hardness of approximation bound of Elkin [STOC 2004] as well as the lower bound for (exact) MST computation of Peleg and Rubinovich [FOCS 1999]. Our result implies that there can be no distributed approximation algorithm for MST that is significantly faster than the current exact algorithm, for any approximation factor.Our lower bound proofs show an interesting connection between communication complexity and distributed computing which turns out to be useful in establishing the time complexity of exact and approximate distributed computation of many problems.

80 citations

Book ChapterDOI
24 Feb 2014
TL;DR: The complexity of realizing the “worst” functions in several standard models of information-theoretic cryptography, for the case of security against passive adversaries, is studied.
Abstract: We study the complexity of realizing the “worst” functions in several standard models of information-theoretic cryptography. In particular, for the case of security against passive adversaries, we obtain the following main results.

80 citations

Posted Content
TL;DR: In this paper, the authors proposed a new protocol for secure three-party computation of any functionality, with an honest majority and a malicious adversary, which is distinguished by extremely low communication complexity and very simple computation.
Abstract: In this paper, we describe a new protocol for secure three-party computation of any functionality, with an honest majority and a malicious adversary. Our protocol has both an information-theoretic and computational variant, and is distinguished by extremely low communication complexity and very simple computation. We start from the recent semi-honest protocol of Araki et al. (ACM CCS 2016) in which the parties communicate only a single bit per AND gate, and modify it to be secure in the presence of malicious adversaries. Our protocol follows the paradigm of first constructing Beaver multiplication triples and then using them to verify that circuit gates are correctly computed. As in previous work (e.g., the so-called TinyOT and SPDZ protocols), we rely on the cut-and-choose paradigm to verify that triples are correctly constructed. We are able to utilize the fact that at most one of three parties is corrupted in order to construct an extremely simple and efficient method of constructing such triples. We also present an improved combinatorial analysis for this cut-and-choose which can be used to achieve improvements in other protocols using this approach.

80 citations

Journal ArticleDOI
TL;DR: This paper presents new design formulations that aim at optimizing the performance of an orthogonal frequency-division multiple-access (OFDMA) ad hoc cognitive radio network through joint subcarrier assignment and power allocation and recommends that the network collaboration is made possible through the implementation of virtual timers at individual secondary users and through the exchange of pertinent information over a common reserved channel.
Abstract: This paper presents new design formulations that aim at optimizing the performance of an orthogonal frequency-division multiple-access (OFDMA) ad hoc cognitive radio network through joint subcarrier assignment and power allocation. Aside from an important constraint on the tolerable interference induced to primary networks, to efficiently implement spectrum-sharing control within the unlicensed network, the optimization problems considered here strictly enforce upper and lower bounds on the total amount of temporarily available bandwidth that is granted to individual secondary users. These new requirements are of particular relevance in cognitive radio settings, where the spectral activities of primary users are highly dynamic, leaving little opportunity for secondary access. A dual decomposition framework is then developed for two criteria (throughput maximization and power minimization), which gives rise to the realization of distributed solutions. Because the proposed distributed protocols require very limited cooperation among the participating network elements, they are particularly applicable to ad hoc cognitive networks, where centralized processing and control are certainly inaccessible. In this paper, we recommend that the network collaboration is made possible through the implementation of virtual timers at individual secondary users and through the exchange of pertinent information over a common reserved channel. It is shown that not only is the computational complexity of the devised algorithms affordable but that the performance of these algorithms in practical scenarios attains the actual global optimum as well. The potential of the proposed approaches is thoroughly verified by asymptotic complexity analysis and numerical results.

80 citations


Network Information
Related Topics (5)
Upper and lower bounds
56.9K papers, 1.1M citations
84% related
Encryption
98.3K papers, 1.4M citations
82% related
Network packet
159.7K papers, 2.2M citations
81% related
Server
79.5K papers, 1.4M citations
81% related
Wireless network
122.5K papers, 2.1M citations
80% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202319
202256
2021161
2020165
2019149
2018141