Paper 2012/433
Impossibility Results for Static Input Secure Computation
Sanjam Garg, Abishek Kumarasubramanian, 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 standalone 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.
Note: A few minor edits and acknowledgements.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. CRYPTO 2012
- Keywords
- ImpossibilityStatic Input Concurrent Self-Composition
- Contact author(s)
- abishekk @ gmail com
- History
- 2012-09-12: last of 2 revisions
- 2012-08-05: received
- See all versions
- Short URL
- https://ia.cr/2012/433
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2012/433,
author = {Sanjam Garg and Abishek Kumarasubramanian and Rafail Ostrovsky and Ivan Visconti},
title = {Impossibility Results for Static Input Secure Computation},
howpublished = {Cryptology ePrint Archive, Paper 2012/433},
year = {2012},
note = {\url{https://eprint.iacr.org/2012/433}},
url = {https://eprint.iacr.org/2012/433}
}
