Responsive security for stored data

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2003, Pages 146-154

  Lakshmanan, Subramanian ^a   Ahamad, Mustaque ^a   Venkateswaran, H ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Availability; Byzantine fault tolerance; Confidentiality; Data integrity; Distributed storage service; Replication; Secret sharing; Security

Indexed keywords

AVAILABILITY; COMPUTER ARCHITECTURE; CRYPTOGRAPHY; DATA PROCESSING; FAULT TOLERANT COMPUTER SYSTEMS; INFORMATION RETRIEVAL SYSTEMS; NETWORK PROTOCOLS; PERFORMANCE; SERVERS;

BYZANTINE FAULT TOLERANCE; CONFIDENTIALITY; DATA INTEGRITY; DISTRIBUTED STORAGE SERVICE; REPLICATION; SECRET SHARING;

SECURITY OF DATA;

EID: 0037968842     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. The Aware Home Research Initiative, http://www.cc.gatech.edu/fce/ahri/, 2000.
2. Malkhi D., Reiter M., "Secure and Scalable Replication in Phalanx", Proc. 17th IEEE Symposium on Reliable Distributed Systems, October 1998.
3. Shamir A., "How to Share a Secret", Communications of the ACM, 22, 1979, pp.612-613.
4. Lamport L., Shostak R., Pease M., "The Byzantine Generals Problem", ACM Transactions on Programming Languages and Systems, 4(3), 1982.
5. Herzberg A., Jarecki S., Krawczyk H., and Yung M., "Proactive secret sharing," Advances in Cryptology, Crypto '95, Lecture Notes in Computer Science, 963, D. Coppersmith, Ed., 1995, Springer-Verlag.
6. Schneider F., "Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial", ACM Computing Surveys, Vol. 22, No. 4, December 1990.
7. Castro M., Liskov B., "Practical Byzantine Fault Tolerance", Proc. 3rd Symposium on Operating Systems Design and Implementation, New Orleans, Feb. 1999.
8. Scalable and Survivable Data Replication: The Fleet Project, http://www.bell-labs.com/user/reiter/fleet/.
9. Alvisi L., Malkhi D., Pierce E., Reiter M., Wright R., "Dynamic Byzantine Quorum Systems", Proc. International Conference on Dependable Systems and Networks, June 2000.
10. Blakley G., "Safeguarding Cryptographic Keys", Proc. Nat'l Computer Conf., American Federation of Information Processing Societies, Montvale, N.J., 1979, pp. 313-317.
11. Rabin M., "Efficient dispersal of information for security, load balancing and fault tolerance, Journal of the ACM, 36(2):335-348, 1989.
12. Tompa M. and Woll H., "How to Share a Secret with Cheaters,", Journal of Cryptology, Feb. 1988.
13. A. De Santis and B. Masucci, "Multiple Ramp Schemes," IEEE Trans. Information Theory, July 1999, pp. 1720-1728.
14. Feldman P., "A practical scheme for non-interactive verifiable secret sharing", in Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science, IEEE Press, 1987, 427-437.
15. Pederson T.P., "Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing", Proc. Crypto'91, LNCS 576, pp. 129-140.
16. Wylie J.J., Bigrigg M.W., Strunk J.D, Ganger D.R., Kiliccote H., and Khosla P.K., "Survivable information storage systems", IEEE Computer, 33(8):61-68, August 2000.
17. Demers A., Greene D., Hauser C., Irish W., Larson J., Shenker S., Sturgis H., Swinehart D, and Terry D., "Epidemic algorithms for replicated database maintenance", Proc. 6th Symposium on Principles of Distributed Computing, pp. 1-12, 1987.
18. Malkhi D., Mansour Y., and Reiter M., "On diffusing updates in a Byzantine environment", Proc. 18th IEEE Symposium on Reliable Distributed Systems, Oct. 1999.
19. Malkhi D., Pavlov E., Sella Y., "Optimal Unconditional Information Diffusion", Proceedings of the 15th International Symposium on Distributed Computing, pages 63-77, Lisbon, Portugal, 2001.
20. Minsky Y., Schneider F., "Tolerating Malicious Gossip", to appear in Distributed Computing, Technical Report, Cornell Computer Science TR2001-1853.
21. Fray JM., Deswarte Y. and Powell D., "Intrusion-tolerance using fine-grain fragmentation-scattering", Proc. 1986 IEEE Symposium on Security and Privacy, Oakland (CA), April 1986.
22. Lakshmanan S., Ahamad M., H. Venkateswaran, "A secure and highly available distributed store for meeting diverse data storage needs", Proc. 2001 International Conference on Dependable Systems and Networks, Goteborg, Sweden, July 2001.
23. Maurice P. Herlihy and J.D. Tygar, "How to make replicated data secure", Crypto '87.
24. Hugo Krawczyk, "Secret sharing made short", in Advances in Cryptology - CRYPTO '93, D. R. Stinson, ed., Lecture Notes in Computer Science 773 (1994), 136-146.
25. Hugo Krawczyk, "Distributed fingerprints and secure information dispersal", 12th ACM Symposium on Principles on Distributed Computing, Ithaca, NY, 1993.
26. Moni Naor and Avishai Wool, "Access Control and Signatures via Quorum Secret Sharing", IEEE Trans. Parallel and Distributed Sys 9(9), 1998.