Secure Two-Party Computation with Low Communication

  • Ivan Damgård
  • Sebastian Faust
  • Carmit Hazay
Conference paper

DOI: 10.1007/978-3-642-28914-9_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7194)
Cite this paper as:
Damgård I., Faust S., Hazay C. (2012) Secure Two-Party Computation with Low Communication. In: Cramer R. (eds) Theory of Cryptography. TCC 2012. Lecture Notes in Computer Science, vol 7194. Springer, Berlin, Heidelberg

Abstract

We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the circuit description of the function, and the workload for one of the parties is also only poly-logarithmic in the size of the circuit. This implies, for instance, delegatable computation that requires no expensive off-line phase and remains secure even if the server learns whether the client accepts its results. To achieve this, we define two new notions of extractable hash functions, propose an instantiation based on the knowledge of exponent in an RSA group, and build succinct zero-knowledge arguments in the CRS model.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Ivan Damgård
    • 1
  • Sebastian Faust
    • 1
  • Carmit Hazay
    • 1
  1. 1.Department of Computer ScienceAarhus UniversityDenmark

Personalised recommendations