We give an exponential separation between one-way quantum and classical communication complexity for a Boolean function. Earlier such a separation was known only for a relation. A very similar result was obtained earlier but independently by Kerenidis and Raz [KR06]. Our version of the result gives an example in the bounded storage model of cryptography, where the key is secure if the adversary...

We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is unconditionally concealing and computationally binding. Unlike the classical reduction of Naor, Ostrovski, Ventkatesen and Young, our protocol is non-interactive and has communication complexity O(n) qubits for n a security p...

The purpose of the present study was to compare the profiles of perceived self-efficacy in problem solving and scientific communication between men and women university students. A total sample of 2089 participants, 902 women and 1187 men, aged 17 20 years participated in this study. The sample was constituted by all the freshmen university students from each degree offered by the Autonomous Un...

This paper surveys the field of quantum communication complexity. Some interesting recent results are collected concerning relations to classical communication, lower bound methods, one-way communication, and applications of quantum communication complexity.

Since the seminal work of Paturi and Simon [26, FOCS’84 & JCSS’86], the unboundederror classical communication complexity of a Boolean function has been studied based on the arrangement of points and hyperplanes. Recently, [14, ICALP’07] found that the unboundederror quantum communication complexity in the one-way communication model can also be investigated using the arrangement, and showed th...

Faigle, U., R. Schrader and G. Turin, The communication complexity of interval orders, Discrete Applied Mathematics 40 (1992) 19-28. The communication complexity of interval orders is studied within the following model. Two players choose two elements x and y and want to determine whether x < y holds by exchanging as few bits of information as possible. It is shown that an optimal one-way proto...

Differential privacy (DP) is a well-studied notion of privacy that is generally achieved by randomizing outputs to preserve the privacy of the input records. A central problem in differential privacy is how much accuracy must be lost in order to preserve input privacy? Our work obtains general upper bounds on accuracy for differentially private two-party protocols computing any Boolean function...

Non-Interactive Multiparty Computations (Beimel et al., Crypto 2014) is a very powerful notion equivalent (under some corruption model) to garbled circuits, Private Simultaneous Messages protocols, and obfuscation. We present robust solutions to the problem of Non-Interactive Multiparty Computation in the computational and information-theoretic models. Our results include the first efficient an...

We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connections to many aspects of complexity theory, has seen a recent burst of research activity, seemingly preparing the ground for an Ω(n) lower bound, for constant k. Our first result is a surprising sublinear — i.e., o(n) ...

Let f ⊆ X × Y × Z be a relation. Let the public coin one-way communication complexity of f , with worst case error 1/3, be denoted R 1/3 (f). We show that if for computing fk (k independent copies of f), o(k ·R 1/3 (f)) communication is provided, then the success is exponentially small in k. This settles the strong direct product conjecture for all relations in public coin one-way communication...