Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Impossibility Results for Static Input Secure Computation
verfasst von : Sanjam Garg, Abishek Kumarasubramanian, Rafail Ostrovsky, Ivan Visconti
Erschienen in: Advances in Cryptology – CRYPTO 2012
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.