{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:51Z","timestamp":1766281011961,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":57,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662493830"},{"type":"electronic","value":"9783662493847"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49384-7_4","type":"book-chapter","created":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T00:24:21Z","timestamp":1455927861000},"page":"70-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["CCA-Secure Keyed-Fully Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Junzuo","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert H.","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changshe","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouichi","family":"Sakurai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Weng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,18]]},"reference":[{"key":"4_CR1","series-title":"lecture notes in computer science","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/978-3-642-13190-5_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S Agrawal","year":"2010","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 553\u2013572. Springer, Heidelberg (2010)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/978-3-642-14623-7_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"S Agrawal","year":"2010","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 98\u2013115. Springer, Heidelberg (2010)"},{"key":"4_CR3","series-title":"Lecture notes in computer science","first-page":"1","volume-title":"Automata, Languages and Programming","author":"M Ajtai","year":"1999","unstructured":"Ajtai, M.: Generating hard instances of the short basis problem. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, p. 1. Springer, Heidelberg (1999)"},{"key":"4_CR4","unstructured":"Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. In: Proceedings of 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, Freiburg, Germany, pp. 75\u201386, 26\u201328 February 2009"},{"key":"4_CR5","series-title":"Lecture notes in computer science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, p. 1. Springer, Heidelberg (2001)"},{"issue":"2","key":"4_CR6","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/2160158.2160159","volume":"59","author":"B Barak","year":"2012","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (im)possibility of obfuscating programs. J. ACM 59(2), 6 (2012)","journal-title":"J. ACM"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/978-3-642-01001-9_24","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"M Bellare","year":"2009","unstructured":"Bellare, M., Ristenpart, T.: Simulation without the artificial abort: simplified proof and improved concrete security for waters\u2019 IBE scheme. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 407\u2013424. Springer, Heidelberg (2009)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/978-3-642-19571-6_16","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: definitions and challenges. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 253\u2013273. Springer, Heidelberg (2011)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Boneh, D., Segev, G., Waters, B., Targeted malleability: homomorphic encryption for restricted computations. In: Innovations in Theoretical Computer Science, Cambridge, MA, USA, pp. 350\u2013366, 8\u201310 January 2012","DOI":"10.1145\/2090236.2090264"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/978-3-662-44371-2_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"D Boneh","year":"2014","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 480\u2013499. Springer, Heidelberg (2014)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/978-3-642-54631-0_29","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 501\u2013519. Springer, Heidelberg (2014)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","first-page":"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)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: ITCS, pp. 309\u2013325 (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Symposium on Theory of Computing Conference, STOC 2013, Palo Alto, CA, USA, pp. 575\u2013584, 1\u20134 June 2013","DOI":"10.1145\/2488608.2488680"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: FOCS, pp. 97\u2013106 (2011)","DOI":"10.1109\/FOCS.2011.12"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011)"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-3-540-24676-3_13","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"R Canetti","year":"2004","unstructured":"Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 207\u2013222. Springer, Heidelberg (2004)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"D Cash","year":"2010","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523\u2013552. Springer, Heidelberg (2010)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/978-3-642-29011-4_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"M Chase","year":"2012","unstructured":"Chase, M., Kohlweiss, M., Lysyanskaya, A., Meiklejohn, S.: Malleable proof systems and applications. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 281\u2013300. Springer, Heidelberg (2012)"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/978-3-642-38348-9_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"JH Cheon","year":"2013","unstructured":"Cheon, J.H., Coron, J.-S., Kim, J., Lee, M.S., Lepoint, T., Tibouchi, M., Yun, A.: Batch fully homomorphic encryption over the integers. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 315\u2013335. Springer, Heidelberg (2013)"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 2332, p. 45. Springer, Heidelberg (2002)"},{"key":"4_CR23","first-page":"989","volume":"2014","author":"Y Desmedt","year":"2014","unstructured":"Desmedt, Y., Iovino, V., Persiano, G., Visconti, I.: Controlled homomorphic encryption: definition and construction. IACR Cryptology ePrint Arch. 2014, 989 (2014)","journal-title":"IACR Cryptology ePrint Arch."},{"issue":"2","key":"4_CR24","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM J. Comput. 30(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/978-3-642-36362-7_3","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"K Emura","year":"2013","unstructured":"Emura, K., Hanaoka, G., Ohtake, G., Matsuda, T., Yamada, S.: Chosen ciphertext secure keyed-homomorphic public-key encryption. In: Hanaoka, G., Kurosawa, K. (eds.) PKC 2013. LNCS, vol. 7778, pp. 32\u201350. Springer, Heidelberg (2013)"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/978-3-642-54242-8_4","volume-title":"Theory of Cryptography","author":"S Garg","year":"2014","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M.: Two-round secure MPC from indistinguishability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 74\u201394. Springer, Heidelberg (2014)"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, Berkeley, CA, USA, pp. 40\u201349, 26\u201329 October 2013","DOI":"10.1109\/FOCS.2013.13"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Better bootstrapping in fully homomorphic encryption. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 1\u201316. Springer, Heidelberg (2012)"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/978-3-642-29011-4_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 465\u2013482. Springer, Heidelberg (2012)"},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013)"},{"key":"4_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/978-3-540-72738-5_19","volume-title":"Applied Cryptography and Network Security","author":"M Green","year":"2007","unstructured":"Green, M., Ateniese, G.: Identity-based proxy re-encryption. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 288\u2013306. Springer, Heidelberg (2007)"},{"key":"4_CR33","first-page":"720","volume":"2014","author":"D Hofheinz","year":"2014","unstructured":"Hofheinz, D., Kamath, A., Koppula, V., Waters, B.: Adaptively secure constrained pseudorandom functions. IACR Cryptology ePrint Arch. 2014, 720 (2014)","journal-title":"IACR Cryptology ePrint Arch."},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-540-85174-5_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"D Hofheinz","year":"2008","unstructured":"Hofheinz, D., Kiltz, E.: Programmable hash functions and their applications. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 21\u201338. Springer, Heidelberg (2008)"},{"key":"4_CR35","first-page":"521","volume":"2014","author":"S Hohenberger","year":"2014","unstructured":"Hohenberger, S., Koppula, V., Waters, B.: Adaptively secure puncturable pseudorandom functions in the standard model. IACR Cryptology ePrint Arch. 2014, 521 (2014)","journal-title":"IACR Cryptology ePrint Arch."},{"key":"4_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/978-3-642-55220-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Hohenberger","year":"2014","unstructured":"Hohenberger, S., Sahai, A., Waters, B.: Replacing a random Oracle: full domain hash from indistinguishability obfuscation. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 201\u2013220. Springer, Heidelberg (2014)"},{"key":"4_CR37","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"CS Jutla","year":"2013","unstructured":"Jutla, C.S., Roy, A.: Shorter quasi-adaptive NIZK proofs for linear subspaces. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part I. LNCS, vol. 8269, pp. 1\u201320. Springer, Heidelberg (2013)"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: ACM SIGSAC Conference on Computer and Communications Security, CCS 2013, Berlin, Germany, pp. 669\u2013684, 4\u20138 November (2013)","DOI":"10.1145\/2508859.2516668"},{"key":"4_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/978-3-642-40084-1_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"B Libert","year":"2013","unstructured":"Libert, B., Peters, T., Joye, M., Yung, M.: Linearly homomorphic structure-preserving signatures and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 289\u2013307. Springer, Heidelberg (2013)"},{"key":"4_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/978-3-642-55220-5_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"B Libert","year":"2014","unstructured":"Libert, B., Peters, T., Joye, M., Yung, M.: Non-malleability from malleability: simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 514\u2013532. Springer, Heidelberg (2014)"},{"key":"4_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012)"},{"key":"4_CR42","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC, pp. 427\u2013437 (1990)","DOI":"10.1145\/100216.100273"},{"key":"4_CR43","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem,extended abstract. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, pp. 333\u2013342, 31 May - 2 June (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"4_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/978-3-540-74143-5_29","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M Prabhakaran","year":"2007","unstructured":"Prabhakaran, M., Rosulek, M.: Rerandomizable RCCA encryption. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 517\u2013534. Springer, Heidelberg (2007)"},{"key":"4_CR45","unstructured":"M. Prabhakaran, M. Rosulek. Homomorphic encryption with CCA security. In Automata, Languages, Programming, 35th International Colloquium, ICALP: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations, pp. 667\u2013678, (2008)"},{"key":"4_CR46","doi-asserted-by":"crossref","unstructured":"M. Prabhakaran and M. Rosulek. Towards robust computation on encrypted data. In Advances in Cryptology - ASIACRYpPT , 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7\u201311, Proceedings, pp. 216\u2013233, (2008)","DOI":"10.1007\/978-3-540-89255-7_14"},{"key":"4_CR47","doi-asserted-by":"crossref","unstructured":"Rackoff, Charles, Simon, Daniel R.: Non-interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. In: Feigenbaum, Joan (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 433\u2013444. Springer, Heidelberg (1992)","DOI":"10.1007\/3-540-46766-1_35"},{"key":"4_CR48","first-page":"523","volume":"2014","author":"K Ramchen","year":"2014","unstructured":"Ramchen, K., Waters, B.: Fully secure and fast signing from obfuscation. IACR Cryptology ePrint Archive 2014, 523 (2014)","journal-title":"IACR Cryptology ePrint Archive"},{"key":"4_CR49","doi-asserted-by":"crossref","unstructured":"O. Regev. On lattices, learning with errors, random linear codes, and cryptography. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22\u201324, pp. 84\u201393, (2005)","DOI":"10.1145\/1060590.1060603"},{"issue":"4","key":"4_CR50","first-page":"169","volume":"32","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Foundations of secure computation 32(4), 169\u2013178 (1978)","journal-title":"Foundations of secure computation"},{"key":"4_CR51","doi-asserted-by":"crossref","unstructured":"A. Sahai. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In 40th Annual Symposium on Foundations of Computer Science, FOCS \u201999, 17\u201318 , New York, NY, USA, pp. 543\u2013553, 1999., October 1999","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"4_CR52","unstructured":"Sahai, A., Waters, B., How to use indistinguishability obfuscation, : deniable encryption, and more. In Symposium on Theory of Computing, STOC , New York, NY, USA, May 31 - June 03, pp. 475\u2013484, (2014)"},{"key":"4_CR53","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/978-3-642-13013-7_25","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"N. P. Smart","year":"2010","unstructured":"N. P. Smart and F. Vercauteren. Fully homomorphic encryption with relatively small key and ciphertext sizes. In Public Key Cryptography, pp. 420\u2013443, (2010)"},{"key":"4_CR54","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/978-3-642-17373-8_22","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"D Stehl\u00e9","year":"2010","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Faster fully homomorphic encryption. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 377\u2013394. Springer, Heidelberg (2010)"},{"key":"4_CR55","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M van Dijk","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":"4_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B Waters","year":"2005","unstructured":"Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114\u2013127. Springer, Heidelberg (2005)"},{"key":"4_CR57","first-page":"588","volume":"2014","author":"B Waters","year":"2014","unstructured":"Waters, B.: A punctured programming approach to adaptively secure functional encryption. IACR Cryptology ePrint Arch. 2014, 588 (2014)","journal-title":"IACR Cryptology ePrint Arch."}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49384-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T13:00:28Z","timestamp":1748782828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49384-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662493830","9783662493847"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49384-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"18 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}