Cryptology ePrint Archive: Report 2012/433

Impossibility Results for Static Input Secure Computation

Sanjam Garg and Abishek Kumarasubramanian and Rafail Ostrovsky and Ivan Visconti

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.

Category / Keywords: cryptographic protocols / Impossibility, Static Input Concurrent Self­-Composition

Publication Info: CRYPTO 2012

Date: received 31 Jul 2012, last revised 11 Sep 2012

Contact author: abishekk at gmail com

Available format(s): PDF | BibTeX Citation

Note: A few minor edits and acknowledgements.

Version: 20120912:012144 (All versions of this report)

Short URL: ia.cr/2012/433

Discussion forum: Show discussion | Start new discussion