20 search results - page 2 / 4 » Black-Box Constructions of Composable Protocols without Set-... |
STOC
2010
ACM
13 years 9 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
CTRSA
2006
Springer
13 years 8 months ago
2006
Springer
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
ASIACRYPT
2008
Springer
13 years 6 months ago
2008
Springer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
ASIACRYPT
2009
Springer
13 years 11 months ago
2009
Springer
A universally composable (UC) blind signature functionality requres users to commit to the message to be blindly signed. It is thereby impossible to realize in the plain model. Th...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...