{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:18:41Z","timestamp":1742991521992,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031533679"},{"type":"electronic","value":"9783031533686"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-53368-6_17","type":"book-chapter","created":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T19:02:15Z","timestamp":1708282935000},"page":"346-366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Secure Function Extensions to\u00a0Additively Homomorphic Cryptosystems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5991-016X","authenticated-orcid":false,"given":"Mounika","family":"Pratapa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0228-0371","authenticated-orcid":false,"given":"Aleksander","family":"Essex","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-030-12612-4_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2019","author":"M Abspoel","year":"2019","unstructured":"Abspoel, M., Bouman, N.J., Schoenmakers, B., de Vreede, N.: Fast secure comparison for medium-sized integers and its application in binarized neural networks. In: Matsui, M. (ed.) CT-RSA 2019. LNCS, vol. 11405, pp. 453\u2013472. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_23"},{"key":"17_CR2","unstructured":"Adida, B.: Helios: web-based open-audit voting. In: USENIX Security Symposium, vol. 17, pp. 335\u2013348 (2008)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Asharov, G., Halevi, S., Lindell, Y., Rabin, T.: Privacy-preserving search of similar patients in genomic data. In: Proceedings on Privacy Enhancing Technologies, vol. 2018, no. 4, pp. 104\u2013124 (2018)","DOI":"10.1515\/popets-2018-0034"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Wagstaff Jr, S.S.: Watermarking with quadratic residues. In: Security and Watermarking of Multimedia Contents, vol. 3657, pp. 283\u2013288. International Society for Optics and Photonics (1999)","DOI":"10.1117\/12.344677"},{"key":"17_CR5","unstructured":"Brauer, A.: Combinatorial methods in the distribution of k-th. power residues. Comb. Math. Appl. 14\u201337 (1969)"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF01937490","volume":"24","author":"DA Buell","year":"1984","unstructured":"Buell, D.A., Hudson, R.H.: On runs of consecutive quadratic residues and quadratic nonresidues. BIT Numer. Math. 24(2), 243\u2013247 (1984)","journal-title":"BIT Numer. Math."},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1112\/S0025579300001157","volume":"4","author":"DA Burgess","year":"1957","unstructured":"Burgess, D.A.: The distribution of quadratic residues and non-residues. Mathematika 4(2), 106\u2013112 (1957)","journal-title":"Mathematika"},{"key":"17_CR8","unstructured":"Carella, N.A.: Consecutive quadratic residues and quadratic nonresidue modulo $$ p$$. arXiv preprint arXiv:2011.11054 (2020)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Cheng, K., Hou, Y., Wang, L.: Secure similar sequence query on outsourced genomic data. In: Proceedings of the 2018 on Asia Conference on Computer and Communications Security, pp. 237\u2013251 (2018)","DOI":"10.1145\/3196494.3196535"},{"key":"17_CR10","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Proceedings of IEEE 36th Annual Foundations of Computer Science, pp. 41\u201350. IEEE (1995)"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1504\/IJACT.2008.017048","volume":"1","author":"I Damgard","year":"2008","unstructured":"Damgard, I., Geisler, M., Kroigaard, M.: Homomorphic encryption and secure comparison. Int. J. Appl. Cryptogr. 1(1), 22\u201331 (2008)","journal-title":"Int. J. Appl. Cryptogr."},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-73458-1_30","volume-title":"Information Security and Privacy","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M.: Efficient and secure comparison for on-line auctions. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 416\u2013430. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73458-1_30"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/0-387-34799-2_13","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"IB Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: On the randomness of legendre and jacobi sequences. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 163\u2013172. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_13"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1112\/jlms\/s1-6.1.49","volume":"1","author":"H Davenport","year":"1931","unstructured":"Davenport, H.: On the distribution of quadratic residues (mod p). J. Lond. Math. Soc. 1(1), 49\u201354 (1931)","journal-title":"J. Lond. Math. Soc."},{"issue":"7","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1016\/j.jcss.2013.03.002","volume":"79","author":"L Egidi","year":"2013","unstructured":"Egidi, L., Manzini, G.: Better spaced seeds using quadratic residues. J. Comput. Syst. Sci. 79(7), 1144\u20131155 (2013)","journal-title":"J. Comput. Syst. Sci."},{"issue":"10","key":"17_CR16","doi-asserted-by":"publisher","first-page":"2623","DOI":"10.1109\/TIFS.2019.2903651","volume":"14","author":"A Essex","year":"2019","unstructured":"Essex, A.: Secure approximate string matching for privacy-preserving record linkage. IEEE Trans. Inf. Forensics Secur. 14(10), 2623\u20132632 (2019)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Feige, U., Killian, J., Naor, M.: A minimal model for secure computation. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, pp. 554\u2013563 (1994)","DOI":"10.1145\/195058.195408"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Frikken, K., Atallah, M., Zhang, C.: Privacy-preserving credit checking. In: Proceedings of the 6th ACM Conference on Electronic Commerce, pp. 147\u2013154 (2005)","DOI":"10.1145\/1064009.1064025"},{"key":"17_CR19","unstructured":"Gauss, C.F.: Disquisitiones arithmeticae, vol. 157. Yale University Press, Yale (1966)"},{"key":"17_CR20","unstructured":"Green, B., Tao, T.: The primes contain arbitrarily long arithmetic progressions (2004)"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"T Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 308\u2013318. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054135"},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-x_16","DOI":"10.1007\/3-540-48910-x_16"},{"issue":"197","key":"17_CR23","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1090\/S0025-5718-1992-1106978-9","volume":"58","author":"R Peralta","year":"1992","unstructured":"Peralta, R.: On the distribution of quadratic residues and nonresidues modulo a prime number. Math. Comput. 58(197), 433\u2013440 (1992)","journal-title":"Math. Comput."},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Riazi, M.S., Weinert, C., Tkachenko, O., Songhori, E.M., Schneider, T., Koushanfar, E.: Chameleon: a hybrid secure computation framework for machine learning applications. In: Proceedings of the 2018 on Asia Conference on Computer and Communications Security, ASIACCS \u201918, pp. 707\u2013721. Association for Computing Machinery, New York (2018)","DOI":"10.1145\/3196494.3196522"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Salem, A., Berrang, P., Humbert, M., Backes, M.: Privacy-preserving similar patient queries for combined biomedical data. In: Proceedings on Privacy Enhancing Technologies, vol. 2019, no. 1, pp. 47\u201367 (2019)","DOI":"10.2478\/popets-2019-0004"},{"key":"17_CR26","first-page":"123","volume":"37","author":"A S\u00e1rk\u00f6zy","year":"2007","unstructured":"S\u00e1rk\u00f6zy, A.: On finite pseudorandom binary sequences and their applications in cryptography. Tatra Mt. Math. Publ. 37, 123\u2013136 (2007)","journal-title":"Tatra Mt. Math. Publ."},{"issue":"2","key":"17_CR27","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s-10998-007-2163-9","volume":"54","author":"A S\u00e1rk\u00f6zy","year":"2007","unstructured":"S\u00e1rk\u00f6zy, A., Stewart, C.L.: On pseudorandomness in families of sequences derived from the legendre symbol. Period. Math. Hung. 54(2), 163\u2013173 (2007)","journal-title":"Period. Math. Hung."},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Schneider, T., Tkachenko, O.: Episode: efficient privacy-preserving similar sequence queries on outsourced genomic databases. In: Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security, pp. 315\u2013327 (2019)","DOI":"10.1145\/3321705.3329800"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (SFCS 1986), pp. 162\u2013167. IEEE (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"17_CR30","unstructured":"Yu, C.H.: Sign modules in secure arithmetic circuits. Cryptology ePrint Archive (2011)"},{"key":"17_CR31","first-page":"683","volume":"2017","author":"R Zhu","year":"2017","unstructured":"Zhu, R., Huang, Y.: Efficient privacy-preserving general edit distance and beyond. IACR Cryptol. ePrint Arch. 2017, 683 (2017)","journal-title":"IACR Cryptol. ePrint Arch."}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53368-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T19:43:55Z","timestamp":1731354235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53368-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031533679","9783031533686"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53368-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fredericton, NB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"14 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sac-workshop.github.io\/sac-2023\/index.html","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":"45","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":"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":"47% - 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.09","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":"3.56","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)"}}]}}