Limits of Random Oracles in Secure Computation
Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran

TL;DR
This paper explores the fundamental limits of using random oracles in secure two-party computation, showing that one-way functions have significant black-box separation from most secure functionalities, especially under semi-honest security models.
Contribution
It provides a complete characterization of the power of one-way functions in deterministic 2-party secure function evaluation, highlighting their limitations and the role of ideal functionalities.
Findings
One-way functions are separated from all deterministic 2-party SFE functionalities with unconditional security.
Under active security, one-way functions are only as useful as ideal commitment functionalities.
The main technical result establishes the limitations of random oracles in secure computation.
Abstract
The seminal result of Impagliazzo and Rudich (STOC 1989) gave a black-box separation between one-way functions and public-key encryption: informally, a public-key encryption scheme cannot be constructed using one-way functions as the sole source of computational hardness. In addition, this implied a black-box separation between one-way functions and protocols for certain Secure Function Evaluation (SFE) functionalities (in particular, Oblivious Transfer). Surprisingly, however, {\em since then there has been no further progress in separating one-way functions and SFE functionalities} (though several other black-box separation results were shown). In this work, we present the complete picture for deterministic 2-party SFE functionalities. We show that one-way functions are black-box separated from {\em all such SFE functionalities}, except the ones which have unconditionally secure…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Complexity and Algorithms in Graphs · Privacy-Preserving Technologies in Data
