research-article

Toward Efficient Homomorphic Encryption for Outsourced Databases through Parallel Caching

Authors:

Olamide Timothy Tawose,

Dongfang ZhaoAuthors Info & Claims

Proceedings of the ACM on Management of Data, Volume 1, Issue 1

Article No.: 66, Pages 1 - 23

https://doi.org/10.1145/3588920

Published: 30 May 2023 Publication History

Abstract

Many applications deployed to public clouds are concerned about the confidentiality of their outsourced data, such as financial services and electronic patient records. A plausible solution to this problem is homomorphic encryption (HE), which supports certain algebraic operations directly over the ciphertexts. The downside of HE schemes is their significant, if not prohibitive, performance overhead for data-intensive workloads that are very common for outsourced databases, or database-as-a-serve in cloud computing. The objective of this work is to mitigate the performance overhead incurred by the HE module in outsourced databases. To that end, this paper proposes a radix-based parallel caching optimization for accelerating the performance of homomorphic encryption (HE) of outsourced databases in cloud computing. The key insight of the proposed optimization is caching selected radix-ciphertexts in parallel without violating existing security guarantees of the primitive/base HE scheme. We design the radix HE algorithm and apply it to both batch- and incremental-HE schemes; we demonstrate the security of those radix-based HE schemes by showing that the problem of breaking them can be reduced to the problem of breaking their base HE schemes that are known IND-CPA (i.e. Indistinguishability under Chosen-Plaintext Attack). We implement the radix-based schemes as middleware of a 10-node Cassandra cluster on CloudLab; experiments on six workloads show that the proposed caching can boost state-of-the-art HE schemes, such as Paillier and Symmetria, by up to five orders of magnitude.

Supplemental Material

MP4 File

Presentation video for SIGMOD 2023 (PACMMOD-V1mod066)

Download
25.05 MB

References

[1]

Abdullah Al-Mamun, Jun Dai, Xiaohua Xu, Mohammad Sadoghi, Haoting Shen, and Dongfang Zhao. 2020. Consortium Blockchain for the Assurance of Supply Chain Security. In 27th Annual Network and Distributed System Security Symposium (NDSS).

[2]

Abdullah Al-Mamun, Haoting Shen, and Dongfang Zhao. 2022. DEAN: A Lightweight and Resource-efficient Blockchain Protocol for Reliable Edge Computing. In IEEE International Parallel and Distributed Processing Symposium (IPDPS).

[3]

Abdullah Al-Mamun, Feng Yan, and Dongfang Zhao. 2021. BAASH: Lightweight, Efficient, and Reliable Blockchain- As-A-Service for HPC Systems. In International Conference on High Performance Computing, Networking, Storage and Analysis (SC).

[4]

Abdullah Al-Mamun, Feng Yan, and Dongfang Zhao. 2021. SciChain: Blockchain-enabled Lightweight and Efficient Data Provenance for Reproducible Scientific Computing. In IEEE 37th International Conference on Data Engineering (ICDE).

[5]

Prabhanjan Ananth, Aloni Cohen, and Abhishek Jain. 2017. Cryptography with Updates. In Advances in Cryptology -- EUROCRYPT 2017, Jean-Sébastien Coron and Jesper Buus Nielsen (Eds.). Springer International Publishing, Cham, 445--472.

[6]

Sanjeev Arora and Boaz Barak. 2009. Computational Complexity: A Modern Approach (1st ed.). Cambridge University Press, USA.

[7]

Augustus: Gene prediction. Accessed 2022. https://github.com/Gaius-Augustus/Augustus.

[8]

