Brief announcement: impossibility results for concurrent secure two-party computation

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


This brief announcement describes two impossibility results regarding the concurrent composition of secure two-party protocols in the plain model (ie, where no setup assumption like a common reference string is assumed). In the setting of two-party computation, two parties wish to jointly compute some function of their private inputs. Loosely speaking, the security requirements are that nothing is learned from the protocol other than the output (privacy), and that the output is distributed according to the prescribed functionality
Original languageAmerican English
Title of host publicationtwenty-second annual symposium on Principles of distributed computing
StatePublished - 2003

Bibliographical note

Place of conference:Boston


Dive into the research topics of 'Brief announcement: impossibility results for concurrent secure two-party computation'. Together they form a unique fingerprint.

Cite this