{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T05:00:23Z","timestamp":1764997223756,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030126117"},{"type":"electronic","value":"9783030126124"}],"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-12612-4_23","type":"book-chapter","created":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T11:25:44Z","timestamp":1549106744000},"page":"453-472","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Fast Secure Comparison for Medium-Sized Integers and Its Application in Binarized Neural Networks"],"prefix":"10.1007","author":[{"given":"Mark","family":"Abspoel","sequence":"first","affiliation":[]},{"given":"Niek J.","family":"Bouman","sequence":"additional","affiliation":[]},{"given":"Berry","family":"Schoenmakers","sequence":"additional","affiliation":[]},{"given":"Niels","family":"de Vreede","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,3]]},"reference":[{"key":"23_CR1","unstructured":"Abspoel, M.: Search for primes with high $$d_1, d_2$$ (2018). https:\/\/github.com\/abspoel\/dk-search"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.2307\/1969420","volume":"55","author":"NC Ankeny","year":"1952","unstructured":"Ankeny, N.C.: The least quadratic non residue. Ann. Math. 55(1), 65\u201372 (1952)","journal-title":"Ann. Math."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: Proceedings of STOC 1994, pp. 554\u2013563 (1994)","DOI":"10.1145\/195058.195408"},{"key":"23_CR4","first-page":"351","volume":"66","author":"VR Fridlender","year":"1949","unstructured":"Fridlender, V.R.: On the least $$n$$th power non-residue. Dokl. Akad. Nauk. SSSR 66, 351\u2013352 (1949)","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-1-4612-3464-7_18","volume-title":"Analytic Number Theory: Proceedings of a Conference in Honor of Paul T. Bateman","author":"SW Graham","year":"1990","unstructured":"Graham, S.W., Ringrose, C.J.: Lower bounds for least quadratic non-residues. In: Berndt, B.C., et al. (eds.) Analytic Number Theory: Proceedings of a Conference in Honor of Paul T. Bateman, vol. 85, pp. 269\u2013309. Springer, Boston (1990). https:\/\/doi.org\/10.1007\/978-1-4612-3464-7_18"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1307\/mmj\/1029003482","volume":"34","author":"A Hildebrand","year":"1987","unstructured":"Hildebrand, A.: On the least pair of consecutive quadratic nonresidues. Mich. Math. J. 34(1), 57\u201362 (1987)","journal-title":"Mich. Math. J."},{"issue":"187","key":"23_CR7","first-page":"1","volume":"18","author":"I Hubara","year":"2018","unstructured":"Hubara, I., Courbariaux, M., Soudry, D., El-Yaniv, R., Bengio, Y.: Quantized neural networks: training neural networks with low precision weights and activations. J. Mach. Learn. Res. 18(187), 1\u201330 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Hudson, R.H.: The least pair of consecutive character non-residues. J. Reine Angew. Math. (281), 219\u2013220 (1976)","DOI":"10.1515\/crll.1976.281.219"},{"key":"23_CR9","unstructured":"Jacobsthal, E.: Anwendungen einer Formel aus der Theorie der quadratischen Reste. Ph.D. thesis, Friedrich-Wilhelms-Universit\u00e4t, Berlin, Germany (1906)"},{"issue":"295","key":"23_CR10","doi-asserted-by":"publisher","first-page":"2391","DOI":"10.1090\/S0025-5718-2015-02925-1","volume":"84","author":"Y Lamzouri","year":"2015","unstructured":"Lamzouri, Y., Li, X., Soundararajan, K.: Conditional bounds for the least quadratic non-residue and related problems. Math. Comput. 84(295), 2391\u20132412 (2015)","journal-title":"Math. Comput."},{"issue":"57","key":"23_CR11","first-page":"139","volume":"15","author":"UV Linnik","year":"1944","unstructured":"Linnik, U.V.: On the least prime in an arithmetic progression. I. The basic theorem. Rec. Math. [Mat. Sbornik] N.S. 15(57), 139\u2013178 (1944)","journal-title":"Rec. Math. [Mat. Sbornik] N.S."},{"key":"23_CR12","unstructured":"Lukes, R.F.: A very fast electronic number sieve. Ph.D. thesis, University of Manitoba, Winnipeg, Canada (1995)"},{"issue":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/358527.358540","volume":"24","author":"P Pritchard","year":"1981","unstructured":"Pritchard, P.: A sublinear additive sieve for finding prime numbers. Commun. ACM 24(1), 18\u201323 (1981)","journal-title":"Commun. ACM"},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1002\/mana.19490030104","volume":"3","author":"H Sali\u00e9","year":"1949","unstructured":"Sali\u00e9, H.: \u00dcber den kleinsten positiven quadratischen Nichtrest nach einer Primzahl. Math. Nachr. 3(1), 7\u20138 (1949)","journal-title":"Math. Nachr."},{"key":"23_CR15","unstructured":"Schoenmakers, B.: MPyC - secure multiparty computation in Python, v0.4.7. GitHub (2018). https:\/\/github.com\/lschoe\/mpyc"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/11792086_15","volume-title":"Algorithmic Number Theory","author":"JP Sorenson","year":"2006","unstructured":"Sorenson, J.P.: The pseudosquares prime sieve. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 193\u2013207. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11792086_15"},{"issue":"9","key":"23_CR17","doi-asserted-by":"publisher","first-page":"2503","DOI":"10.1090\/S0002-9939-02-06600-5","volume":"130","author":"ZH Sun","year":"2002","unstructured":"Sun, Z.H.: Consecutive numbers with the same Legendre symbol. Proc. Am. Math. Soc. 130(9), 2503\u20132507 (2002)","journal-title":"Proc. Am. Math. Soc."},{"key":"23_CR18","unstructured":"Toft, T.: Primitives and applications for multi-party computation. Ph.D. thesis, Aarhus Universitet, Denmark (2007)"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.jnt.2014.10.019","volume":"149","author":"E Trevi\u00f1o","year":"2015","unstructured":"Trevi\u00f1o, E.: The least $$k$$th power non-residue. J. Number Theory 149, 201\u2013224 (2015)","journal-title":"J. Number Theory"},{"key":"23_CR20","unstructured":"Xylouris, T.: \u00dcber die Nullstellen der Dirichletschen L-Funktionen und die kleinste Primzahl in einer arithmetischen Progression. Ph.D. thesis, Rheinischen Friedrich-Wilhelms-Universit\u00e4t Bonn, Germany (2011)"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on FOCS 1982, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"23_CR22","unstructured":"Yu, C.H.: Sign modules in secure arithmetic circuits. Cryptology ePrint Archive, Report 2011\/539 (2011). http:\/\/eprint.iacr.org\/2011\/539"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-12612-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:49:59Z","timestamp":1710334199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-12612-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030126117","9783030126124"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-12612-4_23","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":"3 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CT-RSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cryptographers\u2019 Track at the RSA Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"4 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctrsa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.rsaconference.com\/events\/us19","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":"Shai Halevi's Web Submission","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"28","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":"37% - 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":"10","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)"}}]}}