{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:32:53Z","timestamp":1743125573514,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031346705"},{"type":"electronic","value":"9783031346712"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-34671-2_3","type":"book-chapter","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T23:02:58Z","timestamp":1687302178000},"page":"32-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Extended GCD and\u00a0Class Groups from\u00a0Secure Integer Arithmetic"],"prefix":"10.1007","author":[{"given":"Berry","family":"Schoenmakers","sequence":"first","affiliation":[]},{"given":"Toon","family":"Segers","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,21]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-030-56877-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"T Attema","year":"2020","unstructured":"Attema, T., Cramer, R.: Compressed $$Sigma$$-protocol theory and\u00a0practical application to Plug & play secure algorithmics. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 513\u2013543. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_18"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Algesheimer, J., Camenisch, J., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products, 417\u2013432 (2002)","DOI":"10.1007\/3-540-45708-9_27"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11682462_8","volume-title":"LATIN 2006: Theoretical Informatics","author":"S Agarwal","year":"2006","unstructured":"Agarwal, S., Frandsen, G.S.: A new GCD algorithm for quadratic number rings with unique factorization. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 30\u201342. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11682462_8"},{"issue":"4","key":"3_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0898-1221(87)90130-1","volume":"14","author":"AW Bojanczyk","year":"1987","unstructured":"Bojanczyk, A.W., Brent, R.P.: A systolic algorithm for extended GCD computation. Comput. Math. Appl. 14(4), 233\u2013238 (1987)","journal-title":"Comput. Math. Appl."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Proceedings of Symposium on Theory of Computing (STOC \u201988), pp. 1\u201310. ACM (1988)","DOI":"10.1145\/62212.62213"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-84259-8_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"AR Block","year":"2021","unstructured":"Block, A.R., Holmgren, J., Rosen, A., Rothblum, R.D., Soni, P.: Time- and space-efficient arguments from groups of unknown order. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 123\u2013152. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_5"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction, 201\u2013209 (1989)","DOI":"10.1145\/72981.72995"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Brent, R.P., Kung, H.T.: A systolic algorithm for integer GCD computation. In 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH), pages 118\u2013125 (1985)","DOI":"10.1109\/ARITH.1985.6158931"},{"key":"3_CR9","unstructured":"Buchmann, J.A., Vollmer, U.: Binary quadratic forms - an algorithmic approach, volume 20 of Algorithms and computation in mathematics. Springer (2007)"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"340","DOI":"10.46586\/tches.v2019.i3.340-398","volume":"2019","author":"DJ Bernstein","year":"2019","unstructured":"Bernstein, D.J., Yang, B.-Y.: Fast constant-time GCD computation and modular inversion. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(3), 340\u2013398 (2019)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Cohen, H.: A course in computational algebraic number theory, volume 138 of Graduate texts in mathematics. Springer (1993)","DOI":"10.1007\/978-3-662-02945-9"},{"key":"3_CR12","unstructured":"Cox, D.A.: Primes of the form $$x^2+ ny^2$$: Fermat, class field theory, and complex multiplication, volume 34. John Wiley & Sons (2011)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Catrina, O., Saxena, A.: Secure computation with fixed-point numbers, 35\u201350 (2010)","DOI":"10.1007\/978-3-642-14577-3_6"},{"key":"3_CR14","unstructured":"David, N., Espitau, T., Hosoyamada, A.: Quantum binary quadratic form reduction. IACR Cryptol. ePrint Arch. p. 466 (2022)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation, pp. 285\u2013304 (2006)","DOI":"10.1007\/11681878_15"},{"issue":"2","key":"3_CR16","first-page":"25","volume":"1","author":"S Dobson","year":"2022","unstructured":"Dobson, S., Galbraith, S., Smith, B.: Trustless unknown-order groups. Math. Cryptol. 1(2), 25\u201339 (2022)","journal-title":"Math. Cryptol."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Dixon, J.D.: Generating random elements in finite groups. Electron. J. Comb., 15(1) (2008)","DOI":"10.37236\/818"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of Principles of Distributed Computing, PODC \u201998, pp. 101\u2013111. ACM (1998)","DOI":"10.1145\/277697.277716"},{"key":"3_CR19","unstructured":"Hoogh, de, S.J.A.: Design of large scale applications of secure multiparty computation : secure linear programming. PhD thesis, Technische Universiteit Eindhoven, Department of Mathematics and Computer Science (2012)"},{"key":"3_CR20","unstructured":"Knuth, D.E.: The art of computer programming, volume 2: Seminumerical algorithms (1969)"},{"key":"3_CR21","unstructured":"Dirichlet, P.L.: Vorlesungen \u00fcber Zahlentheorie (1863)"},{"key":"3_CR22","unstructured":"Long, L.: Binary quadratic forms. GitHub https:\/\/github.com\/Chia-Network\/vdf-competition\/blob\/master\/classgroups.pdf (2019). Accessed 23 Jan 2020"},{"key":"3_CR23","unstructured":"Menezes, A., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press (1996)"},{"key":"3_CR24","unstructured":"Schaub, J.: Implementiering von Public-Key-Kryptosystemen \u00fcber imagin\u00e4r-quadratischen Ordnungen (Master\u2019s thesis). Technische Universit\u00e4t Darmstadt, Fachbereich Informatik (1999)"},{"key":"3_CR25","unstructured":"Schielzeth, D.: Realisierung der elgamal-verschl\u00fcsselung in quadratischen z\u00e4hlkorpern (Master\u2019s thesis). Technische Universit\u00e4t Berlin. http:\/\/www.math.tu-berlin.de\/kant\/publications.html (2003)"},{"key":"3_CR26","unstructured":"Schoenmakers, B.: MPyC secure multiparty computation in Python. GitHub https:\/\/github.com\/lschoe\/mpyc (2018)"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Shanks, D.: Class number, a theory of factorization, and genera. In: Proceedings of the Symp. Math. Soc., 1971, volume 20, pages 41\u2013440, 1971","DOI":"10.1090\/pspum\/020\/0316385"},{"key":"3_CR28","unstructured":"Schoenmakers, B., Segers, T.: Verifiable MPC. GitHub. https:\/\/github.com\/toonsegers\/verifiable_mpc (2022)"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-319-39555-5_19","volume-title":"Applied Cryptography and Network Security","author":"B Schoenmakers","year":"2016","unstructured":"Schoenmakers, B., Veeningen, M., de Vreede, N.: Trinocchio: privacy-preserving outsourcing by distributed verifiable computation. In: Manulis, M., Sadeghi, A.-R., Schneider, S. (eds.) ACNS 2016. LNCS, vol. 9696, pp. 346\u2013366. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39555-5_19"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9, D., Zimmermann, P.: A binary recursive GCD algorithm. In: Buell, D., (edt.), Algorithmic Number Theory, pages 411\u2013425, Berlin, Heidelberg. Springer, Berlin Heidelberg (2004)","DOI":"10.1007\/978-3-540-24847-7_31"},{"key":"3_CR31","unstructured":"Toft, T.: Primitives and applications for multi-party computation. PhD thesis, Aarhus University (2007)"},{"key":"3_CR32","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. 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","Cyber Security, Cryptology, and Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34671-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:19:15Z","timestamp":1710332355000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34671-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031346705","9783031346712"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34671-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSCML","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyber Security, Cryptology, and Machine Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Be'er Sheva","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cscml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cscml.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"70","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":"21","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":"15","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":"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":"5","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)"}}]}}