Sciweavers

1923 search results - page 131 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
15 years 10 months ago
On the composition of authenticated byzantine agreement
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
CCR
2006
110views more  CCR 2006»
14 years 10 months ago
On the feasibility of commercial, legal P2P content distribution
A spirited panel was recently held at the 10th International Web Caching and Content Distribution workshop on the future of P2P in content distribution [1]. After more than ten ye...
Pablo Rodriguez, See-Mong Tan, Christos Gkantsidis
JSAC
2011
142views more  JSAC 2011»
14 years 4 months ago
A Distributed Key Management Framework with Cooperative Message Authentication in VANETs
Abstract—In this paper, we propose a distributed key management framework based on group signature to provision privacy in vehicular ad hoc networks (VANETs). Distributed key man...
Yong Hao, Yu Cheng, Chi Zhou, Wei Song
WWW
2003
ACM
15 years 10 months ago
A Web Service Market Model based on Dependencies
The construction of composite Web Services from service fragments requires semantic descriptions of service offers and service requests. We propose the use of dependencies as a mo...
Robert Tolksdorf, Christian Bizer, Ralf Heese
CCS
2010
ACM
14 years 8 months ago
Designs to account for trust in social network-based sybil defenses
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
Abedelaziz Mohaisen, Nicholas Hopper, Yongdae Kim