Show simple item record

dc.contributor.advisorMicali, Silvioen_US
dc.contributor.authorRogaway, Phillipen_US
dc.date.accessioned2023-03-29T15:17:46Z
dc.date.available2023-03-29T15:17:46Z
dc.date.issued1991-04
dc.identifier.urihttps://hdl.handle.net/1721.1/149705
dc.description.abstractAssume we have a network of three of more players, each player in possession of some private input. The players want to compute some function of these private inputs, but in a way which protects the privacy of each participant's contribution.en_US
dc.relation.ispartofseriesMIT-LCS-TR-503
dc.titleThe Round Complexity of Secure Protocolsen_US
dc.identifier.oclc23811375


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record