100 search results - page 6 / 20 » Asynchronous Secure Multiparty Computation in Constant Time |
STOC
2010
ACM
14 years 1 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...
STOC
2000
ACM
14 years 4 days ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
ASIACRYPT
2007
Springer
14 years 17 days ago
2007
Springer
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
AINA
2011
IEEE
13 years 6 days ago
2011
IEEE
—The advent of distributed and ad-hoc-connected systems such as in Ambient Intelligence applications confronts developers with the question on how to specify QoS- and security po...
ESOP
2012
Springer
12 years 4 months ago
2012
Springer
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...