{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T05:10:23Z","timestamp":1756357823781,"version":"3.44.0"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T00:00:00Z","timestamp":1751760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T00:00:00Z","timestamp":1751760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,7,6]]},"DOI":"10.1109\/isvlsi65124.2025.11130223","type":"proceedings-article","created":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T18:20:15Z","timestamp":1756318815000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["PolyFHEmus: Rethinking Multiplication in Fully Homomorphic Encryption"],"prefix":"10.1109","author":[{"given":"Charles","family":"Gouert","sequence":"first","affiliation":[{"name":"University of Delaware"}]},{"given":"Nektarios Georgios","family":"Tsoutsos","sequence":"additional","affiliation":[{"name":"University of Delaware"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"ref4","article-title":"Somewhat practical fully homomorphic encryption","author":"Fan","year":"2012","journal-title":"Cryptology ePrint Archive"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3470496.3527393"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3466752.3480070"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.2988765"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA56546.2023.10070953"},{"key":"ref9","article-title":"Arctyrex: Accelerated encrypted execution of generalpurpose applications","author":"Gouert","year":"2023","journal-title":"arXiv preprint arXiv:2306.11006"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2021.i4.114-148"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242355"},{"year":"2023","key":"ref12","article-title":"Microsoft SEAL (release 4.1)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"ref14","article-title":"Grafting: Complementing RNS in CKKS","author":"Cheon","year":"2024","journal-title":"Cryptology ePrint Archive"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78381-9_14"},{"journal-title":"Cryptology ePrint Archive, Paper 2024\/109, 2024","article-title":"Simpler and faster BFV bootstrapping for arbitrary plaintext modulus from CKKS","author":"Kim","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-020-09368-7"},{"key":"ref18","article-title":"On polynomial approximations for privacy-preserving and verifiable ReLU networks","author":"Ali","year":"2020","journal-title":"arXiv preprint arXiv:2011.05530"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-64331-0_27"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2023.3270971"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1464291.1464352"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD57390.2023.10323744"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC50251.2020.00033"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/VLSID60093.2024.00082"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/DDECS57882.2023.10139347"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2345388"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3560827.3563379"}],"event":{"name":"2025 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","start":{"date-parts":[[2025,7,6]]},"location":"Kalamata, Greece","end":{"date-parts":[[2025,7,9]]}},"container-title":["2025 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11129697\/11130193\/11130223.pdf?arnumber=11130223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T04:31:14Z","timestamp":1756355474000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11130223\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,6]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isvlsi65124.2025.11130223","relation":{},"subject":[],"published":{"date-parts":[[2025,7,6]]}}}