Impossibility Results for Static Input Secure Computation

  • Sanjam Garg
  • Abishek Kumarasubramanian
  • Rafail Ostrovsky
  • Ivan Visconti
Conference paper

DOI: 10.1007/978-3-642-32009-5_25

Volume 7417 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Garg S., Kumarasubramanian A., Ostrovsky R., Visconti I. (2012) Impossibility Results for Static Input Secure Computation. In: Safavi-Naini R., Canetti R. (eds) Advances in Cryptology – CRYPTO 2012. Lecture Notes in Computer Science, vol 7417. Springer, Berlin, Heidelberg

Abstract

Consider a setting of two mutually distrustful parties Alice and Bob who want to securely evaluate some function on pre-specified inputs. The well studied notion of two-party secure computation allows them to do so in the stand-alone setting. Consider a deterministic function (e.g., 1-out-of-2 bit OT) that Alice and Bob can not evaluate trivially and which allows only Bob to receive the output. We show that Alice and Bob can not securely compute any such function in the concurrent setting even when their inputs are pre-specified. Our impossibility result also extends to all deterministic functions in which both Alice and Bob get the same output. Our results have implications in the bounded-concurrent setting as well.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2012 2012

Authors and Affiliations

  • Sanjam Garg
    • 1
  • Abishek Kumarasubramanian
    • 1
  • Rafail Ostrovsky
    • 1
  • Ivan Visconti
    • 2
  1. 1.UCLALos AngelesUSA
  2. 2.University of SalernoFiscianoItaly