Abstract
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 language | American English |
---|---|
Title of host publication | twenty-second annual symposium on Principles of distributed computing |
State | Published - 2003 |