Sciweavers

53 search results - page 7 / 11
» Evaluating Byzantine Quorum Systems
Sort
View
ICDCS
2003
IEEE
14 years 23 days 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...
NSDI
2007
13 years 9 months ago
Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems
Byzantine fault tolerant systems behave correctly when no more than f out of 3f + 1 replicas fail. When there are more than f failures, traditional BFT protocols make no guarantee...
Jinyuan Li, David Mazières
SOSP
2007
ACM
14 years 4 months ago
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
Ben Vandiver, Hari Balakrishnan, Barbara Liskov, S...
DSN
2008
IEEE
14 years 1 months ago
Byzantine replication under attack
Existing Byzantine-resilient replication protocols satisfy two standard correctness criteria, safety and liveness, in the presence of Byzantine faults. In practice, however, fault...
Yair Amir, Brian A. Coan, Jonathan Kirsch, John La...
IJDAR
2008
92views more  IJDAR 2008»
13 years 7 months ago
Optical recognition of psaltic Byzantine chant notation
Abstract This paper describes a document recognition system for the modern neume based notation of Byzantine music. We propose algorithms for page segmentation, lyrics removal, syn...
Christoph Dalitz, Georgios K. Michalakis, Christin...