9 search results - page 2 / 2 » Player Simulation and General Adversary Structures in Perfec... |
CG
2006
Springer
13 years 8 months ago
2006
Springer
We apply Monte Carlo simulation and alpha-beta search to the card game of Skat, which is similar to Bridge, but different enough to require some new algorithmic ideas besides the t...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We intr...
INDOCRYPT
2003
Springer
13 years 10 months ago
2003
Springer
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...