Complete Fairness in Multi-party Computation without an Honest Majority

  • S. Dov Gordon
  • Jonathan Katz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5444)

Abstract

Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study of complete fairness in the multi-party case and demonstrate the first completely-fair protocols for non-trivial functions in this setting. We also provide evidence that achieving fairness is “harder” in the multi-party setting, at least with regard to round complexity.

References

  1. 1.
    Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: Proc. 18th Annual ACM Symposium on Theory of Computing (STOC), pp. 364–369 (1986)Google Scholar
  2. 2.
    Gordon, D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: Proc. 40th Annual ACM Symposium on Theory of Computing (STOC) (2008)Google Scholar
  3. 3.
    Chor, B., Ishai, Y.: On privacy and partition arguments. Inf. Comput. 167(1), 2–9 (2001)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Kilian, J., Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and completeness in private computations. SIAM J. Computing 29(4), 1189–1208 (2000)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. SIAM Journal of Discrete Math 4(1), 36–47 (1991)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: On combining privacy with guaranteed output delivery in secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 483–500. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Gordon, S.D., Katz, J.: Complete fairness in multi-party computation without an honest majority. In: 6th Theory of Cryptography Conference, TCC (2009), http://eprint.iacr.org/2008/458
  8. 8.
    Goldreich, O.: Foundations of Cryptography, Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)CrossRefMATHGoogle Scholar
  9. 9.
    Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143–202 (2000)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • S. Dov Gordon
    • 1
  • Jonathan Katz
    • 1
  1. 1.Dept. of Computer ScienceUniversity of MarylandUSA

Personalised recommendations