{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T12:08:01Z","timestamp":1777723681433,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:00:00Z","timestamp":1648684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:00:00Z","timestamp":1648684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s11390-021-0806-1","type":"journal-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T08:04:12Z","timestamp":1650873852000},"page":"459-467","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Generalized Goldwasser and Micali\u2019s Type Cryptosystem"],"prefix":"10.1007","volume":"37","author":[{"given":"Ying","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen-Fu","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-Lei","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,31]]},"reference":[{"issue":"2","key":"806_CR1","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest R L, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 1978, 21(2): 120-126. DOI: https:\/\/doi.org\/10.1145\/359340.359342.","journal-title":"Communications of the ACM"},{"issue":"2","key":"806_CR2","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. Journal of Computer & System Science, 1984, 28(2): 270-299. DOI: https:\/\/doi.org\/10.1016\/0022-0000(84)90070-9.","journal-title":"Journal of Computer & System Science"},{"key":"806_CR3","doi-asserted-by":"publisher","unstructured":"Blum M, Goldwasser S. An efficient probabilistic public-key encryption scheme which hides all partial information. In Proc. the 1984 Workshop on the Theory and Application of Cryptographic Techniques, August 1984, pp.289-302. DOI: https:\/\/doi.org\/10.1007\/3-540-39568-7_23.","DOI":"10.1007\/3-540-39568-7_23"},{"key":"806_CR4","doi-asserted-by":"publisher","unstructured":"Blum L, Blum M, Shub M. Comparison of two pseudo- random number generators. In Proc. the 1982 International Cryptology Conference, August 1982, pp.61-78. DOI: https:\/\/doi.org\/10.1007\/978-1-4757-0602-4_6.","DOI":"10.1007\/978-1-4757-0602-4_6"},{"key":"806_CR5","doi-asserted-by":"publisher","unstructured":"Kurosawa K, Katayama Y, Ogata W et al. General public key residue cryptosystems and mental poker protocols. In Proc. the 1990 Workshop on the Theory & Application of Cryptographic Techniques on Advances in Cryptology, May 1990, pp.374-388. DOI: https:\/\/doi.org\/10.1007\/3-540-46877-3_34.","DOI":"10.1007\/3-540-46877-3_34"},{"key":"806_CR6","doi-asserted-by":"publisher","unstructured":"Benaloh J, Tuinstra D. Receipt-free secret-ballot elections (extended abstract). In Proc. the 26th Annual ACM Symposium on Theory of Computing, May 1994, pp.544-553. DOI: https:\/\/doi.org\/10.1145\/195058.195407.","DOI":"10.1145\/195058.195407"},{"key":"806_CR7","doi-asserted-by":"publisher","unstructured":"Park S J, Lee B Y, Won D H. A probabilistic encryption using very high residuosity and its applications. In Proc. the 1995 Global Telecommunications Conference, November 1995, pp.1179-1182. DOI: https:\/\/doi.org\/10.1109\/GLOCOM.1995.502589.","DOI":"10.1109\/GLOCOM.1995.502589"},{"key":"806_CR8","doi-asserted-by":"publisher","unstructured":"Benaloh J, Fischer M J. A robust and verifiable crypto- graphically secure election scheme. In Proc. the 26th Symposium on Foundations of Computer Science, September 1985, pp.372-382. DOI: https:\/\/doi.org\/10.1109\/SFCS.1985.2.","DOI":"10.1109\/SFCS.1985.2"},{"key":"806_CR9","doi-asserted-by":"publisher","unstructured":"Naccache D, Stern J. A new public key cryptosystem based on higher residues. In Proc. the 5th ACM Conference on Computer and Communications Security, November 1998, pp.59-66. DOI: https:\/\/doi.org\/10.1145\/288090.288106.","DOI":"10.1145\/288090.288106"},{"key":"806_CR10","doi-asserted-by":"crossref","unstructured":"Joye M, Libert B. Efficient cryptosystems from 2k-th power residue symbols. In Proc. the 32nd Annual International Conference on the Theory and Applications of Crypto- graphic Techniques, May 2013, pp.76-92. DOI: 10.1007\/978- 3-642-38348-9_5.","DOI":"10.1007\/978-3-642-38348-9_5"},{"issue":"2","key":"806_CR11","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 et al. Efficient cryptosystems from 2k-th power residue symbols. Journal of Cryptology, 2017, 30(2): 519-549. DOI: https:\/\/doi.org\/10.1007\/s00145-016-9229-5.","journal-title":"Journal of Cryptology"},{"key":"806_CR12","unstructured":"Cao Z, Dong X, Wang L et al. More efficient cryptosystems from kth-power residues. Cryptology ePrint Archire: Re- port 2013\/569. https:\/\/eprint.iacr.org\/2013\/569, Jan. 2021."},{"key":"806_CR13","doi-asserted-by":"publisher","unstructured":"Zhao X, Cao Z, Dong X et al. New assumptions and efficient cryptosystems from the e-th power residue symbol. In Proc. the 25th Australasian Conference on Information Security and Privacy, November 30-December 2, 2020, pp.408-424. DOI: https:\/\/doi.org\/10.1007\/978-3-030-55304-3_21.","DOI":"10.1007\/978-3-030-55304-3_21"},{"key":"806_CR14","doi-asserted-by":"publisher","unstructured":"Okamoto T, Uchiyama S. A new public-key cryptosystem as secure as factoring. In Proc. the 1998 International Conference on the Theory and Application of Cryptographic Techniques Espoo, May 31-June 4, 1998, pp.308-318. DOI: https:\/\/doi.org\/10.1007\/BFb0054135.","DOI":"10.1007\/BFb0054135"},{"key":"806_CR15","doi-asserted-by":"publisher","unstructured":"Paillier P. Public-key cryptosystems based on composite de- gree residuosity classes. In Proc. the 1999 International Conference on the Theory and Application of Crypto- graphic Techniques, May 1999, pp.223-238. DOI: https:\/\/doi.org\/10.1007\/3-540-48910-X_16.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"806_CR16","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd I, Jurik M. A generalisation, a simplication and some applications of Paillier's probabilistic public-key system. In Proc. the 4th International Workshop on Practice and Theory in Public Key Cryptosystems, February 2001, pp.119-136. DOI: https:\/\/doi.org\/10.1007\/3-540-44586-2_9.","DOI":"10.1007\/3-540-44586-2_9"},{"issue":"4","key":"806_CR17","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1049\/iet-ifs:20060132","volume":"1","author":"OO Obi","year":"2008","unstructured":"Obi O O, Ali F H, Stipidis E. Explicit expression for decryption in a generalisation of the Paillier scheme. IET In- formation Security, 2008, 1(4): 163-166. DOI: https:\/\/doi.org\/10.1049\/iet-ifs:20060132.","journal-title":"IET In- formation Security"},{"key":"806_CR18","unstructured":"Guo Y, Cao Z, Dong X. A generalization of Paillier\u2019s public- key system with fast decryption. https:\/\/eprint.iacr.org\/2020\/796, Jan. 2021."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-021-0806-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11390-021-0806-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-021-0806-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T08:36:04Z","timestamp":1650875764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11390-021-0806-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,31]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["806"],"URL":"https:\/\/doi.org\/10.1007\/s11390-021-0806-1","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,31]]},"assertion":[{"value":"16 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}