Peter Baumann, Dimitar Misev, Vlad Merticariu, Bang Pham Huu, and Brennan Bell. 2018. Rasdaman: Spatio-Temporal Datacubes on Steroids. In Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (Seattle, Washington) (SIGSPATIAL '18). Association for Computing Machinery, New York, NY, USA, 604--607. https://doi.org/10.1145/3274895.3274988

Digital Library

[9]

Mihir Bellare, Oded Goldreich, and Shafi Goldwasser. 1994. Incremental Cryptography: The Case of Hashing and Signing. In Advances in Cryptology - CRYPTO '94, 14th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21--25, 1994, Proceedings (Lecture Notes in Computer Science, Vol. 839), Yvo Desmedt (Ed.). Springer, 216--233. https://doi.org/10.1007/3--540--48658--5_22

[10]

Mihir Bellare, Oded Goldreich, and Shafi Goldwasser. 1995. Incremental cryptography and application to virus protection. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing (STOC), Frank Thomson Leighton and Allan Borodin (Eds.).

Digital Library

[11]

Ayoub Benaissa, Bilal Retiat, Bogdan Cebere, and Alaa Eddine Belfedhal. 2021. TenSEAL: A Library for Encrypted Tensor Operations Using Homomorphic Encryption. arXiv:2104.03152 [cs.CR]

[12]

Tarunpreet Bhatia, A.K. Verma, and Gaurav Sharma. 2020. Towards a secure incremental proxy re-encryption for e-healthcare data sharing in mobile cloud computing. Concurrency and Computation: Practice and Experience (CCPE) 32, 5 (2020), e5520. https://doi.org/10.1002/cpe.5520 arXiv:https://onlinelibrary.wiley.com/doi/pdf/10.1002/cpe.5520 e5520 CPE-18-0794.R1.

[13]

Bitcoin Trade History. Accessed 2022. https://www.blockchain.com/charts/trade-volume.

[14]

Subodha Charles and Prabhat Mishra. 2020. Securing Network-on-Chip Using Incremental Cryptography. In 2020 IEEE Computer Society Annual Symposium on VLSI (ISVLSI). 168--175. https://doi.org/10.1109/ISVLSI49217.2020.00039

[15]

Jung Hee Cheon, Andrey Kim, Miran Kim, and Yong Soo Song. 2017. Homomorphic Encryption for Arithmetic of Approximate Numbers. In Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3--7, 2017, Proceedings, Part I (Lecture Notes in Computer Science, Vol. 10624), Tsuyoshi Takagi and Thomas Peyrin (Eds.). Springer, 409--437. https://doi.org/10.1007/978--3--319--70694--8_15

[16]

Covid-19 Data. Accessed 2022. https://covidtracking.com/data/download/national-history.csv.

[17]

Ronald Cramer, Ivan Damgård, and Jesper Buus Nielsen. 2001. Multiparty Computation from Threshold Homomorphic Encryption. In Advances in Cryptology - EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6--10, 2001, Proceeding (Lecture Notes in Computer Science, Vol. 2045), Birgit Pfitzmann (Ed.). Springer, 280--299. https://doi.org/10.1007/3--540--44987--6_18

[18]

P. Cudre-Mauroux, H. Kimura, K.-T. Lim, J. Rogers, R. Simakov, E. Soroush, P. Velikhov, D. L. Wang, M. Balazinska, J. Becla, D. DeWitt, B. Heath, D. Maier, S. Madden, J. Patel, M. Stonebraker, and S. Zdonik. 2009. A Demonstration of SciDB: A Science-Oriented DBMS. Proc. VLDB Endow. 2, 2 (aug 2009), 1534--1537. https://doi.org/10.14778/1687553.1687584

Digital Library

[19]

Ivan Damgård and Jesper Buus Nielsen. 2003. Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption. In Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17--21, 2003, Proceedings (Lecture Notes in Computer Science, Vol. 2729), Dan Boneh (Ed.). Springer, 247--264. https://doi.org/10.1007/978--3--540--45146--4_15

[20]

DataStax Java Driver. Accessed 2022. https://github.com/datastax/java-driver.

[21]

M. Daum, B. Haynes, D. He, A. Mazumdar, and M. Balazinska. 2021. TASM: A Tile-Based Storage Manager for Video Analytics. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE Computer Society, Los Alamitos, CA, USA, 1775--1786. https://doi.org/10.1109/ICDE51399.2021.00156

[22]

Leo de Castro, Rashmi Agrawal, Rabia Yazicigil, Anantha Chandrakasan, Vinod Vaikuntanathan, Chiraag Juvekar, and Ajay Joshi. 2021. Does Fully Homomorphic Encryption Need Compute Acceleration? arXiv:2112.06396 [cs.CR]

[23]

Daniel Demmler, Thomas Schneider, and Michael Zohner. 2015. ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In 22nd Annual Network and Distributed System Security Symposium, NDSS 2015, San Diego, California, USA, February 8--11, 2015. The Internet Society. https://www.ndss-symposium.org/ndss2015/aby-framework-efficient-mixed-protocol-secure-two-party-computation

[24]

Yarkin Doroz, Erdinc Ozturk, and Berk Sunar. 2015. Accelerating Fully Homomorphic Encryption in Hardware. IEEE Trans. Comput. 64, 6 (2015), 1509--1521. https://doi.org/10.1109/TC.2014.2345388

Digital Library

[25]

Dmitry Duplyakin, Robert Ricci, Aleksander Maricq, Gary Wong, Jonathon Duerig, Eric Eide, Leigh Stoller, Mike Hibler, David Johnson, Kirk Webb, Aditya Akella, Kuangching Wang, Glenn Ricart, Larry Landweber, Chip Elliott, Michael Zink, Emmanuel Cecchet, Snigdhaswin Kar, and Prabodh Mishra. 2019. The Design and Operation of CloudLab. In Proceedings of the USENIX Annual Technical Conference (ATC). 1--14. https://www.flux.utah.edu/paper/duplyakin-atc19

[26]

T. Elgamal. 1985. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31, 4 (1985), 469--472. https://doi.org/10.1109/TIT.1985.1057074

Digital Library

[27]

Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. Cryptology ePrint Archive, Paper 2012/144. https://eprint.iacr.org/2012/144 https://eprint.iacr.org/2012/144.

[28]

Craig Gentry. 2009. Fully Homomorphic Encryption Using Ideal Lattices. In Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing (STOC).

Digital Library

[29]

O. Goldreich, S. Micali, and A. Wigderson. 1987. How to Play ANY Mental Game. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (New York, New York, USA) (STOC '87). Association for Computing Machinery, New York, NY, USA, 218--229. https://doi.org/10.1145/28395.28420

Digital Library

[30]

Hakan Hacigümüs, Bala Iyer, Chen Li, and Sharad Mehrotra. 2002. Executing SQL over Encrypted Data in the Database-Service-Provider Model. In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data (Madison, Wisconsin) (SIGMOD '02). Association for Computing Machinery, New York, NY, USA, 216--227. https://doi.org/10.1145/564691.564717

Digital Library

[31]

Shai Halevi and Victor Shoup. 2021. Bootstrapping for HElib. J. Cryptol. 34, 1 (jan 2021), 44 pages. https://doi.org/10.1007/s00145-020-09368--7

Digital Library

[32]

Brandon Haynes, Maureen Daum, Dong He, Amrita Mazumdar, Magdalena Balazinska, Alvin Cheung, and Luis Ceze. 2021. VSS: A Storage System for Video Analytics. In Proceedings of the 2021 International Conference on Management of Data (Virtual Event, China) (SIGMOD/PODS '21). 685--696. https://doi.org/10.1145/3448016.3459242

Digital Library

[33]

HElib. Accessed 2022. https://github.com/homenc/HElib.

[34]

Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman. 1998. NTRU: A Ring-Based Public Key Cryptosystem. In Algorithmic Number Theory, Third International Symposium, ANTS-III, Portland, Oregon, USA, June 21--25, 1998, Proceedings (Lecture Notes in Computer Science, Vol. 1423), Joe Buhler (Ed.). Springer, 267--288. https://doi.org/10.1007/BFb0054868

[35]

W. Kuan Hon and Christopher Millard. 2018. Banking in the cloud: Part 3 -- contractual issues. Computer Law & Security Review 34, 3 (2018), 595--614. https://doi.org/10.1016/j.clsr.2017.11.007

[36]

Human Genome Databases. Accessed 2022. http://hgdownload.soe.ucsc.edu/goldenPath/hg38/database/.

[37]

Tehsin Kanwal, Adeel Anjum, and Abid Khan. 2021. Privacy preservation in e-health cloud: taxonomy, privacy requirements, feasibility analysis, and opportunities. Clust. Comput. 24, 1 (2021), 293--317. https://doi.org/10.1007/s10586-020-03106--1

Digital Library

[38]

Gang Ke, Shi Wang, and Huan-huan Wu. 2021. Parallel incremental attribute-based encryption for mobile cloud data storage and sharing. Journal of Ambient Intelligence and Humanized Computing (01 2021), 1--11. https://doi.org/10.1007/s12652-020-02842-x

[39]

Marcel Keller, Emmanuela Orsini, and Peter Scholl. 2016. MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (Vienna, Austria) (CCS '16). Association for Computing Machinery, New York, NY, USA, 830--842. https://doi.org/10.1145/2976749.2978357

Digital Library

[40]

Louiza Khati and Damien Vergnaud. 2018. Analysis and Improvement of an Authentication Scheme in Incremental Cryptography. In Selected Areas in Cryptography - SAC 2018 - 25th International Conference, Calgary, AB, Canada, August 15--17, 2018, Revised Selected Papers (Lecture Notes in Computer Science, Vol. 11349), Carlos Cid and Michael J. Jacobson Jr. (Eds.). Springer, 50--70. https://doi.org/10.1007/978--3-030--10970--7_3

[41]

Avinash Lakshman and Prashant Malik. 2010. Cassandra: A Decentralized Structured Storage System. SIGOPS Oper. Syst. Rev. 44, 2 (April 2010).

Digital Library

[42]

Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Agüera y Arcas. 2017. Communication- Efficient Learning of Deep Networks from Decentralized Data. In Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, AISTATS 2017, 20--22 April 2017, Fort Lauderdale, FL, USA (Proceedings of Machine Learning Research, Vol. 54), Aarti Singh and Xiaojin (Jerry) Zhu (Eds.). PMLR, 1273--1282. http://proceedings.mlr.press/v54/mcmahan17a.html

[43]

Parmita Mehta, Sven Dorkenwald, Dongfang Zhao, Tomer Kaftan, Alvin Cheung, Magdalena Balazinska, Ariel Rokem, Andrew Connolly, Jacob Vanderplas, and Yusra AlSayyad. 2017. Comparative Evaluation of Big-Data Systems on Scientific Image Analytics Workloads. In 43rd International Conference on Very Large Data Bases (VLDB).

[44]

Ilya Mironov, Omkant Pandey, Omer Reingold, and Gil Segev. 2012. Incremental Deterministic Public-Key Encryption. In Advances in Cryptology -- EUROCRYPT 2012, David Pointcheval and Thomas Johansson (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 628--644.

Digital Library

[45]

Payman Mohassel and Yupeng Zhang. 2017. SecureML: A System for Scalable Privacy-Preserving Machine Learning. In 2017 IEEE Symposium on Security and Privacy (SP). 19--38. https://doi.org/10.1109/SP.2017.12

[46]

MPI. Accessed 2021. https://www.mpi-forum.org/docs/.

[47]

National Institute and Technology of Standards. 2001. Advanced Encryption Standard. NIST FIPS PUB 197 (2001).

[48]

Pascal Paillier. 1999. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Proceedings of the 17th International Conference on Theory and Application of Cryptographic Techniques (Prague, Czech Republic) (EUROCRYPT'99). Springer-Verlag, Berlin, Heidelberg, 223--238.

Digital Library

[49]

Antonis Papadimitriou, Ranjita Bhagwan, Nishanth Chandran, Ramachandran Ramjee, Andreas Haeberlen, Harmeet Singh, Abhishek Modi, and Saikrishna Badrinarayanan. 2016. Big Data Analytics over Encrypted Datasets with Seabed. In Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation (OSDI). USENIX Association, USA, 587--602.

Digital Library

[50]

Rishabh Poddar, Tobias Boelter, and Raluca Ada Popa. 2019. Arx: An Encrypted Database using Semantically Secure Encryption. Proc. VLDB Endow. 12, 11 (2019), 1664--1678. https://doi.org/10.14778/3342263.3342641

Digital Library

[51]

Raluca Ada Popa, Catherine Redfield, Nickolai Zeldovich, and Hari Balakrishnan. 2011. CryptDB: protecting confidentiality with encrypted query processing. In Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles (SOSP).

Digital Library

[52]

T. Rabin and M. Ben-Or. 1989. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing (Seattle, Washington, USA) (STOC '89). Association for Computing Machinery, New York, NY, USA, 73--85. https://doi.org/10.1145/73007.73014

Digital Library

[53]

Dayane Reis, Jonathan Takeshita, Taeho Jung, Michael Niemier, and Xiaobo Sharon Hu. 2020. Computing-in-Memory for Performance and Energy-Efficient Homomorphic Encryption. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 28, 11 (2020), 2300--2313. https://doi.org/10.1109/TVLSI.2020.3017595

[54]

R. L. Rivest, A. Shamir, and L. Adleman. 1978. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Commun. ACM 21, 2 (feb 1978), 120--126. https://doi.org/10.1145/359340.359342

Digital Library

[55]

Bita Darvish Rouhani, M. Sadegh Riazi, and Farinaz Koushanfar. 2018. Deepsecure: Scalable Provably-Secure Deep Learning. In Proceedings of the 55th Annual Design Automation Conference (San Francisco, California) (DAC '18). Association for Computing Machinery, New York, NY, USA, Article 2, 6 pages. https://doi.org/10.1145/3195970.3196023

Digital Library

[56]

Nikola Samardzic, Axel Feldmann, Aleksandar Krastev, Srinivas Devadas, Ronald Dreslinski, Christopher Peikert, and Daniel Sanchez. 2021. F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption. Association for Computing Machinery, 238--252. https://doi.org/10.1145/3466752.3480070

Digital Library

[57]

Savvas Savvides, Darshika Khandelwal, and Patrick Eugster. 2020. Efficient Confidentiality-Preserving Data Analytics over Symmetrically Encrypted Datasets. Proc. VLDB Endow. 13, 8 (April 2020), 1290--1303. https://doi.org/10.14778/3389133.3389144

Digital Library

[58]

SEAL 2021. Microsoft SEAL (release 3.7). https://github.com/Microsoft/SEAL. Microsoft Research, Redmond, WA.

[59]

Adi Shamir. 1979. How to Share a Secret. Commun. ACM 22, 11 (nov 1979), 612--613. https://doi.org/10.1145/359168.359176

Digital Library

[60]

Haoting Shen, Shahriar Badsha, and Dongfang Zhao. 2020. Consortium Blockchain for the Assurance of Supply Chain Security. In 27th Annual Network and Distributed System Security Symposium (NDSS).

[61]

Tong Shu, Yanfei Guo, Justin Wozniak, Xiaoning Ding, Ian Foster, and Tahsin Kurc. 2021. Bootstrapping In-Situ Workflow Auto-Tuning via Combining Performance Models of Component Applications. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC) (St. Louis, Missouri). Article 28, 15 pages. https://doi.org/10.1145/3458817.3476197

Digital Library

[62]

TPC-H 3.0.0. Accessed 2022. http://tpc.org/tpc_documents_current_versions/current_specifications5.asp.

[63]

Fenghe Wang, Junquan Wang, and Wenfeng Yang. 2021. Efficient incremental authentication for the updated data in fog computing. Future Generation Computer Systems (FGCS) 114 (2021), 130--137. https://doi.org/10.1016/j.future.2020.07.039

[64]

Andrew C. Yao. 1982. Protocols for secure computations. In 23rd Annual Symposium on Foundations of Computer Science. 160--164. https://doi.org/10.1109/SFCS.1982.38

[65]

Xiaojie Zhu, Erman Ayday, Roman Vitenberg, and Narasimha Raghavan Veeraragavan. 2021. Privacy-Preserving Search for a Similar Genomic Makeup in the Cloud. IEEE Transactions on Dependable and Secure Computing (2021). https://doi.org/10.1109/TDSC.2021.3074327

Cited By

Xu ZYe TKannan RPrasanna VPutnam ALi J(2025)FAST: FPGA Acceleration of Fully Homomorphic Encryption with Efficient BootstrappingProceedings of the 2025 ACM/SIGDA International Symposium on Field Programmable Gate Arrays10.1145/3706628.3708879(115-126)Online publication date: 27-Feb-2025
https://dl.acm.org/doi/10.1145/3706628.3708879
Raj AA JV ESanthiya PKuriakose BA L(2024)PPMO-AHE: Efficient Merge Operations for Encrypted Data Using Additive Homomorphism2024 International Conference on Recent Advances in Electrical, Electronics, Ubiquitous Communication, and Computational Intelligence (RAEEUCCI)10.1109/RAEEUCCI61380.2024.10547981(1-6)Online publication date: 17-Apr-2024
https://doi.org/10.1109/RAEEUCCI61380.2024.10547981
Prasetiyo Putra AKim J(2024)Morphling: A Throughput-Maximized TFHE-based Accelerator using Transform-domain Reuse2024 IEEE International Symposium on High-Performance Computer Architecture (HPCA)10.1109/HPCA57654.2024.00028(249-262)Online publication date: 2-Mar-2024
https://doi.org/10.1109/HPCA57654.2024.00028

Index Terms

Toward Efficient Homomorphic Encryption for Outsourced Databases through Parallel Caching
1. Computing methodologies
  1. Distributed computing methodologies
    1. Distributed algorithms
2. Security and privacy
  1. Database and storage security
    1. Management and querying of encrypted data

Recommendations

A Pairing-based Homomorphic Encryption Scheme for Multi-User Settings

A new method is presented to privately outsource computation of different users. As a significant cryptographic primitive in cloud computing, homomorphic encryption HE can evaluate on ciphertext directly without decryption, thus avoid information ...
An efficient and secure data sharing framework using homomorphic encryption in the cloud
Cloud-I '12: Proceedings of the 1st International Workshop on Cloud Intelligence

Due to cost-efficiency and less hands-on management, data owners are outsourcing their data to the cloud which can provide access to the data as a service. However, by outsourcing their data to the cloud, the data owners lose control over their data as ...
Poster: Efficient AES-GCM Decryption Under Homomorphic Encryption
CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security

Computation delegation to untrusted third-party while maintaining data confidentiality is possible with homomorphic encryption (HE). However, in many cases, the data was encrypted using another cryptographic scheme such as AES-GCM. Hybrid encryption (...

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the ACM on Management of Data

Proceedings of the ACM on Management of Data Volume 1, Issue 1

PACMMOD

May 2023

2807 pages

EISSN:2836-6573

DOI:10.1145/3603164

Editor:
Divyakant Agrawal
UC Santa Barbara, United States

Issue’s Table of Contents

Copyright © 2023 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 May 2023

Published in PACMMOD Volume 1, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Author Tags

Qualifiers

Research-article

Funding Sources

National Science Foundation

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
537
Total Downloads

Downloads (Last 12 months)212
Downloads (Last 6 weeks)17

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Xu ZYe TKannan RPrasanna VPutnam ALi J(2025)FAST: FPGA Acceleration of Fully Homomorphic Encryption with Efficient BootstrappingProceedings of the 2025 ACM/SIGDA International Symposium on Field Programmable Gate Arrays10.1145/3706628.3708879(115-126)Online publication date: 27-Feb-2025
https://dl.acm.org/doi/10.1145/3706628.3708879
Raj AA JV ESanthiya PKuriakose BA L(2024)PPMO-AHE: Efficient Merge Operations for Encrypted Data Using Additive Homomorphism2024 International Conference on Recent Advances in Electrical, Electronics, Ubiquitous Communication, and Computational Intelligence (RAEEUCCI)10.1109/RAEEUCCI61380.2024.10547981(1-6)Online publication date: 17-Apr-2024
https://doi.org/10.1109/RAEEUCCI61380.2024.10547981
Prasetiyo Putra AKim J(2024)Morphling: A Throughput-Maximized TFHE-based Accelerator using Transform-domain Reuse2024 IEEE International Symposium on High-Performance Computer Architecture (HPCA)10.1109/HPCA57654.2024.00028(249-262)Online publication date: 2-Mar-2024
https://doi.org/10.1109/HPCA57654.2024.00028

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents