{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:51:02Z","timestamp":1761648662268},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030268336"},{"type":"electronic","value":"9783030268343"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26834-3_5","type":"book-chapter","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:05:29Z","timestamp":1565132729000},"page":"67-88","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm"],"prefix":"10.1007","author":[{"given":"Jean-Guillaume","family":"Dumas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Lafourcade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julio","family":"Lopez Fenner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Baptiste","family":"Orfila","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cl\u00e9ment","family":"Pernet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxime","family":"Puys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"5_CR1","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms (1974)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BFb0054122","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"M Blaze","year":"1998","unstructured":"Blaze, M., Bleumer, G., Strauss, M.: Divertible protocols and atomic proxy cryptography. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 127\u2013144. Springer, Heidelberg (1998). \n                      https:\/\/doi.org\/10.1007\/BFb0054122"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/2829947","volume":"42","author":"B Boyer","year":"2016","unstructured":"Boyer, B., Dumas, J.-G.: Matrix multiplication over word-size modular rings using approximateformulas. ACM Trans. Math. Softw. 42, 20 (2016)","journal-title":"ACM Trans. Math. Softw."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-63688-7_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"G Castagnos","year":"2017","unstructured":"Castagnos, G., Imbert, L., Laguillaumie, F.: Encryption switching protocols revisited: switching modulo p. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 255\u2013287. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-63688-7_9"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing (2015)","DOI":"10.1017\/CBO9781107337756"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/978-3-319-96881-0_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"R Cramer","year":"2018","unstructured":"Cramer, R., Damg\u00e5rd, I., Escudero, D., Scholl, P., Xing, C.: SPD\n                      \n                        \n                      \n                      $$\\mathbb{Z}_{2^k}$$\n                    : efficient MPC mod \n                      \n                        \n                      \n                      $$2^k$$\n                     for dishonest majority. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 769\u2013798. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-96881-0_26"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-21356-9_11","volume-title":"Cryptography and Information Security in the Balkans","author":"\u00d6 Dagdelen","year":"2015","unstructured":"Dagdelen, \u00d6., Venturi, D.: A multi-party protocol for privacy-preserving cooperative linear systems of equations. In: Ors, B., Preneel, B. (eds.) BalkanCryptSec 2014. LNCS, vol. 9024, pp. 161\u2013172. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-21356-9_11"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-63688-7_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"I Damg\u00e5rd","year":"2017","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Nielsen, M., Ranellucci, S.: The tinytable protocol for 2-party secure computation, or: gate-scrambling revisited. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 167\u2013187. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-63688-7_6"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY - a framework for efficient mixed-protocol secure two-party computation. In: NDSS (2015)","DOI":"10.14722\/ndss.2015.23113"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Du, W., Zhan, Z.: A practical approach to solve secure multiparty computation problems. In: NSPW 2002 (2002)","DOI":"10.1145\/844102.844125"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1391989.1391992","volume":"35","author":"J-G Dumas","year":"2008","unstructured":"Dumas, J.-G., Giorgi, P., Pernet, C.: Dense linear algebra over word-size prime fields: The FFLAS andFFPACK packages. ACM Trans. Math. Softw. 35, 19 (2008)","journal-title":"ACM Trans. Math. Softw."},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-38004-4_9","volume-title":"Security and Trust Management","author":"J-G Dumas","year":"2013","unstructured":"Dumas, J.-G., Hossayni, H.: Matrix powers algorithms for trust evaluation in public-key infrastructures. In: J\u00f8sang, A., Samarati, P., Petrocchi, M. (eds.) STM 2012. LNCS, vol. 7783, pp. 129\u2013144. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-38004-4_9"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.cose.2017.04.013","volume":"71","author":"J-G Dumas","year":"2017","unstructured":"Dumas, J.-G., Lafourcade, P., Orfila, J.-B., Puys, M.: Dual protocols for private multiparty matrix multiplication and trustcomputations. Comput. Secur. 71, 51\u201370 (2017)","journal-title":"Comput. Secur."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1515\/popets-2017-0053","volume":"2017","author":"A Gasc\u00f3n","year":"2017","unstructured":"Gasc\u00f3n, A., et al.: Privacy-preserving distributed linear regression on high-dimensional data. Proc. Priv. Enhancing Technol. 2017, 345\u2013364 (2017)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/11496618_9","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"B Goethals","year":"2005","unstructured":"Goethals, B., Laur, S., Lipmaa, H., Mielik\u00e4inen, T.: On private scalar product computation for privacy-preserving data mining. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 104\u2013120. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11496618_9"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography: Volume 2, Basic Applications (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1007\/978-3-319-76578-5_24","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"Y Ishai","year":"2018","unstructured":"Ishai, Y., Mittal, M., Ostrovsky, R.: On the message complexity of secure multiparty computation. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10769, pp. 698\u2013711. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-76578-5_24"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/978-3-319-76578-5_22","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"S Jarecki","year":"2018","unstructured":"Jarecki, S.: Efficient covert two-party computation. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10769, pp. 644\u2013674. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-76578-5_22"},{"key":"5_CR19","unstructured":"Josang, A.: Probabilistic logic under uncertainty. In: 13th Computing: Australasian Theory Symposium (CATS 2007) (2007)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Kaliski, B., Staddon, J.: RSA Cryptography Specifications. RFC 2437 (1998)","DOI":"10.17487\/rfc2437"},{"issue":"8","key":"5_CR21","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1002\/(SICI)1099-1506(199912)6:8<687::AID-NLA177>3.0.CO;2-I","volume":"6","author":"Igor Kaporin","year":"1999","unstructured":"Kaporin, I.: A practical algorithm for faster matrix multiplication. In: Numerical Linear Algebra with Applications (1999)","journal-title":"Numerical Linear Algebra with Applications"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Karstadt, E., Schwartz, O.: Matrix multiplication, a little faster. In: SPAA 2017 (2017)","DOI":"10.1145\/3087556.3087579"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Powers of tensors and fast matrix multiplication. In: ISSAC 2014 (2014)","DOI":"10.1145\/2608628.2608664"},{"key":"5_CR24","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-319-57048-8_6","volume-title":"Tutorials on the Foundations of Cryptography","author":"Y Lindell","year":"2017","unstructured":"Lindell, Y.: How to simulate it \u2013 a tutorial on the simulation proof technique. In: Lindell, Y. (ed.) Tutorials on the Foundations of Cryptography. ISC, pp. 277\u2013346. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-57048-8_6"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Mishra, P.K., Rathee, D., Duong, D.H., Yasuda, M.: Fast secure matrix multiplications over ring-based homomorphic encryption. Cryptology ePrint, 2018\/663","DOI":"10.1007\/978-3-319-72359-4_18"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In CCS 1998 (1998)","DOI":"10.1145\/288090.288106"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 99","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"5_CR28","unstructured":"Rindal, P., Rosulek, M.: Faster malicious 2-party secure computation with online\/offline dual execution. In: USENIX Security Symposium (2016)"},{"key":"5_CR29","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. ACM Commun. 22, 612\u2013613 (1979)","journal-title":"ACM Commun."},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik (1969)","DOI":"10.1007\/BF02165411"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26834-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:05:48Z","timestamp":1565132748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26834-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030268336","9783030268343"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26834-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWSEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwsec2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iwsec.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"https:\/\/www.iwsec.org\/2019\/","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}