Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 497-498
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Asynchronous Verifiable Information Dispersal2005
- Optimal Resilience for Erasure-Coded Byzantine Distributed StorageLecture Notes in Computer Science, 2005
- Non-skipping Timestamps for Byzantine Data Storage Systems2004
- Efficient Byzantine-tolerant erasure-coded storage2004
- Minimal Byzantine Storage2002
- Practical Threshold Signatures2000
- Efficient dispersal of information for security, load balancing, and fault toleranceJournal of the ACM, 1989