Faster Homomorphic Operations and Beyond: Expediting Homomorphic Computation via Boolean Circuit Optimization
Fully homomorphic encryption (FHE) enables secure data processing without compromising data access. However, its computational cost and slower execution compared to plaintext operations present significant challenges. The increasing interest in FHE-based secure computation underscores the need to ac...
Uložené v:
| Vydané v: | Journal of cryptology Ročník 39; číslo 1; s. 6 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Springer Nature B.V
01.01.2026
|
| Predmet: | |
| ISSN: | 0933-2790, 1432-1378 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Fully homomorphic encryption (FHE) enables secure data processing without compromising data access. However, its computational cost and slower execution compared to plaintext operations present significant challenges. The increasing interest in FHE-based secure computation underscores the need to accelerate homomorphic computations. Existing research predominantly focuses on reducing the multiplicative depth (MD) of FHE circuits, as a lower MD enhances the execution efficiency of each homomorphic operation. However, this often comes at the expense of increased multiplicative complexity (MC), leading to more homomorphic multiplications — a computationally intensive task. Currently, there is a lack of approaches that effectively balance the trade-off between MD reduction and MC increase, potentially resulting in sub-optimal outcomes. This paper addresses this critical gap with three main contributions: (a) an exact synthesis paradigm for generating optimal FHE circuit implementations, (b) a heuristic circuit optimization algorithm, named MC-aware MD minimization, that leverages the exact synthesis paradigm to optimize FHE circuits efficiently, and (c) an FHE circuit optimization flow that integrates MC-aware MD minimization with existing MD reduction techniques. Experimental results demonstrate a 21.32% average reduction in homomorphic computation time and highlight significantly improved efficiency in circuit optimization. |
|---|---|
| AbstractList | Fully homomorphic encryption (FHE) enables secure data processing without compromising data access. However, its computational cost and slower execution compared to plaintext operations present significant challenges. The increasing interest in FHE-based secure computation underscores the need to accelerate homomorphic computations. Existing research predominantly focuses on reducing the multiplicative depth (MD) of FHE circuits, as a lower MD enhances the execution efficiency of each homomorphic operation. However, this often comes at the expense of increased multiplicative complexity (MC), leading to more homomorphic multiplications — a computationally intensive task. Currently, there is a lack of approaches that effectively balance the trade-off between MD reduction and MC increase, potentially resulting in sub-optimal outcomes. This paper addresses this critical gap with three main contributions: (a) an exact synthesis paradigm for generating optimal FHE circuit implementations, (b) a heuristic circuit optimization algorithm, named MC-aware MD minimization, that leverages the exact synthesis paradigm to optimize FHE circuits efficiently, and (c) an FHE circuit optimization flow that integrates MC-aware MD minimization with existing MD reduction techniques. Experimental results demonstrate a 21.32% average reduction in homomorphic computation time and highlight significantly improved efficiency in circuit optimization. |
| ArticleNumber | 6 |
| Author | De Micheli, Giovanni Yu, Mingfei |
| Author_xml | – sequence: 1 givenname: Mingfei surname: Yu fullname: Yu, Mingfei – sequence: 2 givenname: Giovanni surname: De Micheli fullname: De Micheli, Giovanni |
| BookMark | eNpVkM1KAzEYRYNUsFVfwFXA9Wj-JplxZ4fWCoVudB0y-dGUTjImU7E-vWPrRj4u3-ZwL5wZmIQYLAA3GN1hhMR9RgizskBkTF1yWrAzMMWMkgJTUU3AFNWUFkTU6ALMct6OuCgFnYJuqfJgE1zFbrzUv3sNN71NavAxZKiCgXN7iME8wMVXb40ffHj7Rzex6_fDkYefXsF5jDurAmx80ns_jG2D7_z3EbgC507tsr3--5fgdbl4aVbFevP03DyuC00EGQrlBHeqbCvsuMEc17Q1SCOODNGtq1xtmGOOY00qJmzr6pa0RmPODbMlpphegttTb5_ix97mQW7jPoVxUlIiMK5ERdBIkROlU8w5WSf75DuVDhIj-atVnrTKUas8apWM_gDnx27i |
| Cites_doi | 10.1145/3689945.3694808 10.1145/3314221.3314628 10.1145/2090236.2090262 10.1007/978-3-662-46800-5_24 10.1007/978-3-319-31301-6_2 10.1007/978-3-642-41320-9_13 10.1007/978-3-319-78825-8_23 10.1007/978-3-642-14295-6_5 10.1109/TCAD.2024.3357598 10.1145/3501334 10.1145/3385412.3385996 10.1109/T-C.1975.224082 10.56553/popets-2023-0075 10.1145/2732516.2732520 10.1145/3316781.3317893 10.1145/1536414.1536440 10.1109/CLOUD.2016.0084 10.1007/978-3-319-22174-8_4 10.1007/s00145-019-09319-x 10.1007/978-3-319-70694-8_15 10.1007/s12095-018-0297-2 10.1016/S0304-3975(99)00182-6 10.1145/3689945.3694803 10.1007/978-3-030-40186-3_15 10.1007/978-3-319-29485-8_19 10.1007/978-3-642-81955-1_28 10.1109/TCAD.2006.887925 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2025. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: The Author(s) 2025. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | AAYXX CITATION JQ2 |
| DOI | 10.1007/s00145-025-09563-4 |
| DatabaseName | CrossRef ProQuest Computer Science Collection |
| DatabaseTitle | CrossRef ProQuest Computer Science Collection |
| DatabaseTitleList | CrossRef ProQuest Computer Science Collection |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Education |
| EISSN | 1432-1378 |
| ExternalDocumentID | 10_1007_s00145_025_09563_4 |
| GroupedDBID | -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 203 28- 29K 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 3-Y 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 6TJ 78A 8TC 8UJ 95- 95. 95~ 96X AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYXX ABAKF ABBBX ABBRH ABBXA ABDBE ABDZT ABECU ABFSG ABFTD ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACSTC ACZOJ ADHHG ADHIR ADHKG ADIMF ADKFA ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFEXP AFFHD AFGCZ AFHIU AFKRA AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN B-. BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BSONS CAG CCPQU CITATION COF CS3 CSCUP D-I DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EDO EIOEI EIS EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ7 GQ8 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K7- KDC KOV KOW LAS LLZTM M4Y M7S MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P9O PF0 PHGZM PHGZT PQGLB PT4 PT5 PTHSS QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 ZMTXR ~EX AESKC JQ2 |
| ID | FETCH-LOGICAL-c272t-af76fa5b81f6d16193bd0c060d2cbf8f9d4f4f61c2847ebf9b2bdc166d4e51313 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001613233100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0933-2790 |
| IngestDate | Fri Nov 14 03:52:05 EST 2025 Thu Nov 20 00:49:53 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c272t-af76fa5b81f6d16193bd0c060d2cbf8f9d4f4f61c2847ebf9b2bdc166d4e51313 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | https://doi.org/10.1007/s00145-025-09563-4 |
| PQID | 3271187820 |
| PQPubID | 2043756 |
| ParticipantIDs | proquest_journals_3271187820 crossref_primary_10_1007_s00145_025_09563_4 |
| PublicationCentury | 2000 |
| PublicationDate | 2026-01-01 |
| PublicationDateYYYYMMDD | 2026-01-01 |
| PublicationDate_xml | – month: 01 year: 2026 text: 2026-01-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Journal of cryptology |
| PublicationYear | 2026 |
| Publisher | Springer Nature B.V |
| Publisher_xml | – name: Springer Nature B.V |
| References | Ilaria Chillotti (9563_CR11) 2020; 33 9563_CR2 9563_CR1 9563_CR29 9563_CR4 Seonyoung Cheon (9563_CR13) 2024 9563_CR26 Johannes Mono (9563_CR31) 2023; 2023 9563_CR25 9563_CR28 Colin R Edwards (9563_CR19) 1975; 24 9563_CR27 9563_CR22 9563_CR21 9563_CR24 Henry S Warren (9563_CR40) 2013 Gilles Audemard (9563_CR3) 2017; 4 9563_CR20 9563_CR42 9563_CR41 9563_CR9 Joan Boyar (9563_CR6) 2000; 235 9563_CR5 Ronald L Rivest (9563_CR33) 1978; 4 9563_CR8 9563_CR7 9563_CR18 9563_CR15 9563_CR37 9563_CR14 9563_CR36 9563_CR17 9563_CR39 9563_CR16 9563_CR38 9563_CR10 9563_CR32 9563_CR35 9563_CR12 9563_CR34 Zhenyu Guan (9563_CR23) 2024; 43 9563_CR30 |
| References_xml | – volume: 4 start-page: 169 issue: 11 year: 1978 ident: 9563_CR33 publication-title: Foundations of Secure Computation – ident: 9563_CR39 doi: 10.1145/3689945.3694808 – ident: 9563_CR18 doi: 10.1145/3314221.3314628 – ident: 9563_CR2 – ident: 9563_CR4 doi: 10.1145/2090236.2090262 – ident: 9563_CR17 doi: 10.1007/978-3-662-46800-5_24 – volume-title: Ju Min Lee, Sunchul Jung, Taekyung Kim, Dongyoon Lee, and Hanjun Kim year: 2024 ident: 9563_CR13 – ident: 9563_CR32 doi: 10.1007/978-3-319-31301-6_2 – ident: 9563_CR29 doi: 10.1007/978-3-642-41320-9_13 – ident: 9563_CR8 doi: 10.1007/978-3-319-78825-8_23 – volume: 4 start-page: 1 year: 2017 ident: 9563_CR3 publication-title: Glucose SAT solver – ident: 9563_CR34 – ident: 9563_CR36 – ident: 9563_CR5 doi: 10.1007/978-3-642-14295-6_5 – volume: 43 start-page: 1971 issue: 7 year: 2024 ident: 9563_CR23 publication-title: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems doi: 10.1109/TCAD.2024.3357598 – ident: 9563_CR26 doi: 10.1145/3501334 – ident: 9563_CR28 doi: 10.1145/3385412.3385996 – volume: 24 start-page: 48 issue: 1 year: 1975 ident: 9563_CR19 publication-title: IEEE Trans. Computers doi: 10.1109/T-C.1975.224082 – ident: 9563_CR22 doi: 10.56553/popets-2023-0075 – ident: 9563_CR9 doi: 10.1145/2732516.2732520 – ident: 9563_CR37 doi: 10.1145/3316781.3317893 – ident: 9563_CR21 doi: 10.1145/1536414.1536440 – ident: 9563_CR24 – ident: 9563_CR14 doi: 10.1109/CLOUD.2016.0084 – ident: 9563_CR10 doi: 10.1007/978-3-319-22174-8_4 – volume: 33 start-page: 34 year: 2020 ident: 9563_CR11 publication-title: Journal of Cryptology doi: 10.1007/s00145-019-09319-x – ident: 9563_CR20 – ident: 9563_CR12 doi: 10.1007/978-3-319-70694-8_15 – ident: 9563_CR16 doi: 10.1007/s12095-018-0297-2 – volume: 2023 start-page: 370 year: 2023 ident: 9563_CR31 publication-title: In Progress in Cryptology - AFRICACRYPT – volume: 235 start-page: 43 issue: 1 year: 2000 ident: 9563_CR6 publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(99)00182-6 – ident: 9563_CR41 doi: 10.1145/3689945.3694803 – ident: 9563_CR1 doi: 10.1007/978-3-030-40186-3_15 – ident: 9563_CR35 – ident: 9563_CR15 doi: 10.1007/978-3-319-29485-8_19 – ident: 9563_CR38 doi: 10.1007/978-3-642-81955-1_28 – volume-title: Hacker’s Delight year: 2013 ident: 9563_CR40 – ident: 9563_CR7 – ident: 9563_CR42 – ident: 9563_CR30 doi: 10.1109/TCAD.2006.887925 – ident: 9563_CR25 – ident: 9563_CR27 |
| SSID | ssj0017573 |
| Score | 2.4274888 |
| Snippet | Fully homomorphic encryption (FHE) enables secure data processing without compromising data access. However, its computational cost and slower execution... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Index Database |
| StartPage | 6 |
| SubjectTerms | Boolean Circuits Computing costs Data processing Optimization Optimization techniques Synthesis |
| Title | Faster Homomorphic Operations and Beyond: Expediting Homomorphic Computation via Boolean Circuit Optimization |
| URI | https://www.proquest.com/docview/3271187820 |
| Volume | 39 |
| WOSCitedRecordID | wos001613233100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: SpringerLink customDbUrl: eissn: 1432-1378 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017573 issn: 0933-2790 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LSsNAFB1KceHGt1itMgt3OpB5ZCbjToulqyq-6C7MEwI2LW3a73cmSQsFXUjIbriEe5Ock9y55wBwG0A6S6j3iCdWIxYIMlIqxQhLHRm7tNRmtdmEGI-zyUS-dsD9nx38KPeJWZwiDmcg8xRF8U_MSbQreHv_2rYMRNq0k2U0JxMyaSdkfg-xi0K7L-EaWYaH_7umI3DQMkj42JT8GHRceRLNl9uNGqdgOlRR_QCOZtNwhDwWBr7MXVPqJVSlhc3cygOMQse2iDufd1Y3Vg_1erguFHyazb6dKuGgWJhVUYVoVTFtBzjPwOfw-WMwQq2rAjJEkAopL7hXqc6w5zbwPUm1TUwSakWM9pmXlnnmOTYRuJz2UhNtDebcMpdiiuk56Jaz0l0AyKiimaAigCBhjlOdaqGl14lRaeaY6oG7TZbzeSOekW9lkusU5iGFeZ3CnPVAf1OIvH2QljklIhqiB55y-a9gV2CfhM_L5mdJH3Srxcpdgz2zrorl4qa-c34AFQC7Zw |
| linkProvider | Springer Nature |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Faster+Homomorphic+Operations+and+Beyond%3A+Expediting+Homomorphic+Computation+via+Boolean+Circuit+Optimization&rft.jtitle=Journal+of+cryptology&rft.au=Yu%2C+Mingfei&rft.au=De+Micheli%2C+Giovanni&rft.date=2026-01-01&rft.issn=0933-2790&rft.eissn=1432-1378&rft.volume=39&rft.issue=1&rft_id=info:doi/10.1007%2Fs00145-025-09563-4&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00145_025_09563_4 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0933-2790&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0933-2790&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0933-2790&client=summon |