Verifiable secret redistribution for archive systems

Proceedings - 1st International IEEE Security in Storage Workshop, SISW 2002

Volumn , Issue , 2003, Pages 94-105

  Wong, T M ^a   Wang, Chenxi ^a   Wing, J M ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SHAREHOLDERS;

ACCESS STRUCTURE; ARCHIVAL STORAGE SYSTEMS; ARCHIVE SYSTEMS; MOBILE ADVERSARY; PRIMARY CONTRIBUTION; SECRET REDISTRIBUTION PROTOCOLS; SHARING SCHEMES;

DIGITAL STORAGE;

EID: 84962773855     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SISW.2002.1183515     Document Type: Conference Paper

References (46)

1. A. Adya, W. J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R. P. Wattenhofer. FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment. In Proc. of the 5th Symp. on Operating Systems Design and Implementation. Dec. 2002.
2. R. A. Beaumont. Linear algebra. Harcourt, Brace & World, Inc., 1965.
3. J. C. Benaloh. Secret sharing homomorphisms: Keeping shares of a secret secret. In Proc. of CRYPTO 1986, the 6th Ann. Intl. Cryptology Conf., pp 213-222. 1987.
4. T. Beth, H.-J. Knobloch, and M. Otten. Verifiable secret sharing for monotone access structures. In Proc. of the 1st ACM Intl. Conf. on Computer and Communications Security, pp 189-194. Nov. 1993.
5. B. Blakley, G. R. Blakley, A . H. Chan, and J. L. Massey. Threshold schemes with disenrollment. In Proc. of CRYPTO 1992, the 12th Ann. Intl. Cryptology Conf., pp 540-548. Aug. 1992.
6. G. R. Blakley. Safeguarding cryptographic keys. In Proc. of the Natl. Computer Conf., 1979.
7. C. Blundo, A. Cresti, A. D. Santis, and U. Vaccaro. Fully dynamic secret sharing schemes. Theoretical Comput. Sci., 165(2):407-440, Oct. 1996.
8. W. J. Bolosky, J. R. Douceur, D. Ely, and M. Theimer. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In Proc. of SIGMETRICS 2000, the Intl. Conf. on Measurement and Modeling of Computing Systems, pp 34-43. June 2000.
9. C. Cachin. On-line secret sharing. In Proc. of the 5th IMA Conf. on Cryptography and Coding, pp 90-198. Dec. 1995.
10. Y. Chen, J. Edler, A. Goldberg, A. Gottlieb, S. Sobti, and P. Yianilos. Aprototype implementation of archival intermemory. In Proc. of the 4th ACM Intl. Conf. on Digital Libraries, pp 28-37. Aug. 1999.
11. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults (Extended abstract). In Proc. of the 26th IEEE Ann. Symp. on Foundations of Computer Science, pp 383-395. Oct. 1985.
12. Y. Desmedt. Some recent research aspects of threshold cryptography. In Proc. of the 1st Intl. Information Security Workshop, pp 158-173. Sept. 1997.
13. Y. Desmedt and S. Jajodia. Redistributing secret shares to new access structures and its applications. Technical Report ISSE TR- 97-01, George Mason University, Fairfax, VA, July 1997.
14. P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In Proc. of the 28th IEEE Ann. Symp. on Foundations of Computer Science, pp 427-437. Oct. 1987.
15. Y. Frankel, P. Gemmell, P. D. MacKenzie, and M. Yung. Optimal resilience proactive public-key cryptosystems. In Proc. of the 38th IEEE Ann. Symp. on Foundations of Computer Science, pp 384-393. Oct. 1997.
16. Y. Frankel, P. Gemmell, P. D. MacKenzie, and M. Yung. Proactive RSA. In Proc. of CRYPTO 1997, the 17th Ann. Intl. Cryptology Conf., pp 440-454. Aug. 1997.
17. Y. Frankel, P. D. MacKenzie, and M. Yung. Adaptively-secure optimal-resilience proactive RSA. In Proc. of ASIACRYPT1999, the 5th Intl. Conf. on the Theory and Application of Cryptology and Information Security, pp 180-194. Nov. 1999.
18. Y. Frankel, P. D. MacKenzie, and M. Yung. Adaptive security for the additive-sharing based proactive RSA. In Proc. of PKC 2001, the 4th Intl. Workshop on Practice and Theory in Public Key Cryptography, pp 240-263. Febraury 2001.
19. J. A. Garay, R. Gennaro, C. S. Jutla, and T. Rabin. Secure distributed storage and retrieval. Theoretical Comput. Sci., 243(1-2):363-389, July 2000.
20. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold DSS signatures. In Proc. of EUROCRYPT 1996, the Intl. Conf. on the Theory and Application of Cryptographic Techniques, pp 354-371. May 1996.
21. R. Gennaro and S. Micali. Verifiable secret sharing as secure computation. In Proc. of EUROCRYPT 1995, the Intl. Conf. on the Theory and Application of Cryptographic Techniques, pp 168-182. May 1995.
22. A. V. Goldberg and P. N. Yianilos. Towards an archival Intermemory. In Proc. of the IEEE Forum on Reasearch and Technology Advances in Digital Libraries, pp 147-156. Apr. 1998.
23. O. Goldreich, S. Micali, and A. Wigderson. How to prove all NP statements in zero-knowledge and a methodology of cryptograhpic protocol design. In Proc. of CRYPTO 1986, the 6th Ann. Intl. Cryptology Conf., pp 171-185. 1987.
24. M. Hayden and R. van Renesse. Optimizing layered communications protocols. In Proc. of the 6th IEEE Symp. on High Performance Distributed Computing, Aug. 1997.
25. A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung. Proactive public key and signature systems. In Proc. of the 4th ACM Intl. Conf. on Computer and Communications Security, pp 100-110. Apr. 1997.
26. A. Herzberg, S. Jarekci, H. Krawczyk, and M. Yung. Proactive secret sharing or: How to cope with perpetual leakage. In Proc. of CRYPTO 1995, the 15th Ann. Intl. Cryptology Conf., pp 339-352. Aug. 1995.
27. A. Iyengar, R. Cahn, J. A. Gray, and C. Jutla. Design and implementation of a secure distributed data repository. In Proc. of IFIP/SEC 1998, the 14th Ann. Intl. Conf. on Information Security. Sept. 1998.
28. K. P. Kihlstrom, L. Moser, and P. Melliar-Smith. The SecureRing group communication system. ACM Trans. on Information and System Security, 4(4), Nov. 2001.
29. A. I. Kostrikin. Introduction to algebra. Springer-Verlag, 1982.
30. J. Kubiatowicz, D. Bindel, P. Eaton, Y. Chen, D. Geels, R. Gummadi, S. Rhea, W. Weimer, C. Wells, H. Weatherspoon, and B. Zhao. OceanStore: An architecture for globalstate persistent storage. In Proc. of ASPLOS IX, the Intl. Conf. on Architectural Support for Programming Languages and Operating Systems, pp 190-201, Nov. 2000.
31. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Trans. Prog. Lang. Syst., 4(3):382-401, July 1982.
32. R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. In Proc. of the 10th Ann. ACM Symp. on Principles of Distributed Computing, pp 51-59. Aug. 1991.
33. T. P. Pedersen. Non-iteractive and information-theoretic secure verifiable secret sharing. In Proc. of CRYPTO 1991, the 11th Ann. Intl. Cryptology Conf., pp 129-140. Aug. 1991.
34. T. Rabin. Robust sharing of secrets when the dealer is honest or cheating. J. ACM, 41(6):1089-1109, Nov. 1994.
35. T. Rabin. Asimplified approach to threshold and proactive RSA. In Proc. of CRYPTO 1998, the 18th Ann. Intl. Cryptology Conf., pp 89-104. Aug. 1998.
36. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. of the 21st Symp. on the Theory of Computing, pp 73-85. May 1989.
37. M. K. Reiter. Asecure group membership protocol. IEEE Trans. Softw. Eng., 22(1):31-42, Jan. 1996.
38. Y. Saito, C. Karamonolis, M. Karlsson, and M. Mahalingam. Taming aggressive replication in the Pangaea wide-area file system. In Proc. of the 5th Symp. on Operating Systems Design and Implementation. Dec. 2002.
39. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, Nov. 1979.
40. R. van Renesse, Y. Minsky, and M. Hayden. Agossip-based failure detection service. In Proc. of the IFIP Intl. Conf. on Distributed Systems Platforms and Open Distributed Processing, pp 55-70, Sept. 1998.
41. M. Waldman, A. D. Rubin, and L. F. Cranor. Publius: A robust, tamper-evident, censorship-resistant, web publishing system. In Proc. of the 9th USENIX Security Symp., pp 59-72. Aug. 2000.
42. T. M. Wong, C. Wang, and J. M. Wing. Verifiable secret redistribution for threshold sharing schemes. Technical Report CMU-CS-02-114-R, Sch. of Computer Science, Carnegie Mellon University, Pittsburgh, PA15213, Sept. 2002.
43. J. J. Wylie, M. Bakkaloglu, V. Pandurangan, M. W. Bigrigg, S. Oguz, K. Tew, C. Williams, G. R. Ganger, and P. K. Khosla. Selecting the right data distribution scheme for a survivable storage system. Tech. Rep. CMU-CS- 01-120, Sch. of Computer Science, Carnegie Mellon University, Pittsburgh, PA15213, May 2001.
44. J. J. Wylie, M. W. Bigrigg, J. D. Strunk, G. R. Ganger, H. Kiliççöte, and P. K. Khosla. Survivable information storage systems. IEEE Computer, pp 61-68, Aug. 2000.
45. L. Zhou, F. B. Schneider, and R. van Renesse. APSS: Proactive secret sharing in asynchronous systems. In preparation.
46. L. Zhou, F. B. Schneider, and R. van Renesse. COCA: A secure distributed on-line certification authority. ACM Trans. Comput. Syst., 20(4):329-368, Nov. 2002.