Sciweavers

129 search results - page 2 / 26
» Strong Accountability for Network Storage
Sort
View
NDSS
2009
IEEE
13 years 12 months ago
CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable
We describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, we can generate a pseudo-random sequence and a proof that the elem...
Michael Backes, Peter Druschel, Andreas Haeberlen,...
CCS
2010
ACM
13 years 4 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
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 5 months ago
Securing Internet Protocol (IP) Storage: A Case Study
Storage networking technology has enjoyed strong growth in recent years, but security concerns and threats facing networked data have grown equally fast. Today, there are many pot...
Siva Rama Krishnan Somayaji, Ch. A. S. Murty
SIROCCO
2008
13 years 6 months ago
Centralized Communication in Radio Networks with Strong Interference
We study communication in known topology radio networks with the presence of interference constraints. We consider a real-world situation, when a transmission of a node produces an...
Frantisek Galcík
SIGOPSE
2004
ACM
13 years 10 months ago
Separating durability and availability in self-managed storage
Building reliable data storage from unreliable components presents many challenges and is of particular interest for peer-to-peer storage systems. Recent work has examined the tra...
Geoffrey Lefebvre, Michael J. Feeley