{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T16:20:40Z","timestamp":1782404440612,"version":"3.54.5"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018229","type":"print"},{"value":"9783032018236","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T00:00:00Z","timestamp":1761350400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T00:00:00Z","timestamp":1761350400000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-01823-6_16","type":"book-chapter","created":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T19:14:48Z","timestamp":1761333288000},"page":"207-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimized Noise Bound in\u00a0BFV Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Akshit","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Srinibas","family":"Swain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,25]]},"reference":[{"key":"16_CR1","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption, Cryptology ePrint Archive, 2012. Online. Available: https:\/\/ia.cr\/2012\/144"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Gentry, C., Fully homomorphic encryption using ideal lattices, In: Proceedings of STOC, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Chillotti, I., Ligier, D., Orfila, J.B., Tap, S.: Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE, In: Proceedings of ASIACRYPT, pp. 670\u2013699 (2021)","DOI":"10.1007\/978-3-030-92078-4_23"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a Second, In: Proceedings of EUROCRYPT, pp. 617\u2013640 (2015)","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_29"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic approximate numbers, In: Proceedings of ASIACRYPT, pp. 409\u2013437 (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"issue":"6","key":"16_CR7","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 56(6), 1\u201340 (2009)","journal-title":"J. ACM"},{"key":"16_CR8","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"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Bajard, J.C., Eynard, J., Hasan, M.A., Zucca, V.: A full RNS variant of FV like somewhat homomorphic encryption schemes, In: Proceedings of SAC, pp. 423\u2013442 (2016)","DOI":"10.1007\/978-3-319-69453-5_23"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Halevi, S., Polyakov, Y., Shoup, V.: An Improved RNS Variant of the BFV Homomorphic Encryption Scheme, In: Proceedings of CT-RSA, pp. 83\u2013105 (2019)","DOI":"10.1007\/978-3-030-12612-4_5"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-030-92078-4_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"A Kim","year":"2021","unstructured":"Kim, A., Polyakov, Y., Zucca, V.: Revisiting homomorphic encryption schemes for finite fields. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 608\u2013639. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_21"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Albrecht, M., Chase, M., Chen, H., Ding, J., Goldwasser, S., et\u00a0al.: Homomorphic encryption standard, Protecting privacy homomorphic encryption, pp. 31\u201362 (2021)","DOI":"10.1007\/978-3-030-77287-1_2"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings, In: Proceedings of EUROCRYPT, pp. 1\u201323 (2010)","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"16_CR14","unstructured":"Goldwasser, S., Kalai, Y.T., Peikert, C., Vaikuntanathan, V.: Robustness of the learning with errors assumption, In: ICS, pp. 230\u2013240 (2010)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-40041-4_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Micciancio","year":"2013","unstructured":"Micciancio, D., Peikert, C.: Hardness of SIS and LWE with Small Parameters. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 21\u201339. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_2"},{"issue":"4","key":"16_CR16","first-page":"1","volume":"2","author":"R Avanzi","year":"2019","unstructured":"Avanzi, R., Bos, J., Ducas, L., Kiltz, E., et al.: CRYSTALS-Kyber algorithm specifications. NIST PQC Round 2(4), 1\u201343 (2019)","journal-title":"NIST PQC Round"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Al\u00a0Badawi, A., Bates, J., Bergamaschi, F., Cousins , D.B., et\u00a0al.: OpenfHE: open-source fhe library, In: Proceedings of WAHC, pp. 53\u201363 (2022)","DOI":"10.1145\/3560827.3563379"},{"key":"16_CR18","unstructured":"Aggarwal, A., Li, Y., Swain, S.: Improved noise bound in BFV homomorphic encryption and its application to multiplication, cryptology ePrint Archive, Paper 2025\/899 (2025). Online. Available: https:\/\/eprint.iacr.org\/2025\/899"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01823-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T19:14:49Z","timestamp":1761333289000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01823-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,25]]},"ISBN":["9783032018229","9783032018236"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01823-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,25]]},"assertion":[{"value":"25 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"23 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2025.fordaysec.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}