{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T23:16:32Z","timestamp":1778109392106,"version":"3.51.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032174420","type":"print"},{"value":"9783032174437","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-17443-7_4","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T23:05:19Z","timestamp":1778108719000},"page":"59-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficiency Improvement of\u00a0Deniable FHE: Tighter Deniability Analysis and\u00a0TFHE-Based Construction"],"prefix":"10.1007","author":[{"given":"Towa","family":"Toyooka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yohei","family":"Watanabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitsugu","family":"Iwamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"4_CR1","unstructured":"Agrawal, S., Goldwasser, S., Mossel, S.: Deniable fully homomorphic encryption from LWE. Cryptology ePrint Archive, Report 2020\/1588 (2020). https:\/\/eprint.iacr.org\/2020\/1588"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Goldwasser, S., Mossel, S.: Deniable fully homomorphic encryption from learning with errors. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02021, Part\u00a0II. Lecture Notes in Computer Science, vol. 12826, pp. 641\u2013670. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_22","DOI":"10.1007\/978-3-030-84245-1_22"},{"key":"4_CR3","unstructured":"Al Badawi, A., Polyakov, Y.: Demystifying bootstrapping in fully homomorphic encryption. Cryptology ePrint Archive, Report 2023\/149 (2023). https:\/\/eprint.iacr.org\/2023\/149"},{"issue":"7","key":"4_CR4","doi-asserted-by":"publisher","first-page":"428","DOI":"10.2307\/2322999","volume":"91","author":"CW Barnes","year":"1984","unstructured":"Barnes, C.W.: Euler\u2019s constant and e. Am. Math. Mon. 91(7), 428\u2013430 (1984). https:\/\/doi.org\/10.2307\/2322999","journal-title":"Am. Math. Mon."},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02012. Lecture Notes in Computer Science, vol.\u00a07417, pp. 868\u2013886. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50","DOI":"10.1007\/978-3-642-32009-5_50"},{"issue":"3","key":"4_CR6","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":"4_CR7","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) Advances in Cryptology \u2013 EUROCRYPT\u00a02001. Lecture Notes in Computer Science, vol.\u00a02045, pp. 93\u2013118. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_7","DOI":"10.1007\/3-540-44987-6_7"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BFb0052229","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"R Canetti","year":"1997","unstructured":"Canetti, R., Dwork, C., Naor, M., Ostrovsky, R.: Deniable encryption. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 90\u2013104. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052229"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: Bootstrapping for approximate homomorphic encryption. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02018, Part\u00a0I. Lecture Notes in Computer Science, vol. 10820, pp. 360\u2013384. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_14","DOI":"10.1007\/978-3-319-78381-9_14"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.S.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02017, Part\u00a0I. Lecture Notes in Computer Science, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15","DOI":"10.1007\/978-3-319-70694-8_15"},{"issue":"1","key":"4_CR11","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":"4_CR12","doi-asserted-by":"publisher","unstructured":"Ducas, L., Micciancio, D.: FHEW: Bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02015, Part\u00a0I. Lecture Notes in Computer Science, vol.\u00a09056, pp. 617\u2013640. Springer, Berlin, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"4_CR13","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"key":"4_CR14","unstructured":"Gentry, C.: A Fully Homomorphic Encryption Scheme. Phd thesis, Stanford University (2009). https:\/\/crypto.stanford.edu\/craig\/"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st Annual ACM Symposium on Theory of Computing, pp. 169\u2013178. ACM Press (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"4_CR16","doi-asserted-by":"publisher","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.) Advances in Cryptology \u2013 CRYPTO\u00a02013, Part\u00a0I. Lecture Notes in Computer Science, vol.\u00a08042, pp. 75\u201392. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Aho, A. (ed.) 19th Annual ACM Symposium on Theory of Computing, pp. 218\u2013229. ACM Press (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"4_CR18","unstructured":"Hwang, I., Min, S., Song, Y.: Practical circuit privacy\/sanitization for TFHE. Cryptology ePrint Archive, Report 2025\/216 (2025). https:\/\/eprint.iacr.org\/2025\/216"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Joye, M.: SoK: Fully homomorphic encryption over the [discretized] torus. IACR Trans. Cryptograph. Hardw. Embed. Syst. 2022(4), 661\u2013692 (2022). https:\/\/doi.org\/10.46586\/tches.v2022.i4.661-692","DOI":"10.46586\/tches.v2022.i4.661-692"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Joye, M.: TFHE public-key encryption revisited. In: Oswald, E. (ed.) Topics in Cryptology \u2013 CT-RSA\u00a02024. Lecture Notes in Computer Science, vol. 14643, pp. 277\u2013291. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58868-6_11","DOI":"10.1007\/978-3-031-58868-6_11"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Vaikuntanathan, V.: SoK: Learning with errors, circular security, and fully homomorphic encryption. In: Tang, Q., Teague, V. (eds.) PKC\u00a02024: 27th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0IV. Lecture Notes in Computer Science, vol. 14604, pp. 291\u2013321. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57728-4_10","DOI":"10.1007\/978-3-031-57728-4_10"},{"issue":"6","key":"4_CR22","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)"},{"issue":"11","key":"4_CR23","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Found. Secure Comput. 4(11), 169\u2013180 (1978)","journal-title":"Found. Secure Comput."},{"issue":"1","key":"4_CR24","doi-asserted-by":"publisher","first-page":"26","DOI":"10.2307\/2308012","volume":"62","author":"H Robbins","year":"1955","unstructured":"Robbins, H.: A remark on stirling\u2019s formula. Am. Math. Mon. 62(1), 26\u201329 (1955). https:\/\/doi.org\/10.2307\/2308012","journal-title":"Am. Math. Mon."},{"issue":"4","key":"4_CR25","doi-asserted-by":"publisher","first-page":"481","DOI":"10.2307\/1988701","volume":"14","author":"HM Sheffer","year":"1913","unstructured":"Sheffer, H.M.: A set of five independent postulates for Boolean algebras, with application to logical constants. Trans. Am. Math. Soc. 14(4), 481\u2013488 (1913). https:\/\/doi.org\/10.2307\/1988701","journal-title":"Trans. Am. Math. Soc."},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: Protocols for secure computations (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, pp. 160\u2013164. IEEE Computer Society Press (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.38","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Innovative Security Solutions for Information Technology and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17443-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T23:05:22Z","timestamp":1778108722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17443-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032174420","9783032174437"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17443-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecITC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Technology and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bucharest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","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":"20 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"itc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/secitc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}