{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:26:28Z","timestamp":1725521188521},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540897538"},{"type":"electronic","value":"9783540897545"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89754-5_15","type":"book-chapter","created":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T12:11:54Z","timestamp":1227701514000},"page":"185-199","source":"Crossref","is-referenced-by-count":7,"title":["Round Efficient Unconditionally Secure Multiparty Computation Protocol"],"prefix":"10.1007","author":[{"given":"Arpita","family":"Patra","sequence":"first","affiliation":[]},{"given":"Ashish","family":"Choudhary","sequence":"additional","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","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)"},{"issue":"4","key":"15_CR2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00196771","volume":"4","author":"D. Beaver","year":"1991","unstructured":"Beaver, D.: Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology\u00a04(4), 75\u2013122 (1991)","journal-title":"Journal of Cryptology"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Efficient multi-party computation with dispute control. In: Proc. of TCC, pp. 305\u2013328 (2006)","DOI":"10.1007\/11681878_16"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-78524-8_13","volume-title":"Theory of Cryptography","author":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 213\u2013230. Springer, Heidelberg (2008)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Bit optimal distributed consensus. Computer Science Research, 313\u2013322 (1992)","DOI":"10.1007\/978-1-4615-3422-8_27"},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L. Carter","year":"1979","unstructured":"Carter, L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences (JCSS)\u00a018(4), 143\u2013154 (1979)","journal-title":"Journal of Computer and System Sciences (JCSS)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D., Crpeau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: Proc. of FOCS 1988, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I.: Multiparty Computation, an Introduction. Contemporary Cryptography. Birkh\u00e1user, Basel (2005)","DOI":"10.1007\/3-7643-7394-6_2"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Cramer","year":"1999","unstructured":"Cramer, R., Damg\u00e5rd, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 311\u2013326. Springer, Heidelberg (1999)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-74143-5_32","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"I. Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 572\u2013590. Springer, Heidelberg (2007)"},{"key":"15_CR12","first-page":"163","volume-title":"Proc. of PODC 2006","author":"M. Fitzi","year":"2006","unstructured":"Fitzi, M., Hirt, M.: Optimally Efficient Multi-Valued Byzantine Agreement. In: Proc. of PODC 2006, pp. 163\u2013168. ACM, New York (2006)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Patra, A., Choudhary, A., Pandu Rangan, C.: Round Efficient Unconditionally Seecure Multiparty Computation. Cryptology ePrint Archive, Report 2008\/399","DOI":"10.1007\/978-3-540-89754-5_15"},{"key":"15_CR14","unstructured":"Pfitzmann, B., Waidner, M.: Information-theoretic pseudosignatures and byzantine agreement for t \u2265 n\/3. Technical report, IBM Research (1996)"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proc. of 23rd IEEE FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - INDOCRYPT 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89754-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T09:43:24Z","timestamp":1589190204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89754-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540897538","9783540897545"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89754-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}