{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T21:22:37Z","timestamp":1773264157558,"version":"3.50.1"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:00:00Z","timestamp":1768780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:00:00Z","timestamp":1768780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003836","name":"IC Design Education Center","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003836","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,1,19]]},"DOI":"10.1109\/asp-dac66049.2026.11420798","type":"proceedings-article","created":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T19:51:15Z","timestamp":1773172275000},"page":"1237-1243","source":"Crossref","is-referenced-by-count":0,"title":["EP-HDC: Hyperdimensional Computing with Encrypted Parameters for High-Throughput Privacy-Preserving Inference"],"prefix":"10.1109","author":[{"given":"Jaewoo","family":"Park","sequence":"first","affiliation":[{"name":"Ulsan National Institute of Science and Technology (UNIST),Department of Computer Science and Engineering,Ulsan,Korea"}]},{"given":"Chenghao","family":"Quan","sequence":"additional","affiliation":[{"name":"Ulsan National Institute of Science and Technology (UNIST),Department of Electrical Engineering,Ulsan,Korea"}]},{"given":"Jongeun","family":"Lee","sequence":"additional","affiliation":[{"name":"Ulsan National Institute of Science and Technology (UNIST),Department of Electrical Engineering,Ulsan,Korea"}]}],"member":"263","reference":[{"key":"ref1","first-page":"201","article-title":"CryptoNets: Applying neural networks to encrypted data with high throughput and accuracy","volume-title":"ICML","author":"Gilad-Bachrach","year":"2016"},{"key":"ref2","first-page":"812","article-title":"Low latency privacy preserving inference","volume-title":"ICML","author":"Brutzkus","year":"2019"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD57390.2023.10323815"},{"key":"ref4","volume-title":"Face mask lite dataset","author":"Kottarathil","year":"2020"},{"key":"ref5","volume-title":"Emotion detection dataset"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-009-9009-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICRC.2016.7738683"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IEDM.2016.7838428"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.12664"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3458817.3480958"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICRC.2017.8123650"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/BIOCAS.2019.8918974"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.23919\/DATE51398.2021.9474107"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"ref15","article-title":"Fully homomorphic encryption without bootstrapping","author":"Brakerski","year":"2011","journal-title":"Cryptology ePrint Archive, Paper 2011\/277"},{"key":"ref16","article-title":"Somewhat practical fully homomorphic encryption","author":"Fan","year":"2012","journal-title":"Cryptology ePrint Archive, Paper 2012\/144"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA51647.2021.00013"},{"key":"ref18","first-page":"1651","article-title":"Gazelle: A low latency framework for secure neural network inference","volume-title":"Proceedings of the 27th USENIX Conference on Security Symposium, ser. SEC\u201918","author":"Juvekar"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18072.2020.9218493"},{"key":"ref20","article-title":"Fhebench: Benchmarking fully homomorphic encryption schemes","author":"Jiang","year":"2022","journal-title":"arXiv preprint arXiv:2203.00728"},{"key":"ref21","article-title":"Learned step size quantization","volume-title":"International Conference on Learning Representations","author":"Esser"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00080"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3508352.3549418"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3474366.3486923"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2211477"},{"key":"ref26","article-title":"Faster CryptoNets: Leveraging sparsity for real-world encrypted inference","volume":"abs\/1811.09953","author":"Chou","year":"2018","journal-title":"CoRR"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3292006.3300044"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3489517.3530653"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3579371.3589053"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/micro56248.2022.00086"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/DAC56929.2023.10247747"}],"event":{"name":"2026 31st Asia and South Pacific Design Automation Conference (ASP-DAC)","location":"Lantau, Hong Kong","start":{"date-parts":[[2026,1,19]]},"end":{"date-parts":[[2026,1,22]]}},"container-title":["2026 31st Asia and South Pacific Design Automation Conference (ASP-DAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11420221\/11420229\/11420798.pdf?arnumber=11420798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T05:22:17Z","timestamp":1773206537000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11420798\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,19]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/asp-dac66049.2026.11420798","relation":{},"subject":[],"published":{"date-parts":[[2026,1,19]]}}}