Sciweavers

33 search results - page 6 / 7
» Probabilistic Byzantine Quorum Systems
Sort
View
EUROSYS
2011
ACM
13 years 2 months ago
DepSky: dependable and secure storage in a cloud-of-clouds
The increasing popularity of cloud storage services has lead companies that handle critical data to think about using these services for their storage needs. Medical record databa...
Alysson Neves Bessani, Miguel P. Correia, Bruno Qu...
DIALM
2007
ACM
144views Algorithms» more  DIALM 2007»
14 years 2 months ago
Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures
Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcas...
Vartika Bhandari, Nitin H. Vaidya
ICDCS
2003
IEEE
14 years 4 months ago
Responsive Security for Stored Data
We present the design of a distributed store that offers various levels of security guarantees while tolerating a limited number of nodes that are compromised by an adversary. The...
Subramanian Lakshmanan, Mustaque Ahamad, H. Venkat...
EUROSYS
2007
ACM
14 years 8 months ago
Antiquity: exploiting a secure log for wide-area distributed storage
Antiquity is a wide-area distributed storage system designed to provide a simple storage service for applications like file systems and back-up. The design assumes that all serve...
Hakim Weatherspoon, Patrick R. Eaton, Byung-Gon Ch...
ADHOCNOW
2004
Springer
14 years 4 months ago
Weathering the Storm: Managing Redundancy and Security in Ad Hoc Networks
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threat...
Mike Burmester, Tri Van Le, Alec Yasinsac