Communication Complexity and Information Complexity
Trading Information Complexity for Error
... in communication complexity, where Alice and Bob (having infinite computa- tional power) wish to mutually compute a function f : X × Y → ...measure information, we also need to assume that there is a ...
73
Trading Information Complexity for Error
... phrases communication complexity, information complexity Digital Object Identifier ...Introduction Communication complexity studies the amount of communication needed to ...
59
Communication Complexity of Set-Disjointness for All Probabilities
... standard information complexity approach [4, ...of information that the protocol transcript Π(X,Y ) ...mutual information I (Π(X ,Y ) ;X,Y ). Lower bounding the mutual information has ...
23
Communication Complexity
... Let us consider the following problem: X = {0, 1} n , Y = X 2 , thus A has one num- ber, while B has two. We are going to denote B’s input y by [u, v]. S = {x, [u, v] : x = u or x = v }, thus he knows two numbers and ...
39
Quantum Private Information Retrieval with Sublinear Communication Complexity
... private information retrieval, quantum communication complexity 1 Introduction Private information retrieval deals with the design and the analysis of protocols that allow a user to retrieve ...
6
Communication complexity of document exchange
... Communication complexity of document exchange Graham Cormode Mike Paterson S¨uleyman Cenk ...any information about the other’s ...design communication protocols with the main objective of ...
17
On the Communication Complexity of Secure Computation
... Abstract. Information theoretically secure multi-party computation (MPC) is a central primitive of modern ...the communication complexity of this ...powerful information theoretic tools to ...
18
Communication Complexity of Quasirandom Rumor Spreading
... Assume further that ε is chosen small enough so that 3/2 − 2ε − log(e) > 0. Then in step t 2 + d, there exists an informed node in U with probability at least 1 − 2n −3 . Proof. We define a relation between random ...
24
On the Security of Protocols with Logarithmic Communication Complexity
... additional information the adversary might have on the protocol-inputs and still enables sequential composition without introducing nonuniform com- plexity ...
55
Correlation in Hard Distributions in Communication Complexity
... While it is known, that the number of examples needed to PAC-learn is at least Ω(V C(f )/) [17], we get an exponentially better dependence on the error here for the one-way communic- ation model under product ...
29
Communication Complexity of Distributed Statistical Algorithms
... This paper constructs bounds on the minimax risk under loss functions when statistical estimation is performed in a distributed en- vironment and with communication constraints. We treat this prob- lem using ...
18
Basics of information theory and information complexity
... into a protocol whose communication cost is close to its information cost. • More on compression later.[r] ...
86
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
... Technically speaking, this paper consists of two main contributions from which our lower bound is obtained. First, we derive a tight lower bound on the number of bits communicated by the sender during the commit stage of ...
26
The Communication Complexity of Private Simultaneous Messages, Revisited
... 30. Claude E. Shannon. Communication theory of secrecy systems. Bell Systems Technical Journal, 28:656–715, 1949. 31. Hung-Min Sun and Shiuh-Pyng Shieh. Secret sharing in graph-based prohibited structures. In ...
37
Communication and Streaming Complexity of Approximate Pattern Matching
... the communication complexity of the ...nication complexity is Θ(k log n). Indeed, from the information theoretic lower bound it follows that Alice has to send at least k log n ...any ...
11
Perfectly-Secure MPC with Linear Communication Complexity
... The faultiness of players or users is modeled in terms of a central adver- sary corrupting players and users. The adversary can corrupt up to t players for any fixed t with t < n/3 and any number of users, and make ...
18
On the Communication Complexity of Secure Function Evaluation with Long Output
... the communication complexity of this ...embeds information about the outputs y i and to change the circuit being obfuscated so that it uses the inputs r i to compute the output without knowing ...
27
Separating Deterministic from Randomized Multiparty Communication Complexity
... Since the general model laid out above is very powerful, we are also interested in communication restrictions. A player is oblivious in a certain protocol if the message he writes on the board is a function of the ...
25
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe
... new communication complexity classes that correspond to different variants of the CDS model and study the relations between them and their ...reduce communication – a seemingly new phenomenon in the ...
38
Quantum Communication Complexity with Coherent States and Linear Optics
... What information-processing tasks are unachievable in a classical world but become possible when exploiting the intrinsic quantum mechanical properties of physical systems? This question has been a driving force ...
12