Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
More general completeness theorems for secure two-party computation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The All-or-Nothing Nature of Two-Party Secure Computation
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Semi-honest to malicious oblivious transfer: the black-box way
TCC'08 Proceedings of the 5th conference on Theory of cryptography
A zero-one law for cryptographic complexity with respect to computational UC security
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Completeness theorems with constructive proofs for finite deterministic 2-party functions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Exploring the limits of common coins using frontier analysis of protocols
TCC'11 Proceedings of the 8th conference on Theory of cryptography
| Hi-index | 0.00 |
In [8] it was shown that the coin-tossing functionality $\mathcal{F}_{coin}$ has limited use in 2-party secure function evaluation (SFE) in the computationally unbounded (a.k.a information-theoretic) setting. Further it was shown that for $\mathcal{F}_{coin}$ to be useful in securely realizing any one in a a large class of symmetric SFE (SSFE) functionalities, a certain computational assumption (namely the existence of a semi-honest secure OT protocol) is necessary and sufficient. In this work, we close a gap in the class of SSFE functionalities for which this result was proven in [8]: we show that $\mathcal{F}_{coin}$ can be used to securely realize any SSFE functionality that cannot be realized in the computationally unbounded setting, if and only if there exists a semi-honest secure OT protocol.