292 search results - page 2 / 59 » Communication and Round Efficient Information Checking Proto... |
CRYPTO
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
IPPS
2005
IEEE
13 years 11 months ago
2005
IEEE
Sigma, the first single-round group membership (GM) algorithm, was recently introduced and demonstrated to operate consistently with theoretical expectations in a simulated WAN en...
PODS
2006
ACM
14 years 6 months ago
2006
ACM
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
SEC
2001
13 years 7 months ago
2001
Abstract Traditionally, research in secure group key agreement focuses on minimizing the computational overhead for cryptographic operations, and minimizing the communication overh...
ASIACRYPT
2007
Springer
13 years 10 months 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...