TY - GEN
T1 - The limits of common coins
T2 - 12th International Conference on Cryptology in India, INDOCRYPT 2011
AU - Maji, Hemanta K.
AU - Prabhakaran, Manoj
PY - 2011
Y1 - 2011
N2 - In [8] it was shown that the coin-tossing functionality 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 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 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.
AB - In [8] it was shown that the coin-tossing functionality 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 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 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.
UR - http://www.scopus.com/inward/record.url?scp=83755161509&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=83755161509&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-25578-6_25
DO - 10.1007/978-3-642-25578-6_25
M3 - Conference contribution
AN - SCOPUS:83755161509
SN - 9783642255779
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 344
EP - 358
BT - Progress in Cryptology, INDOCRYPT 2011 - 12th International Conference on Cryptology in India, Proceedings
Y2 - 11 December 2011 through 14 December 2011
ER -