In  it was shown that the coin-tossing functionality
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
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 : we show that
can be used to securely realize
SSFE functionality that cannot be realized in the computationally unbounded setting, if and only if there exists a semi-honest secure OT protocol.