TY - GEN

T1 - Distribution design

AU - Beimel, Amos

AU - Gabizon, Ariel

AU - Ishai, Yuval

AU - Kushilevitz, Eyal

N1 - Funding Information:
The third and fourth authors were supported by ISF grant 1709/14 and BSF grant 2012378.

PY - 2016/1/14

Y1 - 2016/1/14

N2 - Motivated by applications in cryptography, we introduce and study the problem of distribution design. The goal of distribution design is to find a joint distribution on n ran-dom variables that satisfies a given set of constraints on the marginal distributions. Each constraint can either require that two sequences of variables be identically distributed or, alternatively, that the two sequences have disjoint supports. We present several positive and negative results on the exis-Tence and efficiency of solutions for a given set of constraints. Distribution design can be seen as a strict generalization of several well-studied problems in cryptography. These in-clude secret sharing, garbling schemes, and non-interactive protocols for secure multiparty computation. We further motivate the problem and our results by demonstrating their usefulness towards realizing non-interactive protocols for ad-hoc secure multiparty computation, in which any subset of the parties may choose to participate and the identity of the participants should remain hidden to the extent possible.

AB - Motivated by applications in cryptography, we introduce and study the problem of distribution design. The goal of distribution design is to find a joint distribution on n ran-dom variables that satisfies a given set of constraints on the marginal distributions. Each constraint can either require that two sequences of variables be identically distributed or, alternatively, that the two sequences have disjoint supports. We present several positive and negative results on the exis-Tence and efficiency of solutions for a given set of constraints. Distribution design can be seen as a strict generalization of several well-studied problems in cryptography. These in-clude secret sharing, garbling schemes, and non-interactive protocols for secure multiparty computation. We further motivate the problem and our results by demonstrating their usefulness towards realizing non-interactive protocols for ad-hoc secure multiparty computation, in which any subset of the parties may choose to participate and the identity of the participants should remain hidden to the extent possible.

KW - Garbling schemes

KW - Multi-input functional encryption

KW - Obfuscation

KW - Secret sharing

KW - Secure multiparty computation

UR - http://www.scopus.com/inward/record.url?scp=84966521199&partnerID=8YFLogxK

U2 - 10.1145/2840728.2840759

DO - 10.1145/2840728.2840759

M3 - Conference contribution

AN - SCOPUS:84966521199

T3 - ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science

SP - 81

EP - 92

BT - ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science

PB - Association for Computing Machinery, Inc

T2 - 7th ACM Conference on Innovations in Theoretical Computer Science, ITCS 2016

Y2 - 14 January 2016 through 16 January 2016

ER -