{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T07:47:28Z","timestamp":1759132048802,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213552"},{"type":"electronic","value":"9783319213569"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21356-9_11","type":"book-chapter","created":{"date-parts":[[2015,7,15]],"date-time":"2015-07-15T01:20:09Z","timestamp":1436923209000},"page":"161-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations"],"prefix":"10.1007","author":[{"given":"\u00d6zg\u00fcr","family":"Dagdelen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Venturi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,16]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer and extensions for faster secure computation. In: ACM Conference on Computer and Communications Security, pp. 535\u2013548 (2013)","DOI":"10.1145\/2508859.2516738"},{"key":"11_CR2","first-page":"511","volume":"2012","author":"G Ateniese","year":"2012","unstructured":"Ateniese, G., Dagdelen, \u00d6., Damg\u00e5rd, I., Venturi, D.: Entangled cloud storage. IACR Cryptology ePrint Arch. 2012, 511 (2012)","journal-title":"IACR Cryptology ePrint Arch."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: ACM Conference on Computer and Communications Security, pp. 784\u2013796 (2012)","DOI":"10.1145\/2382196.2382279"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-20465-4_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"R Bendlin","year":"2011","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 169\u2013188. Springer, Heidelberg (2011)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-55220-5_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"D Boneh","year":"2014","unstructured":"Boneh, D., Gentry, C., Gorbunov, S., Halevi, S., Nikolaenko, V., Segev, G., Vaikuntanathan, V., Vinayagamurthy, D.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 533\u2013556. Springer, Heidelberg (2014)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","first-page":"234","volume-title":"Advances in Cryptology - CRYPTO 1986","author":"G Brassard","year":"1987","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.M.: All-or-nothing disclosure of secrets. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 234\u2013238. Springer, Heidelberg (1987)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Dagdelen, \u00d6., Mohassel, P., Venturi, D.: Rate-limited secure function evaluation: definitions and constructions. In: Public Key Cryptography, pp. 461\u2013478 (2013)","DOI":"10.1007\/978-3-642-36362-7_28"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Dagdelen, \u00d6., Venturi, D.: A multi-party protocol for privacy-preserving cooperative linear system of equations. In: BalkanCryptSec (2014)","DOI":"10.1007\/978-3-319-21356-9_11"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11818175_30","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"IB Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I.B., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 501\u2013520. Springer, Heidelberg (2006)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-13190-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 445\u2013465. Springer, Heidelberg (2010)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-85174-5_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"I Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M., Nielsen, J.B., Smith, A.: Scalable multiparty computation with nearly optimal work and resilience. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 241\u2013261. Springer, Heidelberg (2008)"},{"key":"11_CR12","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":"IB Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I.B., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 572\u2013590. Springer, Heidelberg (2007)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Damgrd, I., Nielsen, J.B., Orlandi, C.: Essentially optimal universally composable oblivious transfer. In: Cryptology ePrint Archive, Report 2008\/220 (2008)","DOI":"10.1007\/978-3-642-00730-9_20"},{"key":"11_CR15","unstructured":"Du, W., Atallah, M.J.: Privacy-preserving cooperative scientific computations. In: CSFW, pp. 273\u2013294 (2001)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Du, W., Zhan, J.Z.: A practical approach to solve secure multi-party computation problems. In: Proceedings of the 2002 Workshop on New Security Paradigms, Virginia Beach, VA, USA, September 23\u201326, 2002, pp. 127\u2013135 (2002)","DOI":"10.1145\/844102.844125"},{"key":"11_CR17","unstructured":"Dubovitskaya, M., Scafuro, A., Visconti, I.: On efficient non-interactive oblivious transfer with tamper-proof hardware. In: Cryptology ePrint Archive, Report 2010\/509 (2010)"},{"issue":"6","key":"11_CR18","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"11_CR20","first-page":"004","volume":"2015","author":"C Hazay","year":"2015","unstructured":"Hazay, C.: Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs. IACR Cryptology ePrint Arch. 2015, 004 (2015)","journal-title":"IACR Cryptology ePrint Arch."},{"key":"11_CR21","first-page":"459","volume":"2009","author":"C Hazay","year":"2009","unstructured":"Hazay, C.: Lindell, yehuda: efficient oblivious polynomial evaluation with simulation-based security. IACR Cryptology ePrint Arch. 2009, 459 (2009)","journal-title":"IACR Cryptology ePrint Arch."},{"key":"11_CR22","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8","volume-title":"Efficient Secure Two-Party Protocols - Techniques and Constructions","author":"C Hazay","year":"2010","unstructured":"Hazay, C., Lindell, Y.: Efficient Secure Two-Party Protocols - Techniques and Constructions. Information Security and Cryptography. Springer, Heidelberg (2010)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: USENIX Security Symposium (2011)","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003)"},{"key":"11_CR25","first-page":"272","volume":"2011","author":"S Kamara","year":"2011","unstructured":"Kamara, S., Mohassel, P., Raykova, M.: Outsourcing multi-party computation. IACR Cryptology ePrint Arch. 2011, 272 (2011)","journal-title":"IACR Cryptology ePrint Arch."},{"issue":"1","key":"11_CR26","first-page":"21","volume":"3","author":"J-S Kang","year":"2007","unstructured":"Kang, J.-S., Hong, D.: A practical privacy-preserving cooperative computation protocol without oblivious transfer for linear systems of equations. JIPS 3(1), 21\u201325 (2007)","journal-title":"JIPS"},{"issue":"3","key":"11_CR27","first-page":"171","volume":"1","author":"DK Mishra","year":"2009","unstructured":"Mishra, D.K., Trivedi, P., Shukla, S.: A glance at secure multiparty computation for privacy preserving data mining. Int. J. Comput. Sci. Eng. 1(3), 171\u2013175 (2009)","journal-title":"Int. J. Comput. Sci. Eng."},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-40084-1_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"P Mohassel","year":"2013","unstructured":"Mohassel, P., Riva, B.: Garbled circuits checking garbled circuits: more efficient and secure two-party computation. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 36\u201353. Springer, Heidelberg (2013)"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: STOC pp. 245\u2013254 (1999)","DOI":"10.1145\/301250.301312"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"JB Nielsen","year":"2012","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 681\u2013700. Springer, Heidelberg (2012)"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008)"},{"key":"11_CR32","unstructured":"Michael O. Rabin. How to exchange secrets with oblivious transfer. Cryptology ePrint Archive, Report 2005\/187, 2005"},{"key":"11_CR33","unstructured":"Troncoso-Pastoriza, J.R., Comesana, P., P\u00e9rez-Gonz\u00e1lez, F.: Secure direct and iterative protocols for solving systems of linear equations. In: Proceedings of the First International Workshop Signal Processing in the Encrypted Domain (SPEED), pp. 122\u2013141 (2009)"},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45664-3_11","volume-title":"Public Key Cryptography","author":"W-G Tzeng","year":"2002","unstructured":"Tzeng, W.-G.: Efficient 1-out-n oblivious transfer schemes. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 159\u2013171. Springer, Heidelberg (2002)"},{"key":"11_CR35","unstructured":"Wu, N., Zhang, J., Ning, L.: Discovering multivariate linear relationship securely. In: Proceedings from the Sixth Annual IEEE SMC, Information Assurance Workshop, IAW 2005, pp. 436\u2013437 (2005)"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Yang, X., Yu, Z., Kang, B.: Privacy-preserving cooperative linear system of equations protocol and its application. In: WiCOM, pp. 1\u20134 (2008)","DOI":"10.1109\/WiCom.2008.1131"},{"key":"11_CR37","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Information Security in the Balkans"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21356-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:45:46Z","timestamp":1676972746000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21356-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213552","9783319213569"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21356-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}