{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:00:32Z","timestamp":1783008032288,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540635758","type":"print"},{"value":"9783540696001","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0030690","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:23:32Z","timestamp":1133418212000},"page":"275-289","source":"Crossref","is-referenced-by-count":13,"title":["Secure distributed storage and retrieval"],"prefix":"10.1007","author":[{"given":"Juan A.","family":"Garay","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charanjit","family":"Jutla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"21_CR1","unstructured":"Blahut R., Theory and Practice of Error Control Codes, Addison-Wesley, 1984."},{"key":"21_CR2","unstructured":"C. Boyd. Digital Multisignatures. In H. Baker and F. Piper, editors, Cryptography and Coding, pages 241\u2013246. Claredon Press, 1986."},{"key":"21_CR3","unstructured":"Bellare M., Canetti R. and Krawczyk H., \u201cKeying Hash Fonctions for Message Authentication,\u201d Proc. Advances in Cryptology-CRYPTO '96, LNCS Vol. 1109, Springer-Verlag, pp. 1\u201315, 1996."},{"key":"21_CR4","unstructured":"Berlekamp E. and Welch L., \u201cError Correction of Algebraic Block Codes,\u201d US Patent 4,633,470."},{"key":"21_CR5","first-page":"199","volume":"82","author":"D. Chaum","year":"1983","unstructured":"D. Chaum, \u201cBlind signatures for untraceable payments,\u201d Proc. CRYPTO 82, pp. 199\u2013203, 1983.","journal-title":"Proc. CRYPTO"},{"key":"21_CR6","unstructured":"P. Chen, J. Garay, A. Herzberg, and H. Krawczyk. \u201cDesign and Implementation of Modular Key Management Protocol and IP Secure Tunnel,\u201d Proc. USENIX Security '95, Salt Lake City, Utah, June 1995."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., and Awerbuch, B., \u201cVerifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults,\u201d Proc. 26th Annual IEEE Symposium on the Foundations of Computer Science, pp. 383\u2013395, 1985.","DOI":"10.1109\/SFCS.1985.64"},{"key":"21_CR8","unstructured":"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\u2013545, April 1993. US Patent 4,633,470. [CH89] 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\u2013201. Claredon Press, 1989."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/195058.195405"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-48184-2_8"},{"issue":"4","key":"21_CR11","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1002\/ett.4460050407","volume":"5","author":"Y.G. Desmedt","year":"1994","unstructured":"Y.G. Desmedt. Threshold cryptography. European Transactions on Telecommunications, 5(4):449\u2013457, July 1994.","journal-title":"European Transactions on Telecommunications"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Y. Desmedt and Y. Frankel. Threshold cryptosystems. In G. Brassard, editor, Proc. CRYPTO 89, pages 307\u2013315. Springer-Verlag, 1990. Lecture Notes in Computer Science No. 435.","DOI":"10.1007\/0-387-34805-0_28"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In J. Feigenbaum, editor, Proc. CRYPTO 91, pages 457\u2013469. Springer, 1992. Lecture Notes in Computer Science No. 576.","DOI":"10.1007\/3-540-46766-1_37"},{"key":"21_CR14","unstructured":"\u201cEntrust-Enterprise-Wide Encryption and Digital Signatures,\u201d System Overview and Installation Guide."},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/237814.237998"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust Threshold DSS Signatures. In Advances in Cryptology-EUROCRYPT'96, Lecture Notes in Computer Science vo1.1070, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-68339-9_31"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and Efficient Sharing of RSA Functions. In Advances in Cryptoiogy-CRYPTO'96, Lecture Notes in Computer Science vol. 1109, pp.157-172, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-68697-5_13"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"L. Harn. Group oriented (t,n) digital signature scheme. IEE Proc.-Comput.Digit.Tech, 141(5), Sept 1994.","DOI":"10.1049\/ip-cdt:19941293"},{"key":"21_CR19","unstructured":"T. Hardjono and J. Seberry, \u201cStrongboxes for Electronic Commerece,\u201dProc. 2nd USENIX WOrkshop on Electronic Commerece, pp. 135-145, Oakland, CA, November 1996."},{"key":"21_CR20","unstructured":"Hickman, K. E. B. Secure Socket Library. Netscape Communications Corp., Feb. 9th, 1995. http:\/\/wvw.zcon.com\/into\/SSL.htal."},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Krawcayk H., \u201cDistributed Fingerprints and Secure Information Dispersal,\u201d Proc. 20th Annual ACM Symp. on Principles of Distributed Computing, pp. 207\u2013218, Ithaca, NY, 1993.","DOI":"10.1145\/164051.164075"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Krawczyk H., \u201cSecret sharing made short,\u201d Advances in Cryptology-Crypto '93, Lecture Notes in Computer Science, pp.136\u2013146, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-48329-2_12"},{"issue":"3","key":"21_CR23","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"L. LAMPORT, R.E. SHOSTAK and M. PBASB, The Byzantine generals problem, ACM Trans. Prog. Lang. and Systems, 4:3 (1982), pp. 382\u2013401.","journal-title":"ACM Trans. Prog. Lang. and Systems"},{"key":"21_CR24","unstructured":"C. Park, and K. Kurosawa. New ElGama1 Type Threshold Digital Signature Scheme. IEICE Trans. Pundamentals, E79-A(1):86\u201393, January 1996."},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Preparata F.P., \u201cHolographic Dispersal and Recovery of Information\u201d, IEEE Trans. on Information Theory, IT-35, No. 5, pp. 1123\u20131124, 1989","DOI":"10.1109\/18.42233"},{"issue":"2","key":"21_CR26","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"M. Rabin","year":"1989","unstructured":"Rabin M., \u201cEfficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance,\u201d Journal of the ACM, Vol. 36(2), pp. 335\u2013348, 1989.","journal-title":"Journal of the ACM"},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest R., Shamir, A. and L. Adleman \u201cA Method for Obtaining Digital Signatures and Public-Key Cryptosystems,\u201d Communications of the ACM, Vol. 21, pp. 120\u2013126, 1978.","journal-title":"Communications of the ACM"},{"key":"21_CR28","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A., \u201cHow to Share a Secret,\u201d Communications of the ACM, Vol. 22, pp. 612\u2013613, 1979.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:21:57Z","timestamp":1586593317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540635758","9783540696001"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/bfb0030690","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}