Communication Complexity
A Note on the Communication Complexity of Multiparty Computation in the Correlated Randomness Model
... require communication for every multiplication ...have communication proportional to the circuit size of the ...the communication complexity of secure computation in the correlated randomness ...
22
The One-Way Communication Complexity of Hamming Distance
... Abstract: Consider the following version of the Hamming distance problem for ±1 vec- tors of length n: the promise is that the distance is either at least n 2 + √ n or at most n 2 − √ n, and the goal is to find out which ...
7
Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption.
... the communication complexity of conditional disclosure of secrets (CDS), where two parties want to disclose a secret to a third party if and only if their respective inputs satisfy some ...
28
The Communication Complexity of Private Simultaneous Messages, Revisited
... Our starting point is the original proof of the 3k lower-bound from [16]. In order to prove a lower-bound FKN relax the privacy condition by requiring that Charlie will not be able to recover the last bit of Alice’s ...
37
Robust Bell inequalities from communication complexity
... The preceding analysis, although accounting for detectors whose efficiency decreases exponentially with the number of EPR measurements q(n), assumes that the (uniform) δ-noise affects the quantum state both globally and ...
29
Communication Complexity of Set-Disjointness for All Probabilities
... Although communication complexity lower bounds do not seem to imply extended formulation lower bounds in a black-box way, the tools for the former have generally been useful for the ...
23
A Separation of NP and coNP in Multiparty Communication Complexity
... on communication complexity is the monograph by Kushilevitz and Nisan ...a communication channel and have an unlimited supply of shared random ...randomized communication complexity of ...
19
Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity
... a communication complexity of O(n) field elements per multiplication gate is a long standing open ...the communication complexity of the previous best AMPC protocol in the same setting by a ...
35
On the Communication Complexity of Secure Function Evaluation with Long Output
... the communication complexity of this ...any communication to Alice, there is no difference between proving the security of this protocol for an honest-but-curious Bob ...
27
Separating Deterministic from Randomized Multiparty Communication Complexity
... much communication is necessary in order to compute a function when its input is distributed between several computationally unbounded players was introduced by Yao [26], and it has since been shown to have many ...
25
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe
... the communication complexity of information-theoretically secure protocols is a fundamental research ...the communication complexity of even simple cryptographic tasks, and for most models, ...
38
Quantum Private Information Retrieval with Sublinear Communication Complexity
... Abstract: This note presents a quantum protocol for private information retrieval, in the case of a single (honest) server and with information-theoretical privacy, that has O( √ n)- qubit communication ...
6
Separation of Unbounded-Error Models in Multi-Party Communication Complexity
... unbounded-error communication complexity in the k-party number-on-forehead (NOF) model but every probabilistic protocol that solves it with subexponential advantage over random guessing has cost essentially ...
23
On the Communication Complexity of Secure Computation
... lower-bounding communication complexity has received much less atten- ...protocol), communication complex- ity was combinatorially characterized in ...amortized communication complexity ...
18
Modeling of Communication Complexity in Parallel Computing
... modeling communication complexity so in symmetrical multiprocessors (SMP) based on motherboard as in other asynchronous parallel computers (computer networks, cluster ...model communication latency ...
14
Communication Complexity of the Fast Multipole Method and its Algebraic Variants
... the communication complexity of Teng [32], Lashuk et ...scatter communication that yields the √ P factor, so this communication scheme should be directly applicable to Teng’s analysis, which ...
22
The Communication Complexity of Gap Hamming Distance
... the complexity of several streaming ...the communication complexity of gap Hamming distance imply lower bounds on the memory requirements of estimating the number of distinct elements in a data ...
12
The Randomized Communication Complexity of Set Disjointness
... probabilistic communication complexity R( f ) is the minimum number of coin tosses used plus bits exchanged by the players on the worst case input and coin tosses in the best probabilistic protocol for f ...
9
Asynchronous Computational VSS with Reduced Communication Complexity
... message complexity (number of messages transferred) and O(κn 4 ) communication com- plexity (number of bits transferred) for the optimal resiliency condition of n = 3t + ...the communication ...
20
Adaptively Secure MPC with Sublinear Communication Complexity
... the communication complexity in the secure-erasures model, and the addition of complexity assumptions in the erasures-free setting: namely the need for sub-exponentially secure iO in order to ...
72