{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T12:43:04Z","timestamp":1768912984632,"version":"3.49.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030553036","type":"print"},{"value":"9783030553043","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":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-55304-3_21","type":"book-chapter","created":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T16:04:03Z","timestamp":1596816243000},"page":"408-424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["New Assumptions and Efficient Cryptosystems from the e-th Power Residue Symbol"],"prefix":"10.1007","author":[{"given":"Xiaopeng","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Zhenfu","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Xiaolei","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Shao","sequence":"additional","affiliation":[]},{"given":"Licheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhusen","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,6]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-36362-7_1","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"Z Brakerski","year":"2013","unstructured":"Brakerski, Z., Gentry, C., Halevi, S.: Packed ciphertexts in LWE-based homomorphic encryption. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 1\u201313. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_1"},{"key":"21_CR2","unstructured":"Benaloh, J.D.C.: Verifiable secret-ballot elections. Ph.D. thesis. Yale University, New Haven, CT, USA (1987)"},{"key":"21_CR3","doi-asserted-by":"publisher","unstructured":"Benhamouda, F., Herranz, J., Joye, M., Libert, B.: Efficient cryptosystems from $${2}^{{{k}}}$$-th power residue symbols. J. Cryptol. 30(2), 519\u2013549 (2016). https:\/\/doi.org\/10.1007\/s00145-016-9229-5","DOI":"10.1007\/s00145-016-9229-5"},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM J. Comput. 15(2), 364\u2013383 (1986)","journal-title":"SIAM J. Comput."},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-39568-7_23","volume-title":"Advances in Cryptology","author":"M Blum","year":"1985","unstructured":"Blum, M., Goldwasser, S.: An efficient probabilistic public-key encryption scheme which hides all partial information. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 289\u2013299. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_23"},{"key":"21_CR6","unstructured":"de Boer, K.: Computing the power residue symbol. Master\u2019s thesis. Nijmegen, Radboud University (2016). www.koendeboer.com"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14623-7_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"Z Brakerski","year":"2010","unstructured":"Brakerski, Z., Goldwasser, S.: Circular and leakage resilient public-key encryption under subgroup indistinguishability. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 1\u201320. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_1"},{"key":"21_CR8","unstructured":"Brier, E., Ferradi, H., Joye, M., Naccache, D.: New number-theoretic cryptographic primitives. IACR Cryptology ePrint Archive 2019, 484 (2019). https:\/\/eprint.iacr.org\/2019\/484"},{"key":"21_CR9","unstructured":"Brier, E., Naccache, D.: The thirteenth power residue symbol. IACR Cryptology ePrint Archive 2019, 1176 (2019). https:\/\/eprint.iacr.org\/2019\/1176"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"C Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402\u2013414. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_28"},{"key":"21_CR11","unstructured":"Cao, Z.: A type of public key cryptosystem based on Eisenstein ring $$\\mathbb{Z}[\\omega ]$$. In: Proceedings of the 3rd Chinese Conference of Source Coding, Channel Coding and Cryptography, pp. 178\u2013186 (1988)"},{"issue":"2","key":"21_CR12","first-page":"80","volume":"11","author":"Z Cao","year":"1990","unstructured":"Cao, Z.: A new public-key cryptosystem based on $$k^{th}$$-power residues (full version). J. China Inst. Commun. 11(2), 80\u201383 (1990)","journal-title":"J. China Inst. Commun."},{"key":"21_CR13","unstructured":"Cao, Z., Dong, X., Wang, L., Shao, J.: More efficient cryptosystems from $$k$$-th power residues. IACR Cryptology ePrint Archive 2013, 569 (2013)"},{"issue":"08","key":"21_CR14","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1142\/S1793042110003770","volume":"6","author":"PC Caranay","year":"2010","unstructured":"Caranay, P.C., Scheidler, R.: An efficient seventh power residue symbol algorithm. Int. J. Number Theor. 6(08), 1831\u20131853 (2010)","journal-title":"Int. J. Number Theor."},{"key":"21_CR15","doi-asserted-by":"publisher","unstructured":"Cohen, J.D., Fischer, M.J.: A robust and verifiable cryptographically secure election scheme (extended abstract). In: 26th Annual Symposium on Foundations of Computer Science, pp. 372\u2013382. IEEE Computer Society (1985). https:\/\/doi.org\/10.1109\/SFCS.1985.2","DOI":"10.1109\/SFCS.1985.2"},{"issue":"4","key":"21_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptol. 10(4), 233\u2013260 (1997)","journal-title":"J. Cryptol."},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s00145-011-9112-3","volume":"26","author":"DM Freeman","year":"2013","unstructured":"Freeman, D.M., Goldreich, O., Kiltz, E., Rosen, A., Segev, G.: More constructions of lossy and correlation-secure trapdoor functions. J. Cryptol. 26(1), 39\u201374 (2013)","journal-title":"J. Cryptol."},{"issue":"2","key":"21_CR18","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":"21_CR19","volume-title":"A Classical Introduction to Modern Number Theory","author":"K Ireland","year":"2013","unstructured":"Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory, vol. 84. Springer, New York (2013)"},{"key":"21_CR20","unstructured":"Joye, M.: Evaluating octic residue symbols. IACR Cryptology ePrint Archive 2019, 1196 (2019). https:\/\/eprint.iacr.org\/2019\/1196"},{"key":"21_CR21","unstructured":"Joye, M., Lapiha, O., Nguyen, K., Naccache, D.: The eleventh power residue symbol. IACR Cryptology ePrint Archive 2019, 870 (2019). https:\/\/eprint.iacr.org\/2019\/870"},{"issue":"3","key":"21_CR22","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/s00145-016-9238-4","volume":"30","author":"E Kiltz","year":"2017","unstructured":"Kiltz, E., O\u2019Neill, A., Smith, A.: Instantiability of RSA-OAEP under chosen-plaintext attack. J. Cryptol. 30(3), 889\u2013919 (2017)","journal-title":"J. Cryptol."},{"key":"21_CR23","volume-title":"Reciprocity Laws: From Euler to Eisenstein","author":"F Lemmermeyer","year":"2013","unstructured":"Lemmermeyer, F.: Reciprocity Laws: From Euler to Eisenstein. Springer, Heidelberg (2013)"},{"key":"21_CR24","doi-asserted-by":"publisher","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: CCS 1998, pp. 59\u201366. ACM (1998). https:\/\/doi.org\/10.1145\/288090.288106","DOI":"10.1145\/288090.288106"},{"key":"21_CR25","volume-title":"Algebraic Number Theory","author":"J Neukirch","year":"2013","unstructured":"Neukirch, J.: Algebraic Number Theory, vol. 322. Springer, Heidelberg (2013)"},{"key":"21_CR26","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":"21_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"issue":"6","key":"21_CR28","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/080733954","volume":"40","author":"C Peikert","year":"2011","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. SIAM J. Comput. 40(6), 1803\u20131844 (2011)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"21_CR29","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"SC Pohlig","year":"1978","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Information Theory 24(1), 106\u2013110 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055817","journal-title":"IEEE Trans. Information Theory"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45539-6_19","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"V Shoup","year":"2000","unstructured":"Shoup, V.: Using hash functions as a hedge against chosen ciphertext attack. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 275\u2013288. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_19"},{"key":"21_CR31","unstructured":"Squirrel, D.: Computing reciprocity symbols in number fields. Undergraduate thesis, Reed College (1997)"},{"key":"21_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53008-5_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"T Yamakawa","year":"2016","unstructured":"Yamakawa, T., Yamada, S., Hanaoka, G., Kunihiro, N.: Adversary-dependent lossy trapdoor function from hardness of factoring semi-smooth RSA subgroup moduli. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 3\u201332. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_1"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-55304-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T03:01:14Z","timestamp":1619233274000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-55304-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030553036","9783030553043"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-55304-3_21","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":"6 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perth, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"30 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acisp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/acisp2020\/","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":"151","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":"31","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":"5","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":"21% - 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,7","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":"4","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":"The conference was held virtually due to COVID-19 pandemic.","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)"}}]}}