Sciweavers

314 search results - page 23 / 63
» A Comparison of Known Codes, Random Codes, and the Best Code...
Sort
View
INFOCOM
2012
IEEE
11 years 11 months ago
Experimental performance comparison of Byzantine Fault-Tolerant protocols for data centers
Abstract—In this paper, we implement and evaluate three different Byzantine Fault-Tolerant (BFT) state machine replication protocols for data centers: (1) BASIC: The classic solu...
Guanfeng Liang, Benjamin Sommer, Nitin H. Vaidya
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 3 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
CIC
2006
121views Communications» more  CIC 2006»
13 years 10 months ago
Performance Studies of a Coding Scheme for a Slepian-Wolf Source Network
- We investigate the simplest Slepian-Wolf source network, consisting of an information source correlated with a second source used as a side-information for the decoder but not th...
Azizuddin Abdul Aziz, John C. Kieffer
ASIACRYPT
2001
Springer
14 years 1 months ago
How to Achieve a McEliece-Based Digital Signature Scheme
Abstract. McEliece is one of the oldest known public key cryptosystems. Though it was less widely studied than RSA, it is remarkable that all known attacks are still exponential. I...
Nicolas Courtois, Matthieu Finiasz, Nicolas Sendri...
VEE
2006
ACM
142views Virtualization» more  VEE 2006»
14 years 2 months ago
Secure and practical defense against code-injection attacks using software dynamic translation
One of the most common forms of security attacks involves exploiting a vulnerability to inject malicious code into an executing application and then cause the injected code to be ...
Wei Hu, Jason Hiser, Daniel Williams, Adrian Filip...