24421 search results - page 57 / 4885 » Communicating Complex Systems |
148
click to vote
CRYPTO
2006
Springer
15 years 9 months ago
2006
Springer
We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively secur...
149
click to vote
ATAL
2004
Springer
15 years 10 months ago
2004
Springer
We study the complexity of a multilateral negotiation framework where autonomous agents agree on a sequence of deals to exchange sets of discrete resources in order to both furthe...
125
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
: We prove that coNP MA in the number-on-forehead model of multiparty communication complexity for up to k = (1 - )logn players, where > 0 is any constant. Specifically, we con...
150
click to vote
AAMAS
2005
Springer
15 years 5 months ago
2005
Springer
We study the complexity of a multilateral negotiation framework where autonomous agents agree on a sequence of deals to exchange sets of discrete resources in order to both further...
132
click to vote
ASIACRYPT
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...