scientific article; zbMATH DE number 7559107

DOI10.4230/LIPIcs.ITCS.2019.64MaRDI QIDQ5090444

Adi Rosén, Florent Urrutia

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1901.01178

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

multi-party communication complexityinformation complexitycommunication complexityprivate computationpeer-to-peer communication complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

Lower and upper bounds on the randomness complexity of private computations of AND ⋮ Random sources in private computation ⋮ Bounds on oblivious multiparty quantum communication complexity ⋮ Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• A full proof of the BGW protocol for perfectly secure multiparty computation
• An information statistics approach to data stream and communication complexity
• On the distributional complexity of disjointness
• On data structures and asymmetric communication complexity
• Characterizing linear size circuits in terms of privacy
• Randomness complexity of private computation
• Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy
• A minimal model for secure computation (extended abstract)
• How to compress interactive communication
• Communication complexity of approximate matching in distributed graphs
• Information Equals Amortized Communication
• The Range of Topological Effects on Communication
• Interactive Information Complexity
• Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
• The Probabilistic Communication Complexity of Set Intersection
• Privacy, additional information and communication
• Randomness in Private Computations
• Multi-Party Protocols, Information Complexity and Privacy
• Communication Complexity
• $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation
• An Optimal Lower Bound for Distinct Elements in the Message Passing Model
• Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness
• Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence
• Distributed verification and hardness of distributed approximation
• From information to exact communication

This page was built for publication: