{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:53:33Z","timestamp":1725533613158},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642026164"},{"type":"electronic","value":"9783642026171"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02617-1_16","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T14:22:04Z","timestamp":1245248524000},"page":"152-158","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Secure Multiparty Computation Protocol in Asynchronous Network"],"prefix":"10.1007","author":[{"given":"Zheng","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kefei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"Theory and proctice of Error Control Codes","author":"R.E. Blahut","year":"1984","unstructured":"Blahut, R.E.: Theory and proctice of Error Control Codes. Addison-Wesley, Reading (1984)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D. Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 420\u2013432. Springer, Heidelberg (1992)"},{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchromous secure computation with optimal resilience. In: Proceedings of 13th ACM PODC, pp. 183\u2013192 (1994)","key":"16_CR3","DOI":"10.1145\/197917.198088"},{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Cannetti, R., Goldreich, O.: Asynchromous secure computations. In: Proceedings of 25th ACM STOC, pp. 52\u201361 (1993)","key":"16_CR4","DOI":"10.1145\/167088.167109"},{"key":"16_CR5","first-page":"1","volume-title":"Proc. 20th Annual Symp. on the Theory of Computing","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. In: Proc. 20th Annual Symp. on the Theory of Computing, pp. 1\u201310. ACM Press, New York (1988)"},{"unstructured":"Canetti, R.: Studies in secure multiparty computation and applications. PhD Thesis, Dept. of Computer Science and Applied Mathematics, Weizmann Institute of Science (May 1995)","key":"16_CR6"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-44647-8_6","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"M. Hirt","year":"2001","unstructured":"Hirt, M., Mauren, U.: Robustness for Free in Unconditional Multiparty computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 101\u2013118. Springer, Heidelberg (2001)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-44495-5_11","volume-title":"Progress in Cryptology - INDOCRYPT 2000","author":"K. Srinathan","year":"2000","unstructured":"Srinathan, K., Pandu Rangan, C.: Efficient Asynchronous Secure Multiparty Distributed Computation. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol.\u00a01977, pp. 117\u2013130. Springer, Heidelberg (2000)"},{"doi-asserted-by":"crossref","unstructured":"Zheng, H., Zheng, G., Qiangp, L.: Batch Secret Sharing for Secure Multiparty Computation in Asynchronous Network. Journal of Shanghai Jiaotong University\u00a014(1) (2009)","key":"16_CR9","DOI":"10.1007\/s12204-009-0112-5"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Security and Assurance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02617-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:36:03Z","timestamp":1558395363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02617-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642026164","9783642026171"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02617-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}