Explicit Lower Bounds for Communication Complexity of PSM for Concrete Functions

ePrint Report: Explicit Lower Bounds for Communication Complexity of PSM for Concrete Functions

Kazumasa Shinagawa, Koji Nuida

Private Simultaneous Messages (PSM) is a minimal model of secure computation, where the input players with shared randomness send messages to the output player simultaneously and only once. In this field, finding upper and lower bounds on communication complexity of PSM protocols is important, and in particular, identifying the optimal one where the upper and lower bounds coincide is the ultimate goal. However, …

communication complexity computation concrete eprint report explicit functions input messages player players private randomness report secure computation send