{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T11:38:44Z","timestamp":1777549124906,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424567","type":"print"},{"value":"9783540446477","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44647-8_30","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T14:28:14Z","timestamp":1194964094000},"page":"503-523","source":"Crossref","is-referenced-by-count":35,"title":["On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[]},{"given":"Serge","family":"Fehr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"30_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"CRYPTO\u2019 91","author":"D. Beaver","year":"1992","unstructured":"D. Beaver. Efficient multiparty protocols using circuit randomization. In CRYPTO\u2019 91, LNCS 576, pages 420\u2013432. Springer-Verlag, 1992."},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Widgerson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In 20th Annual ACM Symposium on the Theory of Computing, pages 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"30_CR3","unstructured":"R.E. Blahut. Priciples and Practice of Information Theory. Addison-Wesley, 1987."},{"key":"30_CR4","series-title":"Lect Notes Comput Sci","volume-title":"EUROCRYPT\u2019 99","author":"R. Cramer","year":"1999","unstructured":"R. Cramer, I. Damgard, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations secure against an adaptive adversary. In EUROCRYPT\u2019 99, LNCS 1592. Springer-Verlag, 1999."},{"key":"30_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_22","volume-title":"EUROCRYPT 2000","author":"R. Cramer","year":"2000","unstructured":"R. Cramer, I. Damgaard, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In EUROCRYPT 2000, LNCS 1807. Springer-Verlag, 2000."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In 26th Annual Symposium on Foundations of Computer Science, pages 383\u2013395, 1985.","DOI":"10.1109\/SFCS.1985.64"},{"key":"30_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-48321-7_14","volume-title":"Proceedings of the 12th International Symposium on Fundamentals of Computation Theory, FCT\u2019 99","author":"S. Cabello","year":"1999","unstructured":"S. Cabello, C. Padr\u00f3, and G. S\u00e1ez. Secret sharing schemes with detection of cheaters for a general access structure. In Proceedings of the 12th International Symposium on Fundamentals of Computation Theory, FCT\u2019 99, LNCS 1233, pages 185\u2013193, 1999."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"R. Gennaro, M.O. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In 17th ACM Symposium on Principles of Distributed Computing, 1998.","DOI":"10.1145\/277697.277716"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In 16th ACM Symposium on Principles of Distributed Computing, pages 25\u201334, 1997.","DOI":"10.1145\/259380.259412"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"M. Karchmer and A. Wigderson. On span programs. In 8th Annual Conference on Structure in Complexity Theory (SCTC\u2019 93), pages 102\u2013111, 1993.","DOI":"10.1109\/SCT.1993.336536"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"U. Maurer. Authentication theory and hypothesis testing. IEEE Transaction on Information Theory, 2000.","DOI":"10.1109\/18.850674"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In 21th Annual ACM Symposium on the Theory of Computing, pages 73\u201385, 1989.","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"30_CR13","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to share a secret. Communications of the Association for Computing Machinery, 22(11):612\u2013613, 1979.","journal-title":"Communications of the Association for Computing Machinery"},{"key":"30_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/3-540-39568-7_32","volume-title":"CRYPTO\u2019 84","author":"G.J. Simmons","year":"1985","unstructured":"G.J. Simmons. Authentication theory\/coding theory. In CRYPTO\u2019 84, LNCS 196, pages 411\u2013431. Springer-Verlag, 1985."},{"key":"30_CR15","unstructured":"D.R. Stinson. Cryptography \u2014 Theory and Practice. Number ISBN 0-8493-8521-0. CRC Press, 1995."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44647-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:22:03Z","timestamp":1556950923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44647-8_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}