{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T11:32:59Z","timestamp":1746185579316},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642300530"},{"type":"electronic","value":"9783642300547"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30054-7_16","type":"book-chapter","created":{"date-parts":[[2012,5,15]],"date-time":"2012-05-15T10:42:55Z","timestamp":1337078575000},"page":"198-210","source":"Crossref","is-referenced-by-count":4,"title":["Heterogeneous Secure Multi-Party Computation"],"prefix":"10.1007","author":[{"given":"Mentari","family":"Djatmiko","sequence":"first","affiliation":[]},{"given":"Mathieu","family":"Cunche","sequence":"additional","affiliation":[]},{"given":"Roksana","family":"Boreli","sequence":"additional","affiliation":[]},{"given":"Aruna","family":"Seneviratne","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Alba, E., Cotta, C.: Evolutionary algorithms. In: Handbook of Bioinspired Algorithms and Applications, ch. 2, pp. 3\u201319. Chapman & Hall (2006)","DOI":"10.1201\/9781420035063.sec1"},{"key":"16_CR2","first-page":"1","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 1\u201310. ACM, New York (1988)"},{"key":"16_CR3","unstructured":"BOINC author: Boinc, \n                    \n                      http:\/\/boinc.berkeley.edu\/wiki\/System_requirements"},{"key":"16_CR4","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/3-540-46885-4_45","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"E. Brickell","year":"1990","unstructured":"Brickell, E.: Some Ideal Secret Sharing Schemes. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 468\u2013475. Springer, Heidelberg (1990)"},{"key":"16_CR5","first-page":"15","volume-title":"Proceedings of the 19th USENIX Conference on Security","author":"M. Burkhart","year":"2010","unstructured":"Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.: SEPIA: privacy-preserving aggregation of multi-domain network events and statistics. In: Proceedings of the 19th USENIX Conference on Security, p. 15. USENIX Association, Berkeley (2010)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Cao, N., Yang, Z., Wang, C., Ren, K., Lou, W.: Privacy-preserving query over encrypted graph-structured data in cloud computing. In: 2011 31st International Conference on ICDCS, pp. 393\u2013402 (June 2011)","DOI":"10.1109\/ICDCS.2011.84"},{"key":"16_CR7","unstructured":"Cramer, R., Damgaard, I., Nielsen, J.B.: Multiparty Computation, an Introduction (May 2008)"},{"key":"16_CR8","series-title":"LNCS","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., Maurer, U.: General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"16_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-00468-1_10","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"I. Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M., Nielsen, J.B.: Asynchronous Multiparty Computation: Theory and Implementation. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.\u00a05443, pp. 160\u2013179. Springer, Heidelberg (2009)"},{"key":"16_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-540-76900-2_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"I. Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Desmedt, Y., Fitzi, M., Nielsen, J.B.: Secure Protocols with Asymmetric Trust. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 357\u2013375. Springer, Heidelberg (2007)"},{"key":"16_CR11","unstructured":"Dongara, J.: Linpack for android, \n                    \n                      http:\/\/www.netlib.org\/benchmark\/linpackjava\/"},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/MIC.2010.12","volume":"14","author":"D. Estrin","year":"2010","unstructured":"Estrin, D.: Participatory sensing: applications and architecture [internet predictions]. IEEE Internet Computing\u00a014(1), 12\u201342 (2010)","journal-title":"IEEE Internet Computing"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Goldman, R.: Pyramid Algorithms: A Dynamic Programming Approach to Curves and Surfaces for Geometric Modeling. In: Lagrange Interpolation and Neville\u2019s Algorithm, ch. 2. Morgan Kaufmann (2003)","DOI":"10.1016\/B978-155860354-7\/50003-9"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Kannan, S., Gavrilovska, A., Schwan, K.: Cloud4home \u2013 enhancing data services with @home clouds. In: 2011 31st International Conference on Distributed Computing Systems (ICDCS), pp. 539\u2013548 (June 2011)","DOI":"10.1109\/ICDCS.2011.74"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Michiardi, P., Molva, R.: Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. In: Conference on Communications and Multimedia Security, p. 121. Kluwer, BV (2002)","DOI":"10.1007\/978-0-387-35612-9_9"},{"issue":"11","key":"16_CR16","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\u00a022(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"16_CR17","unstructured":"Verizon: Ip latency statistics (2011), \n                    \n                      http:\/\/www.verizonbusiness.com\/about\/network\/latency\/"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Wang, C., Ren, K., Wang, J., Urs, K.: Harnessing the cloud for securely solving large-scale systems of linear equations. In: 2011 31st International Conference on ICDCS, pp. 549\u2013558 (June 2011)","DOI":"10.1109\/ICDCS.2011.41"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30054-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:42:55Z","timestamp":1558312975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30054-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642300530","9783642300547"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30054-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}