Sciweavers

146 search results - page 6 / 30
» How to Make Replicated Data Secure
Sort
View
COLCOM
2005
IEEE
14 years 1 months ago
Providing both scale and security through a single core probabilistic protocol
Distributed systems are typically designed for scale and performance first, which makes it difficult to add security later without affecting the original properties. This paper ...
Ramsés Morales, Indranil Gupta
GCC
2005
Springer
14 years 1 months ago
Incorporating Data Movement into Grid Task Scheduling
Task Scheduling is a critical design issue of distributed computing. The emerging Grid computing infrastructure consists of heterogeneous resources in widely distributed autonomous...
Xiaoshan He, Xian-He Sun
SP
2010
IEEE
192views Security Privacy» more  SP 2010»
13 years 11 months ago
How Good Are Humans at Solving CAPTCHAs? A Large Scale Evaluation
—Captchas are designed to be easy for humans but hard for machines. However, most recent research has focused only on making them hard for machines. In this paper, we present wha...
Elie Bursztein, Steven Bethard, Celine Fabry, John...
ICDCS
2002
IEEE
14 years 13 days ago
Bidding for Storage Space in a Peer-to-Peer Data Preservation System
Digital archives protect important data collections from failures by making multiple copies at other archives, so that there are always several good copies of a collection. In a c...
Brian F. Cooper, Hector Garcia-Molina
IPAW
2010
13 years 5 months ago
Publishing and Consuming Provenance Metadata on the Web of Linked Data
The World Wide Web evolves into a Web of Data, a huge, globally distributed dataspace that contains a rich body of machineprocessable information from a virtually unbound set of pr...
Olaf Hartig, Jun Zhao