{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T00:04:15Z","timestamp":1770681855161,"version":"3.49.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031866012","type":"print"},{"value":"9783031866029","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-86602-9_13","type":"book-chapter","created":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T23:49:55Z","timestamp":1742860195000},"page":"351-383","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["IND-CPA$$^{{\\textbf {C}}}$$: A New Security Notion for\u00a0Conditional Decryption in\u00a0Fully Homomorphic Encryption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5773-218X","authenticated-orcid":false,"given":"Bhuvnesh","family":"Chaturvedi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7411-7509","authenticated-orcid":false,"given":"Anirban","family":"Chakraborty","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8585-9425","authenticated-orcid":false,"given":"Nimish","family":"Mishra","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6368-0718","authenticated-orcid":false,"given":"Ayantika","family":"Chatterjee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6499-8346","authenticated-orcid":false,"given":"Debdeep","family":"Mukhopadhyay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,15]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-024-09526-1","volume":"38","author":"A Akavia","year":"2025","unstructured":"Akavia, A., Gentry, C., Halevi, S., Vald, M.: Achievable cca2 relaxation for homomorphic encryption. J. Cryptol. 38(1), 1\u201343 (2025). https:\/\/doi.org\/10.1007\/s00145-024-09526-1","journal-title":"J. Cryptol."},{"key":"13_CR2","unstructured":"Akavia, A., Vald, M.: On the privacy of protocols based on cpa-secure homomorphic encryption. Cryptology ePrint Archive, Paper 2021\/803 (2021). https:\/\/eprint.iacr.org\/2021\/803"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Atapoor, S., Baghery, K., Pereira, H.V., Spiessens, J.: Verifiable fhe via lattice-based snarks. IACR Commun. Cryptol. 1(1) (2024). https:\/\/doi.org\/10.62056\/a6ksdkp10","DOI":"10.62056\/a6ksdkp10"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: the ACM Conference on Computer and Communications Security, CCS\u201912 (2012). https:\/\/doi.org\/10.1145\/2382196.2382279","DOI":"10.1145\/2382196.2382279"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_16"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theor. (TOCT) 6(3), 1\u201336 (2014). https:\/\/doi.org\/10.1145\/2633600","journal-title":"ACM Trans. Comput. Theor. (TOCT)"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Chaturvedi, B., Chakraborty, A., Chatterjee, A., Mukhopadhyay, D.: \u201cask and thou shall receive\u201d: Reaction-based full key recovery attacks on fhe. In: European Symposium on Research in Computer Security, pp. 457\u2013477 (2024). https:\/\/doi.org\/10.1007\/978-3-031-70903-6_23","DOI":"10.1007\/978-3-031-70903-6_23"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Checri, M., Sirdey, R., Boudguiga, A., Bultel, J.P.: On the practical CPAD security of \u201cexact\u201d and threshold FHE schemes and libraries. In: Advances in Cryptology \u2013 CRYPTO 2024, pp. 3\u201333 (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_1","DOI":"10.1007\/978-3-031-68382-4_1"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-319-16295-9_13","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2014","author":"M Chenal","year":"2015","unstructured":"Chenal, M., Tang, Q.: On key recovery attacks against existing somewhat homomorphic encryption schemes. In: Aranha, D.F., Menezes, A. (eds.) LATINCRYPT 2014. LNCS, vol. 8895, pp. 239\u2013258. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16295-9_13"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Choe, H., Passel\u00e8gue, A., Stehl\u00e9, D., Suvanto, E.: Attacks against the ind-cpad security of exact fhe schemes. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 2505\u20132519 (2024). https:\/\/doi.org\/10.1145\/3658644.3690341","DOI":"10.1145\/3658644.3690341"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"JH Cheon","year":"2017","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2019","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2019). https:\/\/doi.org\/10.1007\/s00145-019-09319-x","journal-title":"J. Cryptol."},{"key":"13_CR14","unstructured":"Chillotti, I., Gama, N., Goubin, L.: Attacking fhe-based applications by software fault injections. Cryptology ePrint Archive, Paper 2016\/1164 (2016). https:\/\/eprint.iacr.org\/2016\/1164"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"L Ducas","year":"2015","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 617\u2013640. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24"},{"key":"13_CR16","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Paper 2012\/144 (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3390\/cryptography6010013","volume":"6","author":"P Fauzi","year":"2022","unstructured":"Fauzi, P., Hovd, M.N., Raddum, H.: On the ind-cca1 security of fhe schemes. Cryptography 6(1), 13 (2022). https:\/\/doi.org\/10.3390\/cryptography6010013","journal-title":"Cryptography"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the forty-first annual ACM symposium on Theory of computing, pp. 169\u2013178 (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Kalai, Y., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: Reusable garbled circuits and succinct functional encryption. In: Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, pp. 555\u2013564 (2013). https:\/\/doi.org\/10.1145\/2488608.2488678","DOI":"10.1145\/2488608.2488678"},{"issue":"2","key":"13_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. 28(2), 270\u2013299 (1984). https:\/\/doi.org\/10.1016\/0022-0000(84)90070-9","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"13_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2824233","volume":"62","author":"S Gorbunov","year":"2015","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Attribute-based encryption for circuits. J. ACM (JACM) 62(6), 1\u201333 (2015). https:\/\/doi.org\/10.1145\/2824233","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"13_CR22","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.hm.2010.06.003","volume":"38","author":"JF Grcar","year":"2011","unstructured":"Grcar, J.F.: How ordinary elimination became gaussian elimination. Hist. Math. 38(2), 163\u2013218 (2011). https:\/\/doi.org\/10.1016\/j.hm.2010.06.003","journal-title":"Hist. Math."},{"key":"13_CR23","unstructured":"Holdings, A.: Building a secure system using trust-zone technology. Whitepaper (2005)"},{"key":"13_CR24","unstructured":"Intel\u00ae: Intel\u00ae trust domain extensions. Whitepaper pp.\u00a01\u20139 (2022)"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-41320-9_12","volume-title":"Financial Cryptography and Data Security","author":"S Kamara","year":"2013","unstructured":"Kamara, S., Wei, L.: Garbled circuits via structured encryption. In: Adams, A.A., Brenner, M., Smith, M. (eds.) FC 2013. LNCS, vol. 7862, pp. 177\u2013188. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41320-9_12"},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische annalen 261(ARTICLE), 515\u2013534 (1982). https:\/\/doi.org\/10.1007\/bf01457454","DOI":"10.1007\/bf01457454"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/978-3-030-77870-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"B Li","year":"2021","unstructured":"Li, B., Micciancio, D.: On the security of homomorphic encryption on approximate numbers. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 648\u2013677. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_23"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Li, B., Micciancio, D., Schultz, M., Sorrell, J.: Securing approximate homomorphic encryption using differential privacy. In: Annual International Cryptology Conference, pp. 560\u2013589 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_20","DOI":"10.1007\/978-3-031-15802-5_20"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"issue":"5","key":"13_CR30","doi-asserted-by":"publisher","first-page":"2240","DOI":"10.1007\/s11424-024-3221-1","volume":"37","author":"G Ma","year":"2024","unstructured":"Ma, G., Li, H.: On the security of homomorphic encryption schemes with restricted decryption oracles. J. Syst. Sci. Complexity 37(5), 2240\u20132261 (2024). https:\/\/doi.org\/10.1007\/s11424-024-3221-1","journal-title":"J. Syst. Sci. Complexity"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Manulis, M., Nguyen, J.: Fully homomorphic encryption beyond ind-cca1 security: Integrity through verifiability. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 63\u201393 (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_3","DOI":"10.1007\/978-3-031-58723-8_3"},{"key":"13_CR32","doi-asserted-by":"publisher","unstructured":"McKeen, F., Alexandrovich, I., Anati, I., Caspi, D., Johnson, S., Leslie-Hurd, R., Rozas, C.: Intel\u00ae software guard extensions (intel\u00ae sgx) support for dynamic memory management inside an enclave. In: Proceedings of the Hardware and Architectural Support for Security and Privacy 2016, pp.\u00a01\u20139 (2016). https:\/\/doi.org\/10.1145\/2948618.2954331","DOI":"10.1145\/2948618.2954331"},{"key":"13_CR33","doi-asserted-by":"publisher","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing, pp. 427\u2013437 (1990). https:\/\/doi.org\/10.1145\/100216.100273","DOI":"10.1145\/100216.100273"},{"key":"13_CR34","unstructured":"Peng, Z.: Danger of using fully homomorphic encryption: A look at microsoft seal (2019). https:\/\/arxiv.org\/abs\/1906.07127"},{"key":"13_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"C Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D.R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 433\u2013444. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_35"},{"issue":"6","key":"13_CR36","doi-asserted-by":"publisher","first-page":"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 (JACM) 56(6), 1\u201340 (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","journal-title":"J. ACM (JACM)"},{"key":"13_CR37","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994). https:\/\/doi.org\/10.1007\/BF01581144","journal-title":"Math. Program."},{"key":"13_CR38","unstructured":"Sev-Snp, A.: Strengthening vm isolation with integrity protection and more. White Paper, January 53, 1450\u20131465 (2020)"},{"key":"13_CR39","unstructured":"Thibault, L.T., Walter, M.: Towards verifiable FHE in practice: Proving correct execution of TFHE\u2019s bootstrapping using plonky2. Cryptology ePrint Archive, Paper 2024\/451 (2024). https:\/\/eprint.iacr.org\/2024\/451"},{"key":"13_CR40","doi-asserted-by":"crossref","unstructured":"Viand, A., Knabenhans, C., Hithnawi, A.: Verifiable fully homomorphic encryption (2023). https:\/\/arxiv.org\/abs\/2301.07041","DOI":"10.1145\/3689945.3694806"},{"key":"13_CR41","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium On Foundations Of Computer Science (sfcs 1982), pp. 160\u2013164 (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.38","DOI":"10.1109\/SFCS.1982.38"},{"key":"13_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-31912-9_28","volume-title":"Information Security and Cryptology - ICISC 2011","author":"Z Zhang","year":"2012","unstructured":"Zhang, Z., Plantard, T., Susilo, W.: Reaction attack on outsourced computing with fully homomorphic encryption schemes. In: Kim, H. (ed.) ICISC 2011. LNCS, vol. 7259, pp. 419\u2013436. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31912-9_28"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-86602-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T23:50:19Z","timestamp":1742860219000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86602-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031866012","9783031866029"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86602-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"15 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2025.iis.sinica.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}