Secure distributed storage and retrieval

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1320, Issue , 1997, Pages 275-289

  Garay, Juan A ^a   Gennaro, Rosario ^a   Jutla, Chaxanjit ^a   Rabin, Tal ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

CRYPTOGRAPHIC TECHNIQUES; DISTRIBUTED KEY MANAGEMENT; DISTRIBUTED STORAGE; INFORMATION DISPERSAL ALGORITHMS; MALICIOUS FAULTS; SECRET SHARING SCHEMES; SPACE-OPTIMALITY; THRESHOLD CRYPTOGRAPHY;

DIGITAL STORAGE;

EID: 84949189366     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030690     Document Type: Conference Paper

References (29)

1. Blahut R., Theory and Practice of Error Control Codes, Addison-Wesley, 1984.
2. C. Boyd. Digital Multisignatures. In H. Baker and F. Piper, editors, Cryptography and Coding, pages 241-246. Claredon Press, 1986.
3. Bellare M., Canetti R. and Krawczyk H., “Keying Hash Functions for Message Authentication,” Proc. Advances in Cryptology - CRYPTO '96, LNCS Vol. 1109, Springer-Verlag, pp. 1-15, 1996.
4. Berlekamp B. and Welch L., “Error Correction of Algebraic Block Codes,” US Patent 4,633,470.
5. D. Chaum, “Blind signatures for untraceable payments,” Proc. CRYPTO 82, pp. 199-203, 1983.
6. P. Chen, J. Garay, A. Herzberg, and H. Krawczyk. “Design and Implementation of Modular Key Management Protocol and IP Secure Tunnel,” Proc. USENIX Security '95, Salt Lake City, Utah, June 1995.
7. Chor, B., Goldwasser, S., Micali, S., and Awerbuch, B., “Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults,” Proc. 26th Annual IEEE Symposium on the Foundations of Computer Science, pp. 383-395, 1985.
8. M. Cerecedo, T. Matsumoto, and H. Imai. Efficient and Secure Multiparty Generation of Digital Signatures Based on Discrete Logarithms. IEICE Trans. Fundamentals, E76-A(4):532-545, April 1993. US Patent 4,633,470.
9. R. A. Croft and S. P. Harris. Public-key cryptography and re-usable shared secrets. In H. Baker and F. Piper, editors, Cryptography and Coding, pages 189-201. Claredon Press, 1989.
10. A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. In Proc. 26th ACM Symp. on Theory of Computing, pages 522-533, Santa Fe, 1994. IEEE.
11. Y. Desmedt. Society and group oriented cryptography: A new concept. In Carl Pomerance, editor, Proc. CRYPTO 87, pages 120-127. Springer-Verlag, 1988. Lecture Notes in Computer Science No. 293.
12. Y.G. Desmedt. Threshold cryptography. European Transactions on Telecommunications, 5(4):449-457, July 1994.
13. Y. Desmedt and Y. Frankel. Threshold cryptosystems. In G. Brassard, editor, Proc. CRYPTO 89, pages 307-315. Springer-Verlag, 1990. Lecture Notes in Computer Science No. 435.
14. Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In J. Feigenbaum, editor, Proc. CRYPTO 91, pages 457-469. Springer, 1992. Lecture Notes in Computer Science No. 576.
15. “Entrust-Enterprise-Wide Encryption and Digital Signatures,” System Overview and Installation Guide.
16. Y. Frankel, P. Gemmell, and M. Yung. Witness-based Cryptographic Program Checking and Robust Function Sharing. In Proceedings of the ACM Symposium on Theory of Computing, 1996.
17. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust Threshold DSS Signatures. In Advances in Cryptology-EUROCRYPT'96, Lecture Notes in Computer Science vol.1070, Springer-Verlag, 1996.
18. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and Efficient Sharing of RSA Functions. In Advances in Cryptology-CRYPTO'96, Lecture Notes in Computer Science vol.1109, pp.157-172, Springer-Verlag, 1996.
19. L. Harn. Group oriented (t,n) digital signature scheme. IEE Proc.-Comput.Digit.Tech, 141(5), Sept 1994.
20. T. Hardjono and J. Seberry, “Strongboxes for Electronic Commerece,” Proc. 2nd USENIX Workshop on Electronic Commerece, pp. 135-145, Oakland, CA, November 1996.
21. Hickman, K. E. B. Secure Socket Library. Netscape Communications Corp., Feb. 9th, 1995. .
22. Krawczyk H., “Distributed Fingerprints and Secure Information Dispersal,” Proc. 20th Annual ACM Symp. on Principles of Distributed Computing, pp. 207-218, Ithaca, NY, 1993.
23. Krawczyk H., “Secret sharing made short,” Advances in Cryptology—Crypto '93, Lecture Notes in Computer Science, pp.136-146, Springer-Verlag, 1993.
24. L. Lamport, R.B. Shostak and M. Pease, The Byzantine generals problem, ACM Trans. Prog. Lang, and Systems, 4:3 (1982), pp. 382-401.
25. C. Park, and K. Kurosawa. New ElGamal Type Threshold Digital Signature Scheme. IEICE Trans. Fundamentals, E79-A(1):86-93, January 1996.
26. Preparata P.P., “Holographic Dispersal and Recovery of Information”, IEEE Trans, on Information Theory, IT-35, No. 5, pp. 1123-1124, 1989.
27. Rabin M., “Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance,” Journal of the ACM, Vol. 36(2), pp. 335-348, 1989.
28. Rivest R., Shamir, A. and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Communications of the ACM, Vol. 21, pp. 120-126, 1978.
29. Shamir, A., “How to Share a Secret,” Communications of the ACM, Vol. 22, pp. 612-613, 1979.