The communication complexity of private simultaneous messages, revisited

DOI10.1007/978-3-319-78375-8_9zbMath1428.94054OpenAlexW2794821878MaRDI QIDQ5915679

Thomas Holenstein, Ofer Shayevitz, Benny Applebaum, Manoj K. Mishra

Publication date: 9 July 2018

Published in: Advances in Cryptology – EUROCRYPT 2018 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-78375-8_9

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Communication theory (94A05)

Related Items (8)

Quadratic secret sharing and conditional disclosure of secrets ⋮ On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate ⋮ Measuring, simulating and exploiting the head concavity phenomenon in BKZ ⋮ Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation ⋮ Optimal linear multiparty conditional disclosure of secrets protocols ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ Unnamed Item ⋮ Placing conditional disclosure of secrets in the communication complexity universe

This page was built for publication: The communication complexity of private simultaneous messages, revisited