Asynchronous verifiable information dispersal

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2005, Pages 191-201

  Cachin, Christian ^a   Tessaro, Stefane ^b  

^a IBM RESEARCH ZURICH   (Switzerland)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; CLIENT SERVER COMPUTER SYSTEMS; COMPUTATIONAL COMPLEXITY; DATA TRANSFER; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; INFORMATION SERVICES; STORAGE ALLOCATION (COMPUTER);

ASYNCHRONOUS NETWORKS; BYZANTINE FAULTS; COMMUNICATION COMPLEXITY; INFORMATION DISPERSAL;

DATA PROCESSING;

EID: 33749418149     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RELDIS.2005.9     Document Type: Conference Paper

References (20)

1. N. Alon, H. Kaplan, M. Krivelevich, D. Malkhi, and J. P. Stern, "Scalable secure storage when half the system is faulty," in Proc. 27th International Colloquium on Automata, Languages and Programming (ICALP), vol. 1853 of Lecture Notes in Computer Science, pp. 576-587, Springer, 2000.
2. N. Alon, H. Kaplan, M. Krivelevich, D. Malkhi, and J. P. Stern, "Addendum to scalable secure storage when half the system is faulty," Information and Computation, 2004. To appear.
3. R. E. Blahut, Theory and Practice of Error Control Codes. Reading: Addison-Wesley, 1983.
4. G. Bracha, "An asynchronous [(n -1)/3]-resilient consensus protocol," in Proc. 3rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 154-162, 1984.
5. C. Cachin, K. Kursawe, A. Lysyanskaya, and R. Strobl, "Asynchronous verifiable secret sharing and proactive cryptosystems," in Proc. 9th ACM Conference on Computer and Communications Security (CCS), pp. 88-97, 2002.
6. C. Cachin, K. Kursawe, F. Petzold, and V. Shoup, "Secure and efficient asynchronous broadcast protocols (extended abstract)," in Advances in Cryptology: CRYPTO 2001. vol. 2139 of Lecture Notes in Computer Science, pp. 524-541, Springer, 2001.
7. C. Cachin and S. Tessaro, "Asynchronous verifiable information dispersal," Research Report RZ 3569, IBM Research, Dec. 2004.
8. C. Cachin and S. Tessaro, "Optimal resilience for erasurecoded Byzantine distributed storage," Research Report RZ 3575, IBM Research, Feb. 2005.
9. P. Feldman, "A practical scheme for non-interactive verifiable secret sharing," in Proc. 28th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 427-437, 1987.
10. J. A. Garay, R. Gennaro, C. Jutla, and T. Rabin, "Secure distributed storage and retrieval," Theoretical Computer Science, vol. 243, no. 1-2, pp. 363-389, 2000.
11. O. Goldreich, Foundations of Cryptography, vol. I & II. Cambridge University Press, 2001-2004.
12. G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter, "Efficient Byzantine-tolerant erasure-coded storage," in Proc. International Conference on Dependable Systems and Networks (DSN-2004), pp. 135-144, 2004.
13. H. Krawczyk, "Distributed fingerprints and secure information dispersal," in Proc. 12th ACM Symposium on Principles of Distributed Computing (PODC), pp. 207-218, 1993.
14. H. Krawczyk, "Secret sharing made short," in Advances in Cryptology: CRYPTO '93, vol. 773 of Lecture Notes in Computer Science, pp. 136-146, Springer, 1994.
15. L. Lamport, R. Shostak, and M. Pease, "The Byzantine generals problem," ACM Transactions on Programming Languages and Systems, vol. 4, pp. 382-401, July 1982.
16. D. Malkhi and M. K. Reiter, "An architecture for survivable coordination in large distributed systems," IEEE Transactions on Knowledge and Data Engineering, vol. 12, no. 2, pp. 187-202, 2000.
17. M. A. Marsh and F. B. Schneider, "CODEX: A robust and secure secret distribution system," IEEE Transactions on Dependable and Secure Computing, vol. 1, no. 1, pp. 3447, 2004.
18. T. P. Pedersen, "Non-interactive and information-theoretic secure verifiable secret sharing," in Advances in Cryptology: CRYPTO' 91, vol. 576 of Lecture Notes in Computer Science, pp. 129-140, Springer, 1992.
19. M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance," Journal of the ACM, vol. 36, no. 2, pp. 335-348, 1989.
20. V. Shoup and R. Gennaro, "Securing threshold cryptosystems against chosen ciphertext attack," Journal of Cryptology, vol. 15, no. 2, pp. 75-96, 2002.