718 search results - page 121 / 144 » Operational Semantics of Security Protocols |
ICDCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily. However, these systems are not so successful when confronted with Byzan...
CCGRID
2002
IEEE
14 years 24 days ago
2002
IEEE
A scalable and expressive peer-to-peer (P2P) networking and computing framework requires efficient resource discovery services. Here we propose NEVRLATE, for Network-Efficient V...
WOTE
2010
13 years 6 months ago
2010
We present a K-out-of-L voting scheme, i.e., a voting scheme that allows every voter to vote for (up to) K candidates from a set of L candidates. The scheme is receipt-free, which ...
SOSP
2007
ACM
14 years 4 months ago
2007
ACM
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
HPDC
2007
IEEE
14 years 2 months ago
2007
IEEE
Grid computations require global access to massive data stores. To meet this need, the GridNFS project aims to provide scalable, high-performance, transparent, and secure wide-are...