Skip to main navigation Skip to search Skip to main content

Brief Announcement: Impossibility Results for Concurrent Secure Two-Party Computation

  • IBM

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

The results regarding the concurrent composition of security two-party protocols in the plain model were described. Two types of composition were distinguished where the distinction related to the question of which protocols were being run together in the network. The first type, called self composition considered the case where a single protocol is executed many times in a network, while the second type, called general composition considered the case where many different protocols were run together in the network. The result showed that the lower bound leaves open the possibility of obtaining positive results.

Original languageEnglish
Title of host publicationProceedings of the Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003
PublisherAssociation for Computing Machinery
Pages200
Number of pages1
ISBN (Print)1581137087
DOIs
StatePublished - 13 Jul 2003
Externally publishedYes
Event22nd Annual ACM Symposium on Principles of Distributed Computing, PODC 2003 - Boston, MA, United States
Duration: 13 Jul 200316 Jul 2003

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing
Volume22

Conference

Conference22nd Annual ACM Symposium on Principles of Distributed Computing, PODC 2003
Country/TerritoryUnited States
CityBoston, MA
Period13/07/0316/07/03

Fingerprint

Dive into the research topics of 'Brief Announcement: Impossibility Results for Concurrent Secure Two-Party Computation'. Together they form a unique fingerprint.

Cite this