{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T20:40:04Z","timestamp":1748724004038,"version":"3.41.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319269603"},{"type":"electronic","value":"9783319269610"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26961-0_22","type":"book-chapter","created":{"date-parts":[[2015,12,16]],"date-time":"2015-12-16T13:07:52Z","timestamp":1450271272000},"page":"364-377","source":"Crossref","is-referenced-by-count":0,"title":["Asynchronous Error-Decodable Secret-Sharing and Its Application"],"prefix":"10.1007","author":[{"given":"Ashish","family":"Choudhury","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,31]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: STOC, pp. 52\u201361. ACM (1993)","DOI":"10.1145\/167088.167109"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS National Computer Conference, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"22_CR3","unstructured":"Canetti, R.: Studies in secure multiparty computation and applications. Ph.D. thesis, Weizmann Institute, Israel (1995)"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Maurer, U.M.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"22_CR5","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley, New York (2006)","edition":"2"},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. J. ACM 40(1), 17\u201347 (1993)","journal-title":"J. ACM"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Eichin, M.W., Rochlis, J.A.: With microscope and tweezers: an analysis of the internet virus of November 1988. In: IEEE Symposium on Security and Privacy, pp. 326\u2013343. IEEE Computer Society (1989)","DOI":"10.1109\/SECPRI.1989.36307"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Hirt, M., Maurer, U.M.: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In: PODC, pp. 25\u201334. ACM (1997)","DOI":"10.1145\/259380.259412"},{"issue":"9","key":"22_CR9","doi-asserted-by":"publisher","first-page":"6304","DOI":"10.1109\/TIT.2011.2161927","volume":"57","author":"K Kurosawa","year":"2011","unstructured":"Kurosawa, K.: General error decodable secret sharing scheme and its application. IEEE Trans. Inf. Theory 57(9), 6304\u20136309 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"22_CR10","unstructured":"Computer bug bites hard, spreads fast [online] (2000). http:\/\/www.cnn.com\/2000\/TECH\/computing\/05\/04\/iloveyou.01\/index.html"},{"issue":"9","key":"22_CR11","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"RJ McEliece","year":"1981","unstructured":"McEliece, R.J., Sarwate, D.V.: On sharing secrets and reed-solomon codes. Commun. ACM 24(9), 583\u2013584 (1981)","journal-title":"Commun. ACM"},{"issue":"1","key":"22_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.3934\/amc.2013.7.39","volume":"7","author":"M Nojoumian","year":"2013","unstructured":"Nojoumian, M., Stinson, D.R.: On dealer-free dynamic threshold schemes. Adv. Math. Commun. 7(1), 39\u201356 (2013)","journal-title":"Adv. Math. Commun."},{"issue":"11","key":"22_CR13","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-36178-2_14","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"K Srinathan","year":"2002","unstructured":"Srinathan, K., Kumar, M.V.N.A., Pandu Rangan, C.: Asynchronous secure communication tolerating mixed adversaries. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 224\u2013242. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Information Systems Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26961-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T20:20:16Z","timestamp":1748722816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26961-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319269603","9783319269610"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26961-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}