16 search results - page 3 / 4 » Perfect Zero-Knowledge in Constant Rounds |
103
click to vote
CRYPTO
2001
Springer
15 years 4 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
97
Voted
IPL
2006
14 years 11 months ago
2006
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
SRDS
2003
IEEE
15 years 4 months ago
2003
IEEE
The perfectly synchronized round model provides the abstraction of crash-stop failures with atomic message delivery. This abstraction makes distributed programming very easy. We p...
IANDC
2007
14 years 11 months ago
2007
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
106
click to vote
PODC
2011
ACM
14 years 2 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...