{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:16:24Z","timestamp":1746159384499,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642546303"},{"type":"electronic","value":"9783642546310"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54631-0_32","type":"book-chapter","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T10:04:17Z","timestamp":1392890657000},"page":"556-573","source":"Crossref","is-referenced-by-count":13,"title":["General Impossibility of Group Homomorphic Encryption in the Quantum World"],"prefix":"10.1007","author":[{"given":"Frederik","family":"Armknecht","sequence":"first","affiliation":[]},{"given":"Tommaso","family":"Gagliardoni","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Katzenbeisser","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Peter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-25516-8_3","volume-title":"Cryptography and Coding","author":"F. Armknecht","year":"2011","unstructured":"Armknecht, F., Augot, D., Perret, L., Sadeghi, A.R.: On constructing homomorphic encryption schemes from coding theory. In: Chen, L. (ed.) IMACC 2011. LNCS, vol.\u00a07089, pp. 23\u201340. Springer, Heidelberg (2011)"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Armknecht, F., Gagliardoni, T., Katzenbeisser, S., Peter, A.: General impossibility of group homomorphic encryption in the quantum world. Cryptology ePrint Archive, Report 2014\/029 (2014), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-54631-0_32"},{"key":"32_CR3","unstructured":"Armknecht, F., Katzenbeisser, S., Peter, A.: Group homomorphic encryption: characterizations, impossibility results, and applications. Designs, Codes and Cryptography, 1\u201324, 10.1007\/s10623-011-9601-2"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-31410-0_15","volume-title":"Progress in Cryptology - AFRICACRYPT 2012","author":"F. Armknecht","year":"2012","unstructured":"Armknecht, F., Katzenbeisser, S., Peter, A.: Shift-type homomorphic encryption and its application to fully homomorphic encryption. In: Mitrokotsa, A., Vaudenay, S. (eds.) AFRICACRYPT 2012. LNCS, vol.\u00a07374, pp. 234\u2013251. Springer, Heidelberg (2012)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Babai, L.: Local expansion of vertex-transitive graphs and random generation in finite groups. In: STOC, pp. 164\u2013174. ACM (1991)","DOI":"10.1145\/103418.103440"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/3-540-68697-5_22","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"D. Boneh","year":"1996","unstructured":"Boneh, D., Lipton, R.J.: Algorithms for black-box fields and their application to cryptography (extended abstract). In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 283\u2013297. Springer, Heidelberg (1996)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. In: ITCS. pp. 309\u2013325. ACM (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 280\u2013299. Springer, Heidelberg (2001)"},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Heidelberg (1997)"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology - EUROCRYPT 2002","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. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 45\u201364. Springer, Heidelberg (2002)"},{"issue":"3","key":"32_CR11","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S009753970343141X","volume":"36","author":"W. Dam van","year":"2006","unstructured":"van Dam, W., Hallgren, S., Ip, L.: Quantum algorithms for some hidden shift problems. SIAM J. Comput.\u00a036(3), 763\u2013778 (2006)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1504\/IJACT.2008.017048","volume":"1","author":"I. Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M.: Homomorphic encryption and secure comparison. IJACT\u00a01(1), 22\u201331 (2008)","journal-title":"IJACT"},{"issue":"6","key":"32_CR13","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T. El Gamal","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02806383","volume":"14","author":"P. Erd\u00f6s","year":"1965","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: Probabilistic methods in group theory. J. Analyse Math.\u00a014, 127\u2013138 (1965)","journal-title":"J. Analyse Math."},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC. pp. 169\u2013178. ACM (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/978-3-642-32009-5_49","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"C. Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the aes circuit. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 850\u2013867. Springer, Heidelberg (2012)"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/11554868_22","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"K. Gj\u00f8steen","year":"2005","unstructured":"Gj\u00f8steen, K.: Homomorphic cryptosystems based on subgroup membership problems. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol.\u00a03715, pp. 314\u2013327. Springer, Heidelberg (2005)"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography, vol. 2, Basic Applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"issue":"2","key":"32_CR20","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.\u00a028(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-540-70583-3_48","volume-title":"Automata, Languages and Programming","author":"S. Hallgren","year":"2008","unstructured":"Hallgren, S., Kolla, A., Sen, P., Zhang, S.: Making classical honest verifier zero knowledge protocols secure against quantum attacks. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 592\u2013603. Springer, Heidelberg (2008)"},{"key":"32_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-642-22792-9_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S. Hallgren","year":"2011","unstructured":"Hallgren, S., Smith, A., Song, F.: Classical cryptographic protocols in a quantum world. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 411\u2013428. Springer, Heidelberg (2011)"},{"key":"32_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-30057-8_4","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"B. Hemenway","year":"2012","unstructured":"Hemenway, B., Ostrovsky, R.: On homomorphic encryption and chosen-ciphertext security. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol.\u00a07293, pp. 52\u201365. Springer, Heidelberg (2012)"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single database, computationally-private information retrieval. In: FOCS. pp. 364\u2013373 (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"Mosca, M.: Quantum computing, cryptography and compilers. In: ISMVL. pp. 154\u2013156. IEEE (2012)","DOI":"10.1109\/ISMVL.2012.70"},{"key":"32_CR26","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 - 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.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"32_CR27","doi-asserted-by":"crossref","unstructured":"Pak, I., Bratus, S.: On sampling generating sets of finite groups and product replacement algorithm (extended abstract). In: ISSAC, pp. 91\u201396. ACM (1999)","DOI":"10.1145\/309831.309871"},{"key":"32_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-33383-5_15","volume-title":"Information Security","author":"A. Peter","year":"2012","unstructured":"Peter, A., Kronberg, M., Trei, W., Katzenbeisser, S.: Additively homomorphic encryption with a double decryption mechanism, revisited. In: Gollmann, D., Freiling, F.C. (eds.) ISC 2012. LNCS, vol.\u00a07483, pp. 242\u2013257. Springer, Heidelberg (2012)"},{"issue":"2","key":"32_CR29","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"32_CR30","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: FOCS, pp. 124\u2013134. IEEE Computer Society (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"32_CR31","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Quantum algorithms for solvable groups. In: STOC, pp. 60\u201367. ACM (2001)","DOI":"10.1145\/380752.380759"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54631-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T22:05:18Z","timestamp":1746137118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54631-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642546303","9783642546310"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54631-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}