{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T13:55:16Z","timestamp":1774965316990,"version":"3.50.1"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030453879","type":"print"},{"value":"9783030453886","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-45388-6_10","type":"book-chapter","created":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T23:05:47Z","timestamp":1588115147000},"page":"266-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":65,"title":["Bandwidth-Efficient Threshold EC-DSA"],"prefix":"10.1007","author":[{"given":"Guilhem","family":"Castagnos","sequence":"first","affiliation":[]},{"given":"Dario","family":"Catalano","sequence":"additional","affiliation":[]},{"given":"Fabien","family":"Laguillaumie","sequence":"additional","affiliation":[]},{"given":"Federico","family":"Savasta","sequence":"additional","affiliation":[]},{"given":"Ida","family":"Tucker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,29]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-319-96884-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part I. LNCS, vol. 10991, pp. 757\u2013788. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: A survey of two verifiable delay functions. Cryptology ePrint Archive, Report 2018\/712 (2018)","DOI":"10.1007\/978-3-319-96884-1_25"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/A:1014927327846","volume":"25","author":"I Biehl","year":"2002","unstructured":"Biehl, I., Buchmann, J., Hamdy, S., Meyer, A.: A signature scheme based on the intractability of computing roots. Des. Codes Crypt. 25(3), 223\u2013236 (2002)","journal-title":"Des. Codes Crypt."},{"issue":"248","key":"10_CR4","doi-asserted-by":"publisher","first-page":"2061","DOI":"10.1090\/S0025-5718-04-01632-1","volume":"73","author":"K Belabas","year":"2004","unstructured":"Belabas, K.: On quadratic fields with large 3-rank. Math. Comput. 73(248), 2061\u20132074 (2004)","journal-title":"Math. Comput."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-030-25283-0_19","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2017","author":"D Boneh","year":"2019","unstructured":"Boneh, D., Gennaro, R., Goldfeder, S.: Using level-1 homomorphic encryption to improve threshold DSA signatures for bitcoin wallet security. In: Lange, T., Dunkelman, O. (eds.) LATINCRYPT 2017. LNCS, vol. 11368, pp. 352\u2013377. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25283-0_19"},{"key":"10_CR6","unstructured":"Buchmann, J., Hamdy, S.: A survey on IQ cryptography. In: Public Key Cryptography and Computational Number Theory. De Gruyter Proceedings in Mathematics (2001)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-14081-5_15","volume-title":"Information Security and Privacy","author":"J-F Biasse","year":"2010","unstructured":"Biasse, J.-F., Jacobson, M.J., Silvester, A.K.: Security estimates for quadratic field based cryptosystems. In: Steinfeld, R., Hawkes, P. (eds.) ACISP 2010. LNCS, vol. 6168, pp. 233\u2013247. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14081-5_15"},{"key":"10_CR8","unstructured":"Boyd, C.: Digital multisignature. In: Cryptography and Coding (1986)"},{"issue":"135","key":"10_CR9","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1090\/S0025-5718-1976-0404205-X","volume":"30","author":"DA Buell","year":"1976","unstructured":"Buell, D.A.: Class groups of quadratic fields. Math. Comput. 30(135), 610\u2013623 (1976)","journal-title":"Math. Comput."},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-26954-8_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"G Castagnos","year":"2019","unstructured":"Castagnos, G., Catalano, D., Laguillaumie, F., Savasta, F., Tucker, I.: Two-party ECDSA from hash proof systems and efficient instantiations. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 191\u2013221. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_7"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Castagnos, G., Catalano, D., Laguillaumie, F., Savasta, F., Tucker, I.: Bandwidth-efficient threshold EC-DSA. Cryptology ePrint Archive, Report 2020\/084 (2020)","DOI":"10.1007\/978-3-030-45388-6_10"},{"key":"10_CR12","unstructured":"Croft, R.A., Harris, S.P.: Public-key cryptography and reusable shared secret. In: Cryptography and Coding (1989)"},{"key":"10_CR13","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, Part I. LNCS, vol. 10401, pp. 255\u2013287. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_9"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-642-01001-9_25","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"J Camenisch","year":"2009","unstructured":"Camenisch, J., Kiayias, A., Yung, M.: On the portability of generalized Schnorr proofs. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 425\u2013442. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_25"},{"key":"10_CR15","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0071539","volume-title":"Number Theory","author":"H Cohen","year":"1984","unstructured":"Cohen, H., Lenstra, H.W.: Heuristics on class groups. In: Chudnovsky, D.V., Chudnovsky, G.V., Cohn, H., Nathanson, M.B. (eds.) Number Theory. LNM, vol. 1052, pp. 26\u201336. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/BFb0071539"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-319-16715-2_26","volume-title":"Topics in Cryptology \u2014 CT-RSA 2015","author":"G Castagnos","year":"2015","unstructured":"Castagnos, G., Laguillaumie, F.: Linearly homomorphic encryption from \n$$\\sf DDH$$\n. In: Nyberg, K. (ed.) CT-RSA 2015. LNCS, vol. 9048, pp. 487\u2013505. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16715-2_26"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-030-03329-3_25","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"G Castagnos","year":"2018","unstructured":"Castagnos, G., Laguillaumie, F., Tucker, I.: Practical fully secure unrestricted inner product functional encryption modulo p. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part II. LNCS, vol. 11273, pp. 733\u2013764. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_25"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"J Camenisch","year":"1997","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410\u2013424. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052252"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J Camenisch","year":"2003","unstructured":"Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 126\u2013144. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_8"},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM J. Comput. 30(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-48184-2_8","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"Y Desmedt","year":"1988","unstructured":"Desmedt, Y.: Society and group oriented cryptography: a new concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 120\u2013127. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_8"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"Y Desmedt","year":"1990","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307\u2013315. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_28"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","author":"I Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 125\u2013142. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_8"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Secure two-party threshold ECDSA from ECDSA assumptions. In: 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00036"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Threshold ECDSA from ECDSA assumptions: the multiparty case. In: 2019 IEEE Symposium on Security and Privacy. IEEE Computer Society Press (2019)","DOI":"10.1109\/SP.2019.00024"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Dalskov, A.P.K., Keller, M., Orlandi, C., Shrishak, K., Shulman, H.: Securing DNSSEC keys via threshold ECDSA from generic MPC. IACR Cryptology ePrint Archive, 2019:889 (2019)","DOI":"10.1007\/978-3-030-59013-0_32"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: Proceedings of FOCS 1987. IEEE Computer Society (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Goldfeder, S.: Fast multiparty threshold ECDSA with fast trustless setup. In: ACM CCS 2018. ACM Press (2018)","DOI":"10.1145\/3243734.3243859"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-39555-5_9","volume-title":"Applied Cryptography and Network Security","author":"R Gennaro","year":"2016","unstructured":"Gennaro, R., Goldfeder, S., Narayanan, A.: Threshold-optimal DSA\/ECDSA signatures and an application to bitcoin wallet security. In: Manulis, M., Sadeghi, A.-R., Schneider, S. (eds.) ACNS 2016. LNCS, vol. 9696, pp. 156\u2013174. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39555-5_9"},{"key":"10_CR30","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\u2019 99","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":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-68697-5_13","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201996","author":"R Gennaro","year":"1996","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust and efficient sharing of RSA functions. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 157\u2013172. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_13"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-68339-9_31","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"R Gennaro","year":"1996","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust threshold DSS signatures. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 354\u2013371. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_31"},{"issue":"2","key":"10_CR33","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10_CR34","first-page":"129","volume":"6","author":"S Hamdy","year":"2006","unstructured":"Hamdy, S., Saidak, F.: Arithmetic properties of class numbers of imaginary quadratic fields. JP J. Algebra Number Theory Appl. 6(1), 129\u2013148 (2006)","journal-title":"JP J. Algebra Number Theory Appl."},{"issue":"2","key":"10_CR35","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0196-6774(80)90021-8","volume":"1","author":"J Lagarias","year":"1980","unstructured":"Lagarias, J.: Worst-case complexity bounds for algorithms in the theory of integral quadratic forms. J. Algorithms 1(2), 142\u2013186 (1980)","journal-title":"J. Algorithms"},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-319-63715-0_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"Y Lindell","year":"2017","unstructured":"Lindell, Y.: Fast secure two-party ECDSA signing. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part II. LNCS, vol. 10402, pp. 613\u2013644. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_21"},{"key":"10_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-31284-7_14","volume-title":"Applied Cryptography and Network Security","author":"H Lipmaa","year":"2012","unstructured":"Lipmaa, H.: Secure accumulators from euclidean rings without trusted setup. In: Bao, F., Samarati, P., Zhou, J. (eds.) ACNS 2012. LNCS, vol. 7341, pp. 224\u2013240. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31284-7_14"},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Nof, A.: Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In: ACM CCS 2018. ACM Press (2018)","DOI":"10.1145\/3243734.3243788"},{"key":"10_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-44647-8_8","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"PD MacKenzie","year":"2001","unstructured":"MacKenzie, P.D., Reiter, M.K.: Two-party generation of DSA signatures. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 137\u2013154. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_8"},{"key":"10_CR40","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: ITCS 2019. LIPIcs (2019)"},{"key":"10_CR41","unstructured":"Pass, R., Rosen, A.: Concurrent non-malleable commitments. In: 46th FOCS. IEEE Computer Society Press (2005)"},{"key":"10_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-46588-1_11","volume-title":"Public Key Cryptography","author":"G Poupard","year":"2000","unstructured":"Poupard, G., Stern, J.: Short proofs of knowledge for factoring. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 147\u2013166. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46588-1_11"},{"key":"10_CR43","first-page":"215","volume":"305","author":"J Quer","year":"1987","unstructured":"Quer, J.: Corps quadratiques de 3-rang 6 et courbes elliptiques de rang 12. C. R. Acad. Sci. Paris S\u00e9r. I 305, 215\u2013218 (1987)","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. I"},{"key":"10_CR44","doi-asserted-by":"crossref","unstructured":"Smart, N.P., Alaoui, Y.T.: Distributing any elliptic curve based protocol: with an application to MixNets. IACR Cryptology ePrint Archive 2019:768 (2019)","DOI":"10.1007\/978-3-030-35199-1_17"},{"issue":"3","key":"10_CR45","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C-P Schnorr","year":"1991","unstructured":"Schnorr, C.-P.: Efficient signature generation by smart cards. J. Cryptol. 4(3), 161\u2013174 (1991)","journal-title":"J. Cryptol."},{"key":"10_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054113","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"V Shoup","year":"1998","unstructured":"Shoup, V., Gennaro, R.: Securing threshold cryptosystems against chosen ciphertext attack. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 1\u201316. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054113"},{"issue":"11","key":"10_CR47","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 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"10_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"V Shoup","year":"2000","unstructured":"Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207\u2013220. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_15"},{"key":"10_CR49","first-page":"41","volume":"35","author":"S Vanstone","year":"1992","unstructured":"Vanstone, S.: Responses to NIST\u2019s proposal. Commun. ACM 35, 41\u201354 (1992). (communicated by John Anderson)","journal-title":"Commun. ACM"},{"key":"10_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-030-17659-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Wesolowski","year":"2019","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part III. LNCS, vol. 11478, pp. 379\u2013407. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_13"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45388-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T00:05:34Z","timestamp":1682726734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-45388-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030453879","9783030453886"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45388-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edinburgh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2020\/","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":"IACR Web Review System","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"180","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":"44","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":"0","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":"24% - 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-4","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":"15","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}