{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:57Z","timestamp":1766281017495,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030053772"},{"type":"electronic","value":"9783030053789"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-05378-9_20","type":"book-chapter","created":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T01:03:38Z","timestamp":1543971818000},"page":"375-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Secure Computation with Constant Communication Overhead Using Multiplication Embeddings"],"prefix":"10.1007","author":[{"given":"Alexander R.","family":"Block","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hemanta K.","family":"Maji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai H.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,5]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-63688-7_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Applebaum","year":"2017","unstructured":"Applebaum, B., Damg\u00e5rd, I., Ishai, Y., Nielsen, M., Zichron, L.: Secure arithmetic computation with constant computational overhead. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 223\u2013254. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_8"},{"key":"20_CR2","unstructured":"Atighehchi, K., Ballet, S., Bonnecaze, A., Rolland, R.: On chudnovsky-based arithmetic algorithms in finite fields. CoRR abs\/1510.00090 (2015). http:\/\/arxiv.org\/abs\/1510.00090"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.jalgebra.2003.09.031","volume":"272","author":"S Ballet","year":"2004","unstructured":"Ballet, S., Rolland, R.: Multiplication algorithm in a finite field and tensor rank of the multiplication. J. Algebra 272(1), 173\u2013185 (2004). https:\/\/doi.org\/10.1016\/j.jalgebra.2003.09.031. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0021869303006951","journal-title":"J. Algebra"},{"issue":"7","key":"20_CR4","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.crma.2017.06.002","volume":"355","author":"S Ballet","year":"2017","unstructured":"Ballet, S., Baudru, N., Bonnecaze, A., Tukumuli, M.: On the construction of the asymmetric chudnovsky multiplication algorithm in finite fields without derivated evaluation. Comptes Rendus Mathematique 355(7), 729\u2013733 (2017). https:\/\/doi.org\/10.1016\/j.crma.2017.06.002. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1631073X17301577","journal-title":"Comptes Rendus Mathematique"},{"key":"20_CR5","unstructured":"Ballet, S., Bonnecaze, A., Tukumuli, M.: On the construction of elliptic chudnovsky-type algorithms for multiplication in large extensions of finite fields, March 2013"},{"key":"20_CR6","unstructured":"Ballet, S., Pieltant, J., Rambaud, M.: On some bounds for symmetric tensor rank of multiplication in finite fields. CoRR abs\/1601.00126 (2016). http:\/\/arxiv.org\/abs\/1601.00126"},{"key":"20_CR7","unstructured":"Beaver, D.: Perfect privacy for two-party protocols. In: Feigenbaum, J., Merritt, M. (eds.), vol. 2, pp. 65\u201377. American Mathematical Society, Providence (1989)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-48405-1_6","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201999","author":"A Beimel","year":"1999","unstructured":"Beimel, A., Malkin, T., Micali, S.: The all-or-nothing nature of two-party secure computation. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 80\u201397. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_6"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-030-03810-6_2","volume-title":"Theory of Cryptography","author":"Alexander R. Block","year":"2018","unstructured":"Block, A.R., Gupta, D., Maji, H.K., Nguyen, H.H.: Secure computation using leaky correlations (asymptotically optimal constructions). Cryptology ePrintArchive, Report 2018\/372 (2018). https:\/\/eprint.iacr.org\/2018\/372"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-63715-0_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"AR Block","year":"2017","unstructured":"Block, A.R., Maji, H.K., Nguyen, H.H.: Secure computation based on leaky correlations: high resilience setting. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 3\u201332. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_1"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Block, A.R., Maji, H.K., Nguyen, H.H.: Secure computation with constant communication overhead using multiplication embeddings. Cryptology ePrint Archive, Report 2018\/395 (2018). https:\/\/eprint.iacr.org\/2018\/395","DOI":"10.1007\/978-3-030-05378-9_20"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-56614-6_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"E Boyle","year":"2017","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Group-based secure computation: optimizing rounds, communication, and computation. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 163\u2013193. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_6"},{"key":"20_CR13","series-title":"Grundlehren der mathematischen Wissenschaften","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic Complexity Theory","author":"P B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften, vol. 315. Springer, NewYork (1997). https:\/\/doi.org\/10.1007\/978-3-662-03338-8"},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation, pp. 494\u2013503 (2002). https:\/\/doi.org\/10.1145\/509907.509980","DOI":"10.1145\/509907.509980"},{"key":"20_CR15","unstructured":"Cascudo, I.: On asymptotically good strongly multiplicative linear secret sharing. Ph.D. thesis, Tesis doctoral, Universidad de Oviedo (2010)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-319-96878-0_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"I Cascudo","year":"2018","unstructured":"Cascudo, I., Cramer, R., Xing, C., Yuan, C.: Amortized complexity of information-theoretically secure MPC revisited. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 395\u2013426. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_14"},{"issue":"2","key":"20_CR17","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.jco.2009.11.002","volume":"26","author":"M Cenk","year":"2010","unstructured":"Cenk, M., \u00d6zbudak, F.: On multiplication in finite fields. J. Complex. 26(2), 172\u2013186 (2010)","journal-title":"J. Complex."},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/978-3-540-78967-3_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N Chandran","year":"2008","unstructured":"Chandran, N., Goyal, V., Sahai, A.: New constructions for UC secure computation using tamper-proof hardware. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 545\u2013562. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_31"},{"key":"20_CR19","doi-asserted-by":"publisher","unstructured":"Chaumine, J.: Multiplication in small finite fields using elliptic curves, pp. 343\u2013350 (2012). https:\/\/doi.org\/10.1142\/9789812793430_0018. https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/9789812793430_0018","DOI":"10.1142\/9789812793430_0018"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/11818175_31","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"H Chen","year":"2006","unstructured":"Chen, H., Cramer, R.: Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 521\u2013536. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_31"},{"issue":"7","key":"20_CR21","doi-asserted-by":"publisher","first-page":"1739","DOI":"10.1073\/pnas.84.7.1739","volume":"84","author":"DV Chudnovsky","year":"1987","unstructured":"Chudnovsky, D.V., Chudnovsky, G.V.: Algebraic complexities and algebraic curves over finite fields. Proc. Nat. Acad. Sci. 84(7), 1739\u20131743 (1987)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract), pp. 42\u201352 (1988). https:\/\/doi.org\/10.1109\/SFCS.1988.21920","DOI":"10.1109\/SFCS.1988.21920"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simpli.cation and some applications of paillier\u2019s probabilistic public-key system. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 119\u2013136. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_9"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-540-78967-3_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"I Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Wichs, D.: Isolated proofs of knowledge and isolated zero knowledge. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 509\u2013526. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_29"},{"key":"20_CR25","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). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"20_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-662-53015-3_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"Y Dodis","year":"2016","unstructured":"Dodis, Y., Halevi, S., Rothblum, R.D., Wichs, D.: Spooky encryption and its applications. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 93\u2013122. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_4"},{"issue":"1","key":"20_CR27","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01884295","volume":"121","author":"A Garcia","year":"1995","unstructured":"Garcia, A., Stichtenoth, H.: A tower of artin-schreier extensions of function fields attaining the drinfeld-vladut bound. Inventiones Mathematicae 121(1), 211\u2013222 (1995)","journal-title":"Inventiones Mathematicae"},{"issue":"2","key":"20_CR28","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/jnth.1996.0147","volume":"61","author":"A Garcia","year":"1996","unstructured":"Garcia, A., Stichtenoth, H.: On the asymptotic behaviour of some towers of function fields over finite fields. J. Number Theory 61(2), 248\u2013273 (1996)","journal-title":"J. Number Theory"},{"key":"20_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-48405-1_8","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201999","author":"N Gilboa","year":"1999","unstructured":"Gilboa, N.: Two party RSA key generation. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 116\u2013129. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_8"},{"key":"20_CR30","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority, pp. 218\u2013229 (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"20_CR31","first-page":"170","volume":"24","author":"VD Goppa","year":"1981","unstructured":"Goppa, V.D.: Codes on algebraic curves. Soviet Math. Dokl. 24, 170\u2013172 (1981)","journal-title":"Soviet Math. Dokl."},{"key":"20_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-662-48000-7_34","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"D Gupta","year":"2015","unstructured":"Gupta, D., Ishai, Y., Maji, H.K., Sahai, A.: Secure computation from leaky correlated randomness. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 701\u2013720. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_34"},{"key":"20_CR33","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography (extended abstract), pp. 230\u2013235 (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63483","DOI":"10.1109\/SFCS.1989.63483"},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-642-22792-9_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Y Ishai","year":"2011","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A., Wullschleger, J.: Constant-rate oblivious transfer from noisy channels. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 667\u2013684. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_38"},{"key":"20_CR35","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography with constant computational overhead, pp. 433\u2013442 (2008). https:\/\/doi.org\/10.1145\/1374376.1374438","DOI":"10.1145\/1374376.1374438"},{"key":"20_CR36","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Extracting correlations, pp. 261\u2013270 (2009). https:\/\/doi.org\/10.1109\/FOCS.2009.56","DOI":"10.1109\/FOCS.2009.56"},{"key":"20_CR37","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Maji, H.K., Sahai, A., Wullschleger, J.: Single-use OT combiners with near-optimal resilience. In: 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29\u2013July 4 2014, pp. 1544\u20131548. IEEE (2014). https:\/\/doi.org\/10.1109\/ISIT.2014.6875092","DOI":"10.1109\/ISIT.2014.6875092"},{"key":"20_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32"},{"key":"20_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-00457-5_18","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2009","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Secure arithmetic computation with no honest majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 294\u2013314. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_18"},{"key":"20_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-72540-4_7","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J Katz","year":"2007","unstructured":"Katz, J.: Universally composable multi-party computation using tamper-proof hardware. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 115\u2013128. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_7"},{"key":"20_CR41","doi-asserted-by":"publisher","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer, pp. 20\u201331 (1988). https:\/\/doi.org\/10.1145\/62212.62215","DOI":"10.1145\/62212.62215"},{"key":"20_CR42","doi-asserted-by":"publisher","unstructured":"Kilian, J.: A general completeness theorem for two-party games, pp. 553\u2013560 (1991). https:\/\/doi.org\/10.1145\/103418.103475","DOI":"10.1145\/103418.103475"},{"key":"20_CR43","doi-asserted-by":"publisher","unstructured":"Kilian, J.: More general completeness theorems for secure two-party computation, pp. 316\u2013324 (2000). https:\/\/doi.org\/10.1145\/335305.335342","DOI":"10.1145\/335305.335342"},{"key":"20_CR44","doi-asserted-by":"publisher","unstructured":"Kushilevitz, E.: Privacy and communication complexity, pp. 416\u2013421 (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63512","DOI":"10.1109\/SFCS.1989.63512"},{"key":"20_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"20_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-540-78967-3_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"T Moran","year":"2008","unstructured":"Moran, T., Segev, G.: David and goliath commitments: UC computation for asymmetric parties using tamper-proof hardware. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 527\u2013544. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_30"},{"issue":"5","key":"20_CR47","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1137\/S0097539704383633","volume":"35","author":"M Naor","year":"2006","unstructured":"Naor, M., Pinkas, B.: Oblivious polynomial evaluation. SIAM J. Comput. 35(5), 1254\u20131281 (2006)","journal-title":"SIAM J. Comput."},{"key":"20_CR48","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 \u201999","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). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"issue":"4","key":"20_CR49","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.jco.2012.02.005","volume":"28","author":"H Randriambololona","year":"2012","unstructured":"Randriambololona, H.: Bilinear complexity of algebras and the chudnovsky-chudnovsky interpolation method. J. Complex. 28(4), 489\u2013517 (2012)","journal-title":"J. Complex."},{"key":"20_CR50","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BFb0087999","volume":"1518","author":"I Shparlinski","year":"1992","unstructured":"Shparlinski, I., Tsfasman, M., Vladut, S.: Curves with many points and multiplication in finite-fields. Lect. Notes Math. 1518, 145\u2013169 (1992)","journal-title":"Lect. Notes Math."},{"issue":"6","key":"20_CR51","doi-asserted-by":"publisher","first-page":"2225","DOI":"10.1109\/18.945244","volume":"47","author":"KW Shum","year":"2001","unstructured":"Shum, K.W., Aleshnikov, I., Kumar, P.V., Stichtenoth, H., Deolalikar, V.: A low-complexity algorithm for the construction of algebraic-geometric codes better than the gilbert-varshamov bound. IEEE Trans. Inf. Theory 47(6), 2225\u20132241 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"20_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/11761679_14","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"S Wolf","year":"2006","unstructured":"Wolf, S., Wullschleger, J.: Oblivious transfer is symmetric. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 222\u2013232. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_14"},{"key":"20_CR53","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: Protocols for secure computations (extended abstract), pp. 160\u2013164 (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.38","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05378-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:49:57Z","timestamp":1709822997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-05378-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030053772","9783030053789"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05378-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"5 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Delhi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isical.ac.in\/~indocrypt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}