A Zero-One Law for Secure Multi-party Computation with Ternary Outputs

  • Gunnar Kreitz
Conference paper

DOI: 10.1007/978-3-642-19571-6_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6597)
Cite this paper as:
Kreitz G. (2011) A Zero-One Law for Secure Multi-party Computation with Ternary Outputs. In: Ishai Y. (eds) Theory of Cryptography. TCC 2011. Lecture Notes in Computer Science, vol 6597. Springer, Berlin, Heidelberg

Abstract

There are protocols to privately evaluate any function in the passive (honest-but-curious) setting assuming that the honest nodes are in majority. For some specific functions, protocols are known which remain secure even without an honest majority. The seminal work by Chor and Kushilevitz [7] gave a complete characterization of Boolean functions, showing that each Boolean function either requires an honest majority, or is such that it can be privately evaluated regardless of the number of colluding nodes.

The problem of discovering the threshold for secure evaluation of more general functions remains an open problem. Towards a resolution, we provide a complete characterization of the security threshold for functions with three different outputs. Surprisingly, the zero-one law for Boolean functions extends to ℤ3, meaning that each function with range ℤ3 either requires honest majority or tolerates up to n colluding nodes.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Gunnar Kreitz
    • 1
  1. 1.KTH – Royal Institute of TechnologySweden

Personalised recommendations