Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions

Autor:	Nikolaos Makriyannis, Eran Omri, Amos Beimel, Gilad Asharov
Rok vydání:	2015
Předmět:	Discrete mathematics Property (philosophy) Theoretical computer science Boolean circuit Secure two-party computation Secure multi-party computation Function (mathematics) Circuit minimization for Boolean functions Characterization (mathematics) Boolean function Mathematics
Zdroj:	Theory of Cryptography ISBN: 9783662464939 TCC (1)
Popis:	Fairness is a desirable property in secure computation; informally it means that if one party gets the output of the function, then all parties get the output. Alas, an implication of Cleve’s result (STOC 86) is that when there is no honest majority, in particular in the important case of the two-party setting, there exist Boolean functions that cannot be computed with fairness. In a surprising result, Gordon et al. (JACM 2011) showed that some interesting functions can be computed with fairness in the two-party setting, and re-opened the question of understanding which Boolean functions can be computed with fairness, and which cannot.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::d13e15c52eb72f9d0e631a597fd05d71 https://doi.org/10.1007/978-3-662-46494-6_10 Zobrazit plný text záznamu