{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T19:18:27Z","timestamp":1781032707023,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662479995","type":"print"},{"value":"9783662480007","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","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":[[2015]]},"DOI":"10.1007\/978-3-662-48000-7_30","type":"book-chapter","created":{"date-parts":[[2015,7,31]],"date-time":"2015-07-31T02:27:46Z","timestamp":1438309666000},"page":"609-629","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":98,"title":["Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity"],"prefix":"10.1007","author":[{"given":"Anne","family":"Broadbent","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stacey","family":"Jeffery","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,8,1]]},"reference":[{"key":"30_CR1","unstructured":"Aharonov, D., Ben-Or, M., Eban, E.: Interactive proofs for quantum computations. In: Proceeding of Innovations in Computer Science 2010 (ICS 2010), pp. 453\u2013469 (2010)"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Mosca, M., Tapp, A., De Wolf, R.: Private quantum channels. In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2000), pp. 547\u2013553 (2000)","DOI":"10.1109\/SFCS.2000.892142"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1142\/S0219749906002171","volume":"4","author":"P Arrighi","year":"2006","unstructured":"Arrighi, P., Salvail, L.: Blind quantum computation. Int. J. Quantum Inf. 4, 883\u2013898 (2006)","journal-title":"Int. J. Quantum Inf."},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Proceedings of the Second Theory of Cryptography Conference (TCC 2005), pp. 325\u2013341 (2005)","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011), pp. 97\u2013106 (2011). Full version available at Cryptology ePrint Archive, Report 2011\/344","DOI":"10.1109\/FOCS.2011.12"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Broadbent, A.: Delegating private quantum computations. Canadian Journal of Physics (2015). arXiv:1506.01328 [quant-ph]","DOI":"10.1139\/cjp-2015-0030"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Fitzsimons, J., Kashefi, E.: Universal blind quantum computation. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009), pp. 517\u2013526 (2009)","DOI":"10.1109\/FOCS.2009.36"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-40084-1_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A Broadbent","year":"2013","unstructured":"Broadbent, A., Gutoski, G., Stebila, D.: Quantum one-time programs. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 344\u2013360. Springer, Heidelberg (2013)"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Jeffery, S.: Quantum homomorphic encryption for circuits of low $$T$$ T -gate complexity (2014). arXiv:1412.8766 [quant-ph]","DOI":"10.1007\/978-3-662-48000-7_30"},{"key":"30_CR10","first-page":"456","volume":"5","author":"A Childs","year":"2005","unstructured":"Childs, A.: Secure assisted quantum computation. Quantum Inf. Comput. 5, 456\u2013466 (2005)","journal-title":"Quantum Inf. Comput."},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M Dijk van","year":"2010","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24\u201343. Springer, Heidelberg (2010)"},{"key":"30_CR12","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. 196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms4074","volume":"5","author":"KAG Fisher","year":"2014","unstructured":"Fisher, K.A.G., Broadbent, A., Shalm, L.K., Yan, Z., Lavoie, J., Prevedel, R., Jennewein, T., Resch, K.J.: Quantum computing on encrypted data. Nat. Commun. 5, 1\u20137 (2014)","journal-title":"Nat. Commun."},{"key":"30_CR14","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009). http:\/\/crypto.stanford.edu\/craig"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st annual ACM symposium on Theory of Computing (STOC 2009), pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-14623-7_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C Gentry","year":"2010","unstructured":"Gentry, C., Halevi, S., Vaikuntanathan, V.: i-hop homomorphic encryption and rerandomizable Yao circuits. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 155\u2013172. Springer, Heidelberg (2010)"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: Reusable garbled circuits and succinct functional encryption. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC 2013), pp. 555\u2013564 (2013)","DOI":"10.1145\/2488608.2488678"},{"issue":"2","key":"30_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":"30_CR19","unstructured":"Gottesman, D.: The Heisenberg representation of quantum computers. In: Group 22: Proceedings of the XXII International Colloquium on Group Theoretical Methods in Physics, pp. 32\u201343 (1998)"},{"key":"30_CR20","unstructured":"Koshiba, T.: Security notions for quantum public-key cryptography. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (Jpn. Ed.) J90-A(5), 367\u2013375 (2007). arXiv:quant-ph\/0702183"},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Post-Quantum Cryptography","author":"D Micciancio","year":"2009","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 147\u2013191. Springer, Berlin (2009)"},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-44598-6_9","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"T Okamoto","year":"2000","unstructured":"Okamoto, T., Tanaka, K., Uchiyama, S.: Quantum public-key cryptosystems. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 147\u2013165. Springer, Heidelberg (2000)"},{"key":"30_CR23","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. 1592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th annual ACM symposium on Theory of computing, (STOC 2005), pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"issue":"6","key":"30_CR25","doi-asserted-by":"publisher","first-page":"34:1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34:1\u201334:40 (2009)","journal-title":"J. ACM"},{"issue":"11","key":"30_CR26","first-page":"169","volume":"4","author":"R Rivest","year":"1978","unstructured":"Rivest, R., Adleman, L., Dertouzos, M.: On data banks and privacy homomorphisms. Found. Secure Comput. 4(11), 169\u2013177 (1978)","journal-title":"Found. Secure Comput."},{"key":"30_CR27","doi-asserted-by":"publisher","first-page":"150501","DOI":"10.1103\/PhysRevLett.109.150501","volume":"109","author":"PP Rohde","year":"2012","unstructured":"Rohde, P.P., Fitzsimons, J.F., Gilchrist, A.: Quantum walks with encrypted data. Phys. Rev. Lett. 109, 150501 (2012)","journal-title":"Phys. Rev. Lett."},{"key":"30_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-19571-6_14","volume-title":"Theory of Cryptography","author":"R Rothblum","year":"2011","unstructured":"Rothblum, R.: Homomorphic encryption: from private-key to public-key. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 219\u2013234. Springer, Heidelberg (2011)"},{"key":"30_CR29","doi-asserted-by":"crossref","unstructured":"Sander, T., Young, A., Yung, M.: Non-interactive cryptocomputing for NC $$^1$$ 1 . In: Proceedings of the 40th Annual Symposium on the Foundations of Computer Science (FOCS 1999), pp. 554\u2013566 (1999)","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"30_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/978-3-319-11659-4_15","volume-title":"Post-Quantum Cryptography","author":"F Song","year":"2014","unstructured":"Song, F.: A note on quantum security for post-quantum cryptography. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 246\u2013265. Springer, Heidelberg (2014)"},{"key":"30_CR31","unstructured":"Tan, S.-H., Kettlewell, J.A., Ouyang, Y., Chen, L., Fitzsimons, J.F.: A quantum approach to homomorphic encryption (2014). http:\/\/arxiv.org\/abs\/1411.5254"},{"key":"30_CR32","doi-asserted-by":"crossref","unstructured":"Vaikuntanathan, V.: Computing blindfolded: new developments in fully homomorphic encryption. In: Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science, (FOCS 2011), pp. 5\u201316 (2011)","DOI":"10.1109\/FOCS.2011.98"},{"key":"30_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/978-3-662-45608-8_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"V Dunjko","year":"2014","unstructured":"Dunjko, V., Fitzsimons, J.F., Portmann, C., Renner, R.: Composable security of delegated quantum computation. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, Part II. LNCS, vol. 8874, pp. 406\u2013425. Springer, Heidelberg (2014)"},{"issue":"5886","key":"30_CR34","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"WK Wootters","year":"1982","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299(5886), 802\u2013803 (1982)","journal-title":"Nature"},{"key":"30_CR35","doi-asserted-by":"crossref","unstructured":"Xiang, C., Yang, L.: Indistinguishability and semantic security for quantum encryption scheme. In: Proceedings of the SPIE 8554, Quantum and Nonlinear Optics II, p. 85540G (2012)","DOI":"10.1117\/12.999846"},{"issue":"5","key":"30_CR36","doi-asserted-by":"publisher","first-page":"050303","DOI":"10.1103\/PhysRevA.90.050303","volume":"90","author":"L Yu","year":"2014","unstructured":"Yu, L., Perez-Delgado, C.A., Fitzsimons, J.F.: Limitations on information-theoretically-secure quantum homomorphic encryption. Phys. Rev. A 90(5), 050303 (2014)","journal-title":"Phys. Rev. A"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology -- CRYPTO 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48000-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T20:40:27Z","timestamp":1748551227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48000-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662479995","9783662480007"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48000-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}