{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T04:15:53Z","timestamp":1778040953953,"version":"3.51.4"},"reference-count":33,"publisher":"International Association for Cryptologic Research","issue":"1","license":[{"start":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T00:00:00Z","timestamp":1770076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IACR CiC"],"accepted":{"date-parts":[[2026,4,22]]},"abstract":"<jats:p>Homomorphic encryption (HE) is a promising technology for confidential cloud computing, as it allows computations on encrypted data. However, HE is computationally expensive and often memory-bound on conventional computer architectures. Processing-in-Memory (PIM) is an alternative hardware architecture that integrates processing units and memory on the same chip or memory module. PIM enables higher memory bandwidth than conventional architectures and could thus be suitable for accelerating HE. We present DRAMatic, which implements operations foundational to HE on UPMEM PIM \u2013 a programmable general-purpose PIM system developed by UPMEM. DRAMatic incorporates many arithmetic optimizations, including residue number system and number-theoretic transform techniques, and can support the large parameters required for secure homomorphic evaluations. It achieves a 334 times speed-up compared to previous HE implementations on UPMEM PIM. We also evaluate DRAMatic against Microsoft SEAL, a popular open-source HE library, regarding both runtime and energy efficiency. The results show that DRAMatic significantly closes the gap between Microsoft SEAL and HE implementations on UPMEM PIM. However, we also show that DRAMatic is currently constrained by data transfer overhead and limited multiplication performance on UPMEM PIM hardware. Finally, we discuss potential hardware extensions to UPMEM PIM.<\/jats:p>","DOI":"10.62056\/ahp2fh888","type":"journal-article","created":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T18:09:08Z","timestamp":1777918148000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":0,"title":["DRAMatic Speedup: Accelerating HE Operations on a Processing-in-Memory System"],"prefix":"10.62056","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-6752-5274","authenticated-orcid":false,"given":"Niklas","family":"Klinger","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/00t3r8h32","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Luebeck","place":["Ratzeburger Allee 160, L\u00fcbeck, 23562, Germany"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-9402-823X","authenticated-orcid":false,"given":"Jonas","family":"Sander","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/00t3r8h32","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Luebeck","place":["Ratzeburger Allee 160, L\u00fcbeck, 23562, Germany"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3371-9228","authenticated-orcid":false,"given":"Peterson","family":"Yuhala","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/00vasag41","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Neuch\u00e2tel","place":["Av. du 1er-Mars 26, Neuch\u00e2tel, 2000, Switzerland"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1574-6721","authenticated-orcid":false,"given":"Pascal","family":"Felber","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/00vasag41","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Neuch\u00e2tel","place":["Av. du 1er-Mars 26, Neuch\u00e2tel, 2000, Switzerland"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1116-6973","authenticated-orcid":false,"given":"Thomas","family":"Eisenbarth","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/00t3r8h32","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Luebeck","place":["Ratzeburger Allee 160, L\u00fcbeck, 23562, Germany"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"48349","published-online":{"date-parts":[[2026,5,4]]},"reference":[{"key":"ref1:CHES:MogIraEis17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-66787-4_4","article-title":"CacheZoom: How SGX Amplifies the Power of Cache\n  Attacks","volume":"10529","author":"Ahmad Moghimi","year":"2017"},{"key":"ref2:CCS:WilSieEis24","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1145\/3658644.3690230","article-title":"TDXdown: Single-Stepping and Instruction Counting Attacks\n  against Intel TDX","author":"Luca Wilke","year":"2024"},{"key":"ref3:tee-fail","article-title":"TEE.fail: Breaking Trusted Execution Environments via\n  DDR5 Memory Bus Interposition","author":"Jalen Chuang","year":"2026"},{"key":"ref4:EPRINT:CAYCVJ21","volume-title":"Does Fully Homomorphic Encryption Need Compute\n  Acceleration?","author":"Leo de Castro","year":"2021"},{"key":"ref5:Ghose2019-PIM-Perspective","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2019.2934048","article-title":"Processing-in-memory: A workload-driven perspective","volume":"63","author":"Saugata Ghose","year":"2019","journal-title":"IBM J. Res. Dev."},{"key":"ref6:DBLP:Gupta2021-HEcustomPIMchips","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1109\/DAC18074.2021.9586285","article-title":"Invited: Accelerating Fully Homomorphic Encryption with\n  Processing in Memory","author":"Saransh Gupta","year":"2021"},{"key":"ref7:Zhou2025-FHEmem-Accelerator","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TETC.2025.3528862","article-title":"FHEmem: A Processing In-Memory Accelerator for Fully\n  Homomorphic Encryption","author":"Minxuan Zhou","year":"2025","journal-title":"IEEE Transactions on Emerging Topics in Computing"},{"key":"ref8:DBLP:GomezMutlu2021-BenchmarkingPIM","article-title":"Benchmarking a New Paradigm: An Experimental Analysis of a\n  Real Processing-in-Memory Architecture","volume":"abs\/2105.03814","author":"Juan G\u00f3mez-Luna","year":"2021","journal-title":"CoRR"},{"key":"ref9:ITCS:BraGenVai12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/2090236.2090262","article-title":"(Leveled) fully homomorphic encryption without\n  bootstrapping","author":"Zvika Brakerski","year":"2012"},{"key":"ref10:Satriawan2023-Review-on-NTT","doi-asserted-by":"publisher","first-page":"70288","DOI":"10.1109\/ACCESS.2023.3294446","article-title":"Conceptual Review on Number Theoretic Transform and\n  Comprehensive Review on Its Implementations","volume":"11","author":"Ardianto Satriawan","year":"2023","journal-title":"IEEE Access"},{"key":"ref11:C:Barrett86","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-47721-7_24","article-title":"Implementing the Rivest Shamir and Adleman Public Key\n  Encryption Algorithm on a Standard Digital Signal Processor","volume":"263","author":"Paul Barrett","year":"1987"},{"key":"ref12:DBLP:Unine-UPMEM-HE","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/SRDS64841.2024.00019","article-title":"Evaluating the Potential of In-Memory Processing to\n  Accelerate Homomorphic Encryption: Practical Experience Report","author":"Mpoki Mwaisela","year":"2024"},{"key":"ref13:2026-NTT-UPMEM-PIM","doi-asserted-by":"publisher","first-page":"108386","DOI":"10.1016\/j.future.2026.108386","article-title":"Long Integer NTT Execution on UPMEM-PIM for 128-bit\n  Secure Fully Homomorphic Encryption","author":"Tathagata Barik","year":"2026","journal-title":"Future Generation Computer Systems","ISSN":"https:\/\/id.crossref.org\/issn\/0167-739X","issn-type":"electronic"},{"key":"ref14:UPMEM2024-Keynote","volume-title":"Keynote: UPMEM PIM platform for Data-Intensive\n  Applications","author":"UPMEM","year":"2024"},{"key":"ref15:RSA:HalPolSho19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-030-12612-4_5","article-title":"An Improved RNS Variant of the BFV Homomorphic\n  Encryption Scheme","volume":"11405","author":"Shai Halevi","year":"2019"},{"key":"ref16:Shoup2005-NumberTheoryAlgebra","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139165464","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"Victor Shoup","year":"2005"},{"key":"ref17:CooleyTukey1965-FFT","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/2003354","article-title":"An algorithm for the machine calculation of complex\n  Fourier series","volume":"19","author":"James W. Cooley","year":"1965","journal-title":"Mathematics of computation"},{"key":"ref18:GentlemanSande1966-FFT","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/1464291.1464352","article-title":"Fast Fourier transforms: for fun and profit","author":"W. Morven Gentleman","year":"1966"},{"key":"ref19:sealcrypto","volume-title":"Microsoft SEAL (release 4.1)","year":"2023"},{"key":"ref20:HomomorphicEncryptionSecurityStandard","volume-title":"Homomorphic Encryption Security Standard","author":"Martin Albrecht","year":"2018"},{"key":"ref21:UPMEMdoc-Cstate","volume-title":"UPMEM DPU SDK 2025.1.0 Documentation \u2014 Server\n  installation","year":"2025"},{"key":"ref22:C:Brakerski12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","article-title":"Fully Homomorphic Encryption without Modulus Switching from\n  Classical GapSVP","volume":"7417","author":"Zvika Brakerski","year":"2012"},{"key":"ref23:EPRINT:FanVer12","volume-title":"Somewhat Practical Fully Homomorphic Encryption","author":"Junfeng Fan","year":"2012"},{"key":"ref24:AC:CKKS17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","article-title":"Homomorphic Encryption for Arithmetic of Approximate\n  Numbers","volume":"10624","author":"Jung Hee Cheon","year":"2017"},{"key":"ref25:JC:CGGI20","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","article-title":"TFHE: Fast Fully Homomorphic Encryption Over the Torus","volume":"33","author":"Ilaria Chillotti","year":"2020","journal-title":"Journal of Cryptology"},{"key":"ref26:ACM:OpenFHE","series-title":"WAHC'22","isbn-type":"print","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/3560827.3563379","article-title":"OpenFHE: Open-Source Fully Homomorphic Encryption\n  Library","author":"Ahmad Al Badawi","year":"2022","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450398770"},{"key":"ref27:CCS:JKLS18","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1145\/3243734.3243837","article-title":"Secure Outsourced Matrix Computation and Application to\n  Neural Networks","author":"Xiaoqian Jiang","year":"2018"},{"key":"ref28:DBLP:MatrixMul-HE","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/3560810.3564267","article-title":"On Matrix Multiplication with Homomorphic Encryption","author":"Panagiotis Rizomiliotis","year":"2022"},{"key":"ref29:C:GenHalSma12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/978-3-642-32009-5_49","article-title":"Homomorphic Evaluation of the AES Circuit","volume":"7417","author":"Craig Gentry","year":"2012"},{"key":"ref30:ghinani2025","first-page":"1749","article-title":"Enabling Low-Cost Secure Computing on Untrusted In-Memory\n  Architectures","author":"Sahar Ghoflsaz Ghinani","year":"2025"},{"key":"ref31:TCHES:JKACL21","doi-asserted-by":"publisher","first-page":"114","DOI":"10.46586\/tches.v2021.i4.114-148","article-title":"Over 100x Faster Bootstrapping in Fully Homomorphic\n  Encryption through Memory-centric Optimization with GPUs","volume":"2021","author":"Wonkyung Jung","year":"2021","journal-title":"IACR TCHES","ISSN":"https:\/\/id.crossref.org\/issn\/2569-2925","issn-type":"electronic"},{"key":"ref32:CHES:PNPM15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-662-48324-4_8","article-title":"Accelerating Homomorphic Evaluation on Reconfigurable\n  Hardware","volume":"9293","author":"Thomas P\u00f6ppelmann","year":"2015"},{"key":"ref33:DBLP:AxDIMM","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/MM.2021.3097700","article-title":"Near-Memory Processing in Action: Accelerating Personalized\n  Recommendation With AxDIMM","volume":"42","author":"Liu Ke","year":"2022","journal-title":"IEEE Micro"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T04:02:53Z","timestamp":1778040173000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/3\/1\/18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,4]]},"references-count":33,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,5,4]]}},"URL":"https:\/\/doi.org\/10.62056\/ahp2fh888","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"value":"3006-5496","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,4]]},"assertion":[{"value":"2026-02-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-22","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc3-1-45"}}