Sciweavers

947 search results - page 105 / 190
» Fault Tolerant Computation on Ensemble Quantum Computers
Sort
View
ICDCN
2010
Springer
16 years 1 months ago
Authenticated Byzantine Generals in Dual Failure Model
Pease et al. introduced the problem of Byzantine Generals (BGP) to study the effects of Byzantine faults in distributed protocols for reliable broadcast. It is well known that BG...
Anuj Gupta, Prasant Gopal, Piyush Bansal, Kannan S...
HASE
1996
IEEE
15 years 10 months ago
Adaptive recovery for mobile environments
Mobile computing allows ubiquitous and continuousaccess to computing resources while the users travel or work at a client's site. The flexibility introduced by mobile computi...
Nuno Neves, W. Kent Fuchs
DSN
2004
IEEE
15 years 10 months ago
Automated Synthesis of Multitolerance
We concentrate on automated synthesis of multitolerant programs, i.e., programs that tolerate multiple classes of faults and provide a (possibly) different level of fault-toleranc...
Sandeep S. Kulkarni, Ali Ebnenasir
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
15 years 7 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
DEBS
2010
ACM
15 years 4 months ago
Reliable fault-tolerant sensors for distributed systems
Providing reliable fault-tolerant sensors is a challenge for distributed systems. The demonstration setup combines three sensors and allows to inject different faults that are rel...
Sebastian Zug, Michael Schulze, André Dietr...