Sciweavers

989 search results - page 195 / 198
» An information-based model for trust
Sort
View
JOC
2008
86views more  JOC 2008»
14 years 10 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
74
Voted
CORR
2010
Springer
86views Education» more  CORR 2010»
14 years 9 months ago
Secure Multiparty Computation with Partial Fairness
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
Amos Beimel, Eran Omri, Ilan Orlov
INFOCOM
2010
IEEE
14 years 8 months ago
Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing
—Cloud computing is an emerging computing paradigm in which resources of the computing infrastructure are provided as services over the Internet. As promising as it is, this para...
Shucheng Yu, Cong Wang, Kui Ren, Wenjing Lou
SIGSOFT
2010
ACM
14 years 8 months ago
Finding latent performance bugs in systems implementations
Robust distributed systems commonly employ high-level recovery mechanisms enabling the system to recover from a wide variety of problematic environmental conditions such as node f...
Charles Edwin Killian, Karthik Nagaraj, Salman Per...
ICTAC
2009
Springer
14 years 8 months ago
A First-Order Policy Language for History-Based Transaction Monitoring
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
Andreas Bauer 0002, Rajeev Goré, Alwen Tiu