The limits of common coins: Further results

Hemanta K. Maji, Manoj Prabhakaran

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationProgress in Cryptology, INDOCRYPT 2011 - 12th International Conference on Cryptology in India, Proceedings
Pages344-358
Number of pages15
DOIs
StatePublished - Dec 23 2011
Event12th International Conference on Cryptology in India, INDOCRYPT 2011 - Chennai, India
Duration: Dec 11 2011Dec 14 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7107 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Conference on Cryptology in India, INDOCRYPT 2011
CountryIndia
CityChennai
Period12/11/1112/14/11

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'The limits of common coins: Further results'. Together they form a unique fingerprint.

Cite this