{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T06:54:59Z","timestamp":1764053699727,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030692544"},{"type":"electronic","value":"9783030692551"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-69255-1_3","type":"book-chapter","created":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T22:04:45Z","timestamp":1612389885000},"page":"24-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A New Generalisation of the Goldwasser-Micali Cryptosystem Based on the Gap $$2^k$$-Residuosity Assumption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9541-5705","authenticated-orcid":false,"given":"Diana","family":"Maimu\u0163","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3953-2744","authenticated-orcid":false,"given":"George","family":"Te\u015feleanu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,4]]},"reference":[{"key":"3_CR1","unstructured":"OpenMP. https:\/\/www.openmp.org\/"},{"key":"3_CR2","unstructured":"The GNU Multiple Precision Arithmetic Library. https:\/\/gmplib.org\/"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-70500-0_3","volume-title":"Information Security and Privacy","author":"M Barbosa","year":"2008","unstructured":"Barbosa, M., Brouard, T., Cauchie, S., de Sousa, S.M.: Secure biometric authentication with improved accuracy. In: Mu, Y., Susilo, W., Seberry, J. (eds.) ACISP 2008. LNCS, vol. 5107, pp. 21\u201336. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70500-0_3"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Barker, E.: NIST SP800-57 Recommendation for Key Management, Part 1: General. Retrieved January (2016), 147 (2016)","DOI":"10.6028\/NIST.SP.800-57pt1r4"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00145-016-9229-5","volume":"30","author":"F Benhamouda","year":"2017","unstructured":"Benhamouda, F., Herranz, J., Joye, M., Libert, B.: Efficient cryptosystems from $$2^{k}$$-th power residue symbols. J. Cryptol. 30(2), 519\u2013549 (2017)","journal-title":"J. Cryptol."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-73458-1_8","volume-title":"Inf. Secur. Privacy","author":"J Bringer","year":"2007","unstructured":"Bringer, J., Chabanne, H., Izabach\u00e8ne, M., Pointcheval, D., Tang, Q., Zimmer, S.: An application of the goldwasser-micali cryptosystem to biometric authentication. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 96\u2013106. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73458-1_8"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, J., Fischer, M.: A robust and verifiable cryptographically secure ellection scheme (extended abstract). In: FOCS 1985, pp. 372\u2013382. IEEE Computer Society Press (1985)","DOI":"10.1109\/SFCS.1985.2"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Crandall, R., Pomerance, C.: Prime Numbers: A Computational Perspective. Number Theory and Discrete Mathematics, Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/0-387-28979-8","DOI":"10.1007\/0-387-28979-8"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: STOC 1982, pp. 365\u2013377. ACM (1982)","DOI":"10.1145\/800070.802212"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-38348-9_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"M Joye","year":"2013","unstructured":"Joye, M., Libert, B.: Efficient cryptosystems from 2k-th power residue symbols. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 76\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_5"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Joye, M., Libert, B.: Efficient Cryptosystems from $$2^{k}$$-th Power Residue Symbols. IACR Cryptology ePrint Archive 2013\/435 (2014)","DOI":"10.1007\/978-3-642-38348-9_5"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Naccache, D., Stern, J.: A new public key cryptosytem based on higher residues. In: CCS 1998, pp. 59\u201366. ACM (1998)","DOI":"10.1145\/288090.288106"},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TIFS.2012.2184092","volume":"7","author":"K Simoens","year":"2012","unstructured":"Simoens, K., Bringer, J., Chabanne, H., Seys, S.: A framework for analyzing template security and privacy in biometric authentication systems. IEEE Trans. Inf. Foren. Secur. 7(2), 833\u2013841 (2012)","journal-title":"IEEE Trans. Inf. Foren. Secur."},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Yan, S.Y.: Number Theory for Computing. Theoretical Computer Science, Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-3-662-04773-6","DOI":"10.1007\/978-3-662-04773-6"}],"container-title":["Lecture Notes in Computer Science","Innovative Security Solutions for Information Technology and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69255-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T22:06:29Z","timestamp":1612389989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69255-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030692544","9783030692551"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69255-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecITC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Technology and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bucharest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","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":"19 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"itc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.secitc.eu\/","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":"41","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":"19","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":"46% - 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","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","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":"2 invited papers  as full papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}