Paper 2021/1037

Randomness Bounds for Private Simultaneous Messages and Conditional Disclosure of Secrets

Abstract

In cryptography, the private simultaneous messages (PSM) and conditional disclosure of secrets (CDS) are closely related fundamental primitives. We consider $k$-party PSM and CDS protocols for a function $f$ with a common random string, where each party $P_i$ generates a message and sends it to a referee $P_0$. We consider bounds for the optimal length $\rho$ of the common random string among $k$ parties (or, {\it randomness complexity}) in PSM and CDS protocols with perfect and statistical privacy through combinatorial and entropic arguments. ($i$) We provide general connections from the optimal total length $\lambda$ of the messages (or, {\it communication complexity}) to the randomness complexity $$. ($$) We also prove randomness lower bounds in PSM and CDS protocols for general functions. ($$) We further prove randomness lower bounds for several important explicit functions. They contain the following results: For PSM protocols with perfect privacy, we prove $$ as the general connection. From the general lower bound, we prove $$ for a general function $$ under universal reconstruction, in which $$ is independent of $$. This implies that the Feige-Killian-Naor PSM protocol for a general function [Proc.~STOC '94, pp.554--563] is optimal with respect to randomness complexity. We also provide a randomness lower bound $$ for a generalized inner product function. This implies the optimality of the $$-party PSM protocol for the inner-product function of Liu, Vaikuntanathan, and Wee [Proc.~CRYPTO 2017, pp.758--790]. For CDS protocols with perfect privacy, we show $$ as the general connection by similar argument to those for PSM protocols, where $$ is the length of secrets. We also obtain randomness lower bounds $$ for XOR, AND, and generalized inner product functions. These imply the optimality of Applebaum and Arkis's $$-party CDS protocol for a general function [Proc. TCC 2018, pp.317--344] up to a constant factor in a large $$.

Note: Theorems 3 and 6 (randomness upper bounds by communication complexity) in the previous version had a technical flaw. We have deleted them and the related theorems in the latest version.