Paper 2010/449

Oblivious and Fair Server-Aided Two-Party Computation

Amir Herzberg and Haya Shulman


We show efficient, practical (server-aided) secure two-party computation protocols ensuring privacy, correctness and fairness in the presence of malicious (Byzantine) faults. Our requirements from the server are modest: to ensure privacy and correctness, we only assume offline set-up prior to protocol execution; and to also ensure fairness, we further assume a trusted-decryption service, providing decryption service using known public key. The fairness-ensuring protocol is optimistic, i.e., the decryption service is invoked only in case of faults. Both assumptions are feasible in practice and formally presented in the hybrid model. The resulting protocols may be sufficiently efficient, to allow deployment, in particular for financial applications.

Available format(s)
Publication info
Published elsewhere. International Conference on Availability, Reliability and Security (ARES) 2012
Two-party computationfair optimistic protocolsserver-aided computation
Contact author(s)
haya shulman @ gmail com
2012-10-19: last of 7 revisions
2010-08-18: received
See all versions
Short URL
Creative Commons Attribution


      author = {Amir Herzberg and Haya Shulman},
      title = {Oblivious and Fair Server-Aided Two-Party Computation},
      howpublished = {Cryptology ePrint Archive, Paper 2010/449},
      year = {2010},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.