• DocumentCode
    3663129
  • Title

    Common randomness for secure computing

  • Author

    Prakash Narayan;Himanshu Tyagi;Shun Watanabe

  • Author_Institution
    Department of Electrical and Computer Engineering, and the Institute for Systems Research, University of Maryland, College Park, 20742, USA
  • fYear
    2015
  • fDate
    6/1/2015 12:00:00 AM
  • Firstpage
    949
  • Lastpage
    953
  • Abstract
    We revisit A.C. Yao´s classic problem of secure function computation by interactive communication, in an information theoretic setting. Our approach, based on examining the underlying common randomness, provides a new proof of the characterization of a securely computable function by deterministic protocols. This approach also yields a characterization of the minimum communication needed for secure computability.
  • Keywords
    "Protocols","Complexity theory","Cryptography","Entropy","Joints","Information theory"
  • Publisher
    ieee
  • Conference_Titel
    Information Theory (ISIT), 2015 IEEE International Symposium on
  • Electronic_ISBN
    2157-8117
  • Type

    conf

  • DOI
    10.1109/ISIT.2015.7282595
  • Filename
    7282595
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3663129