Impossibility results for static input secure computation

15Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.

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. © 2012 International Association for Cryptologic Research.

Cite

CITATION STYLE

APA

Garg, S., Kumarasubramanian, A., Ostrovsky, R., & Visconti, I. (2012). Impossibility results for static input secure computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7417 LNCS, pp. 424–442). https://doi.org/10.1007/978-3-642-32009-5_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free