99 search results - page 14 / 20 » Approximation Hardness and Secure Communication in Broadcast... |
TCC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We introduce Fair Zero-Knowledge, a multi-verifier ZK system where every proof is guaranteed to be “zero-knowledge for all verifiers.” That is, if an honest verifi...
WISEC
2009
ACM
15 years 4 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
82
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We investigate secure communications for a four-node relayeavesdropper channel with multiple data stream transmission, assuming that the eavesdropper’s channel state information...
85
Voted
TGC
2007
Springer
15 years 3 months ago
2007
Springer
Distributed applications can be structured using sessions that specify flows of messages between roles. We design a small specific language to declare sessions. We then build a c...
PODC
2012
ACM
12 years 12 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...