{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:56:24Z","timestamp":1766066184000,"version":"3.40.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s10623-011-9601-2","type":"journal-article","created":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T12:45:16Z","timestamp":1328013916000},"page":"209-232","source":"Crossref","is-referenced-by-count":28,"title":["Group homomorphic encryption: characterizations, impossibility results, and applications"],"prefix":"10.1007","volume":"67","author":[{"given":"Frederik","family":"Armknecht","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Katzenbeisser","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Peter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,1]]},"reference":[{"key":"9601_CR1","unstructured":"Armknecht F., Sadeghi A.R.: A new approach for algebraically homomorphic encryption. Cryptol. ePr. Arch. Report 2008\/422. http:\/\/eprint.iacr.org\/ (2008). Accessed 3 Oct 2010."},{"key":"9601_CR2","unstructured":"Bellare M., Desai A., Pointcheval D., Rogaway P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk H. (ed.) CRYPTO. Lecture Notes in Computer Science, vol. 1462, pp. 26\u201345. Springer, Berlin (1998)."},{"key":"9601_CR3","unstructured":"Benaloh J.: Verifiable secret-ballot elections. PhD Thesis, Yale University, New Haven (1987)."},{"key":"9601_CR4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1090\/conm\/324\/05731","volume":"324","author":"D. Boneh","year":"2002","unstructured":"Boneh D., Silverberg A.: Applications of multilinear forms to cryptography. Contemp. Math. 324, 71\u201390 (2002)","journal-title":"Contemp. Math."},{"key":"9601_CR5","first-page":"41","volume-title":"CRYPTO Lecture Notes in Computer Science vol 3152","author":"D. Boneh","year":"2004","unstructured":"Boneh D., Boyen X., Shacham H.: Short group signatures. In: Franklin, M.K. (eds) CRYPTO Lecture Notes in Computer Science vol 3152., pp. 41\u201355. Springer, Heidelberg (2004)"},{"key":"9601_CR6","first-page":"325","volume-title":"TCC Lecture Notes in Computer Science vol 3378","author":"D. Boneh","year":"2005","unstructured":"Boneh D., Goh E.J., Nissim K.: Evaluating 2-dnf formulas on ciphertexts. In: Kilian, J. (eds) TCC Lecture Notes in Computer Science vol 3378., pp. 325\u2013341. Springer, Heidelberg (2005)"},{"key":"9601_CR7","first-page":"565","volume-title":"CRYPTO Lecture Notes in Computer Science vol 2729","author":"R. Canetti","year":"2003","unstructured":"Canetti R., Krawczyk H., Nielsen J.B.: Relaxing chosen-ciphertext security. In: Boneh, D. (eds) CRYPTO Lecture Notes in Computer Science vol 2729., pp. 565\u2013582. Springer, Heidelberg (2003)"},{"key":"9601_CR8","doi-asserted-by":"crossref","unstructured":"Catalano D., Gennaro R., Howgrave-Graham N., Nguyen P.Q.: Paillier\u2019s cryptosystem revisited. In: ACM Conference on Computer and Communications Security, pp. 206\u2013214 (2001).","DOI":"10.1145\/501983.502012"},{"key":"9601_CR9","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/978-3-642-14623-7_26","volume-title":"Advances in Cryptology CRYPTO 2010","author":"K.M. Chung","year":"2010","unstructured":"Chung K.M., Kalai Y., Vadhan S.: Improved delegation of computation using fully homomorphic encryption. In: Rabin, T. (eds) Advances in Cryptology CRYPTO 2010., pp. 483\u2013501. Lecture Notes in Computer Science vol 6223. Springer, Berlin (2010)"},{"key":"9601_CR10","unstructured":"Cohen J.D., Fischer M.J.: A robust and verifiable cryptographically secure election scheme (extended abstract). In: FOCS, pp. 372\u2013382. IEEE, Oregon (1985)."},{"key":"9601_CR11","first-page":"45","volume-title":"EUROCRYPT","author":"R. Cramer","year":"2002","unstructured":"Cramer R., Shoup V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (eds) EUROCRYPT., pp. 45\u201364. Lecture Notes in Computer Science vol 2332. Springer, Amsterdam (2002)"},{"key":"9601_CR12","doi-asserted-by":"crossref","unstructured":"Cramer R., Franklin M.K., Schoenmakers B., Yung M.: Multi-autority secret-ballot elections with linear work. In: EUROCRYPT, pp. 72\u201383 (1996).","DOI":"10.1007\/3-540-68339-9_7"},{"key":"9601_CR13","doi-asserted-by":"crossref","unstructured":"Cramer R., Gennaro R., Schoenmakers B.: A secure and optimally efficient multi-authority election scheme. In: EUROCRYPT, pp. 103\u2013118 (1997).","DOI":"10.1007\/3-540-69053-0_9"},{"key":"9601_CR14","first-page":"280","volume-title":"EUROCRYPT Lecture Notes in Computer Science vol 2045","author":"R. Cramer","year":"2001","unstructured":"Cramer R., Damg\u00e5rd I., Nielsen J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (eds) EUROCRYPT Lecture Notes in Computer Science vol 2045., pp. 280\u2013299. Springer, Heidelberg (2001)"},{"key":"9601_CR15","first-page":"445","volume-title":"CRYPTO Lecture Notes in Computer Science vol 576","author":"I. Damg\u00e5rd","year":"1991","unstructured":"Damg\u00e5rd I.: Towards practical public key systems secure against chosen ciphertext attacks. In: Feigenbaum, J. (eds) CRYPTO Lecture Notes in Computer Science vol 576., pp. 445\u2013456. Springer, New York (1991)"},{"key":"9601_CR16","first-page":"119","volume-title":"Public Key Cryptography Lecture Notes in Computer Science vol 1992","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd I., Jurik M.: A generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system. In: Kim, K. (eds) Public Key Cryptography Lecture Notes in Computer Science vol 1992., pp. 119\u2013136. Springer, Berlin (2001)"},{"key":"9601_CR17","unstructured":"Fellows M., Koblitz N.: Combinatorial cryptosystems galore! In: Finite Fields: Theory, Applications, and Algorithms. Contemporary Mathematics, vol. 168, pp. 51\u201361. American Mathematical Society, Providence (1993)."},{"key":"9601_CR18","doi-asserted-by":"crossref","unstructured":"Gamal T.E.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: CRYPTO, pp. 10\u201318 (1984).","DOI":"10.1007\/3-540-39568-7_2"},{"key":"9601_CR19","first-page":"465","volume-title":"CRYPTO Lecture Notes in Computer Science vol 6223","author":"R. Gennaro","year":"2010","unstructured":"Gennaro R., Gentry C., Parno B.: Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In: Rabin, T. (eds) CRYPTO Lecture Notes in Computer Science vol 6223., pp. 465\u2013482. Springer, Heidelberg (2010)"},{"key":"9601_CR20","doi-asserted-by":"crossref","unstructured":"Gentry C.: A fully homomorphic encryption scheme. PhD Thesis, Stanford University. http:\/\/crypto.stanford.edu\/craig (2009a). Accessed 2 Feb 2011.","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"9601_CR21","doi-asserted-by":"crossref","unstructured":"Gentry C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher M. (ed.) STOC. ACM, pp. 169\u2013178 (2009b).","DOI":"10.1145\/1536414.1536440"},{"key":"9601_CR22","unstructured":"Gentry C., Halevi S.: Implementing Gentry\u2019s Fully-Homomorphic Encryption Scheme. https:\/\/researcher.ibm.com\/researcher\/files\/us-shaih\/fhe-implementation.pdf (2010). Accessed 27 Aug 2010."},{"key":"9601_CR23","doi-asserted-by":"crossref","unstructured":"Gj\u00f8steen K.: Homomorphic cryptosystems based on subgroup membership problems. In: Dawson E., Vaudenay S. (eds.) Mycrypt. Lecture Notes in Computer Science, vol. 3715, pp. 314\u2013327. Springer (2005a).","DOI":"10.1007\/11554868_22"},{"key":"9601_CR24","first-page":"104","volume-title":"Public Key Cryptography Lecture Notes in Computer Science vol 3386","author":"K. Gj\u00f8steen","year":"2005","unstructured":"Gj\u00f8steen K.: Symmetric subgroup membership problems. In: Vaudenay, S. (eds) Public Key Cryptography Lecture Notes in Computer Science vol 3386., pp. 104\u2013119. Springer, Berlin (2005)"},{"key":"9601_CR25","first-page":"150","volume-title":"CT-RSA Lecture Notes in Computer Science vol 3860","author":"K. Gj\u00f8steen","year":"2006","unstructured":"Gj\u00f8steen K.: A new security proof for Damg\u00e5rd\u2019s ElGamal. In: Pointcheval, D. (eds) CT-RSA Lecture Notes in Computer Science vol 3860., pp. 150\u2013158. Springer, Heidelberg (2006)"},{"issue":"2","key":"9601_CR26","doi-asserted-by":"crossref","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":"9601_CR27","first-page":"97","volume-title":"CRYPTO Lecture Notes in Computer Science vol 4117","author":"J. Groth","year":"2006","unstructured":"Groth J., Ostrovsky R., Sahai A.: Non-interactive zaps and new techniques for nizk. In: Dwork, C. (eds) CRYPTO Lecture Notes in Computer Science vol 4117., pp. 97\u2013111. Springer, Heidelberg (2006)"},{"key":"9601_CR28","first-page":"127","volume":"16","author":"B. Hemenway","year":"2009","unstructured":"Hemenway B., Ostrovsky R.: Lossy trapdoor functions from smooth homomorphic hash proof systems. Electron. Colloq. Comput. Complex. 16, 127 (2009)","journal-title":"Electron. Colloq. Comput. Complex."},{"key":"9601_CR29","unstructured":"Hofheinz D., Kiltz E.: Secure hybrid encryption from weakened key encapsulation. In: Menezes A. (ed.) CRYPTO. Lecture Notes in Computer Science, vol. 4622, pp. 553\u2013571. Springer, Heidelberg (2007)."},{"issue":"4","key":"9601_CR30","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s00145-003-0052-4","volume":"16","author":"A. Joux","year":"2003","unstructured":"Joux A., Nguyen K.: Separating decision Diffie\u2013Hellman from computational Diffie\u2013Hellman in cryptographic groups. J. Cryptol. 16(4), 239\u2013247 (2003)","journal-title":"J. Cryptol."},{"key":"9601_CR31","first-page":"581","volume-title":"TCC Lecture Notes in Computer Science vol 3876","author":"E. Kiltz","year":"2006","unstructured":"Kiltz E.: Chosen-ciphertext security from tag-based encryption. In: Halevi, S., Rabin, T. (eds) TCC Lecture Notes in Computer Science vol 3876., pp. 581\u2013600. Springer, Berlin (2006)"},{"key":"9601_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/b97433","volume-title":"The Theory of Finite Groups An Introduction","author":"H. Kurzweil","year":"2004","unstructured":"Kurzweil H., Stellmacher B.: The Theory of Finite Groups An Introduction. Springer, Berlin (2004)"},{"key":"9601_CR33","unstructured":"Kushilevitz E., Ostrovsky R.: Replication is not needed: single database, computationally-private information retrieval. In: FOCS, pp. 364\u2013373 (1997)."},{"key":"9601_CR34","volume-title":"Algebra Graduate Texts in Mathematics vol 211","author":"S. Lang","year":"2002","unstructured":"Lang S.: Algebra Graduate Texts in Mathematics vol 211. Springer-Verlag, New York (2002)"},{"key":"9601_CR35","doi-asserted-by":"crossref","unstructured":"Lewko, A.B., Waters, B.: Efficient pseudorandom functions from the decisional linear assumption and weaker variants. In: Al-Shaer, E., Jha, S., Keromytis, A.D. (eds.) ACM Conference on Computer and Communications Security, pp. 112\u2013120. ACM (2009)","DOI":"10.1145\/1653662.1653677"},{"key":"9601_CR36","doi-asserted-by":"crossref","unstructured":"Lipmaa H.: On the cca1-security of ElGamal and Damg\u00e5rd\u2019s ElGamal. In: Proceedings of Inscrypt 2010. Springer. http:\/\/research.cyber.ee\/~lipmaa\/papers\/lip10\/ (2010). Accessed 20 Oct 2010.","DOI":"10.1007\/978-3-642-21518-6_2"},{"key":"9601_CR37","doi-asserted-by":"crossref","unstructured":"Maurer U.M.: Abstract models of computation in cryptography. In: Smart N.P. (ed.) IMA Int. Conf. Lecture Notes in Computer Science, vol. 3796, pp. 1\u201312. Springer (2005).","DOI":"10.1007\/b106721"},{"key":"9601_CR38","doi-asserted-by":"crossref","unstructured":"Naccache D., Stern J.: A new public key cryptosystem based on higher residues. In: ACM Conference on Computer and Communications Security, pp. 59\u201366 (1998).","DOI":"10.1145\/288090.288106"},{"issue":"5","key":"9601_CR39","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1137\/S0097539704383633","volume":"35","author":"M. Naor","year":"2006","unstructured":"Naor M., Pinkas B.: Oblivious polynomial evaluation. SIAM J. Comput 35(5), 1254\u20131281 (2006)","journal-title":"SIAM J. Comput"},{"key":"9601_CR40","unstructured":"Naor M., Segev G.: Public-key cryptosystems resilient to key leakage. In: Halevi S. (ed.) CRYPTO. Lecture Notes in Computer Science, vol. 5677, pp. 18\u201335. Springer (2009)."},{"key":"9601_CR41","doi-asserted-by":"crossref","unstructured":"Okamoto T., Uchiyama S.: A new public-key cryptosystem as secure as factoring. In: EUROCRYPT, pp. 308\u2013318 (1998).","DOI":"10.1007\/BFb0054135"},{"key":"9601_CR42","doi-asserted-by":"crossref","unstructured":"Paillier P.: Public-key cryptosystems based on composite degree residuosity classes. In: EUROCRYPT, pp. 223\u2013238 (1999).","DOI":"10.1007\/3-540-48910-X_16"},{"key":"9601_CR43","doi-asserted-by":"crossref","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Dwork, C. (ed.) STOC, pp. 187\u2013196. ACM (2008)","DOI":"10.1145\/1374376.1374406"},{"key":"9601_CR44","unstructured":"Prabhakaran M., Rosulek M.: Homomorphic encryption with cca security. In: Aceto L., Damg\u00e5rd I., Goldberg L.A., Halld\u00f3rsson M.M., Ing\u00f3lfsd\u00f3ttir A., Walukiewicz I. (eds.) ICALP (2). Lecture Notes in Computer Science, vol. 5126, pp. 667\u2013678. Springer (2008)."},{"key":"9601_CR45","unstructured":"Shacham H.: A cramer-shoup encryption scheme from the linear assumption and from progressively weaker linear variants. Cryptol. ePr. Arch. Report 2007\/074. http:\/\/eprint.iacr.org\/ (2007). Accessed 10 Nov 2010."},{"key":"9601_CR46","doi-asserted-by":"crossref","unstructured":"Shoup V.: Lower bounds for discrete logarithms and related problems. In: EUROCRYPT, pp. 256\u2013266 (1997).","DOI":"10.1007\/3-540-69053-0_18"},{"key":"9601_CR47","unstructured":"Smart N.P., Vercauteren F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Nguyen P.Q., Pointcheval D. (eds.) Public Key Cryptography. Lecture Notes in Computer Science, vol. 6056, pp. 420\u2013443. Springer, Berlin (2010)."},{"key":"9601_CR48","first-page":"117","volume-title":"Public Key Cryptography Lecture Notes in Computer Science vol 1431","author":"Y. Tsiounis","year":"1998","unstructured":"Tsiounis Y., Yung M.: On the security of ElGamal based encryption. In: Imai, H., Zheng, Y. (eds) Public Key Cryptography Lecture Notes in Computer Science vol 1431., pp. 117\u2013134. Springer, Berlin (1998)"},{"key":"9601_CR49","unstructured":"van Dijk M., Gentry C., Halevi S., Vaikuntanathan V.: Fully homomorphic encryption over the integers. In: Gilbert H. (ed.) EUROCRYPT. Lecture Notes in Computer Science, vol. 6110, pp. 24\u201343. Springer, Berlin (2010)."},{"key":"9601_CR50","unstructured":"Wu J., Stinson D.: On the security of the ElGamal encryption scheme and damgards variant. Cryptol. ePr. Arch. Report 2008\/200. http:\/\/eprint.iacr.org\/ (2008). Accessed 10 Nov 2010."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9601-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-011-9601-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9601-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:59:17Z","timestamp":1742392757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-011-9601-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,1]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["9601"],"URL":"https:\/\/doi.org\/10.1007\/s10623-011-9601-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2012,2,1]]}}}