{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:10:32Z","timestamp":1737504632083,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414520"},{"type":"electronic","value":"9783540444954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44495-5_12","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T05:24:06Z","timestamp":1193549046000},"page":"130-142","source":"Crossref","is-referenced-by-count":1,"title":["Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation"],"prefix":"10.1007","author":[{"given":"K.","family":"Srinathan","sequence":"first","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,26]]},"reference":[{"unstructured":"S. Akers and T. Robbins. Logical design with three-input majority gates. Computer Design, pp. 12\u201327, March 1963. 133","key":"12_CR1"},{"doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In 20th ACM STOC, pp. 1\u201310, 1988. 131, 141","key":"12_CR2","DOI":"10.1145\/62212.62213"},{"unstructured":"M. Fitzi. Erweiterte zugriffstrukturen in multiparty computation, 1996. Student\u2019s Project. 133","key":"12_CR3"},{"key":"12_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BFb0056479","volume-title":"DISC\u2019 98","author":"M. Fitzi","year":"1998","unstructured":"M. Fitzi and U. Maurer. Efficient Byzantine agreement secure against general adversaries. In DISC\u2019 98, vol. 1499 of LNCS, pp. 134\u2013148. Springer-Verlag, 1998. 131"},{"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 PODC, 1998. 141","key":"12_CR5","DOI":"10.1145\/277697.277716"},{"key":"12_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"CRYPTO 95","author":"A. Herzberg","year":"1995","unstructured":"A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung. Proactive secret sharing. In CRYPTO 95, vol. 963 of LNCS, pp. 339\u2013352. Springer-Verlag, 1995. 135"},{"doi-asserted-by":"crossref","unstructured":"M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multiparty computation. In 16th ACM PODC, pp. 25\u201334, August 1997. 131, 133, 141","key":"12_CR7","DOI":"10.1145\/259380.259412"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31\u201360, April 2000. 131, 133, 133, 141, 141, 141","journal-title":"Journal of Cryptology"},{"doi-asserted-by":"crossref","unstructured":"R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. In 10th ACM PODC, pp. 51\u201361, 1991. 135, 141","key":"12_CR9","DOI":"10.1145\/112600.112605"},{"key":"12_CR10","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. CACM, 22:612\u2013613, 1979. 133","journal-title":"CACM"},{"doi-asserted-by":"crossref","unstructured":"K. Srinathan and C. Pandu Rangan. Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation. Technical Report, Dept. CSE, Indian Institute of Technology, Madras, August 2000. 135, 136","key":"12_CR11","DOI":"10.1007\/3-540-44495-5_12"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2014INDOCRYPT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44495-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:47:38Z","timestamp":1737503258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44495-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414520","9783540444954"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44495-5_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}