Faster matrix approximate homomorphic encryption
Approximate Homomorphic Encryption (AHE) becomes a research hot spot in homomorphic cryptography in recent years as it is widely used in neural network, deep learning and so on. Since matrix multiplication is frequently used in these applications, many researcher have studied on it. In this paper, w...
Ausführliche Beschreibung
Autor*in: |
Hu, Jifa [verfasserIn] Wang, Fuqun [verfasserIn] Chen, Kefei [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2023 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
Enthalten in: Computer standards & interfaces - Amsterdam : Elsevier Science Publ. BV (North-Holland), 1986, 87 |
---|---|
Übergeordnetes Werk: |
volume:87 |
DOI / URN: |
10.1016/j.csi.2023.103775 |
---|
Katalog-ID: |
ELV062439057 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | ELV062439057 | ||
003 | DE-627 | ||
005 | 20231205153706.0 | ||
007 | cr uuu---uuuuu | ||
008 | 230831s2023 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1016/j.csi.2023.103775 |2 doi | |
035 | |a (DE-627)ELV062439057 | ||
035 | |a (ELSEVIER)S0920-5489(23)00056-9 | ||
040 | |a DE-627 |b ger |c DE-627 |e rda | ||
041 | |a eng | ||
082 | 0 | 4 | |a 004 |q VZ |
084 | |a 54.21 |2 bkl | ||
100 | 1 | |a Hu, Jifa |e verfasserin |0 (orcid)0000-0003-0658-9875 |4 aut | |
245 | 1 | 0 | |a Faster matrix approximate homomorphic encryption |
264 | 1 | |c 2023 | |
336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a Approximate Homomorphic Encryption (AHE) becomes a research hot spot in homomorphic cryptography in recent years as it is widely used in neural network, deep learning and so on. Since matrix multiplication is frequently used in these applications, many researcher have studied on it. In this paper, we propose a new matrix approximate homomorphic encryption scheme with faster matrix homomorphic multiplication. To this end, we homomorphically simulate the Strassen’s algorithm based on CKKS scheme to achieve the faster matrix approximate homomorphic multiplication, which reduces the complexity of the matrix homomorphic multiplication from O ( N 3 ) to C m i n N log 7 , where C m i n is a positive constant. The simulation is realized by the half-cut transformation of the encoded polynomials. Additionally, we estimate the upper bound of the noise for the correctness of the scheme. | ||
650 | 4 | |a Approximate homomorphic encryption | |
650 | 4 | |a Fully homomorphic encryption | |
650 | 4 | |a Matrix multiplication | |
650 | 4 | |a Half-cut transformation | |
700 | 1 | |a Wang, Fuqun |e verfasserin |0 (orcid)0000-0002-6178-3630 |4 aut | |
700 | 1 | |a Chen, Kefei |e verfasserin |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Computer standards & interfaces |d Amsterdam : Elsevier Science Publ. BV (North-Holland), 1986 |g 87 |h Online-Ressource |w (DE-627)265782694 |w (DE-600)1466180-9 |w (DE-576)074890670 |x 0920-5489 |7 nnns |
773 | 1 | 8 | |g volume:87 |
912 | |a GBV_USEFLAG_U | ||
912 | |a GBV_ELV | ||
912 | |a SYSFLAG_U | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_31 | ||
912 | |a GBV_ILN_32 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_74 | ||
912 | |a GBV_ILN_90 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_100 | ||
912 | |a GBV_ILN_101 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_150 | ||
912 | |a GBV_ILN_151 | ||
912 | |a GBV_ILN_187 | ||
912 | |a GBV_ILN_213 | ||
912 | |a GBV_ILN_224 | ||
912 | |a GBV_ILN_230 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_702 | ||
912 | |a GBV_ILN_2001 | ||
912 | |a GBV_ILN_2003 | ||
912 | |a GBV_ILN_2004 | ||
912 | |a GBV_ILN_2005 | ||
912 | |a GBV_ILN_2007 | ||
912 | |a GBV_ILN_2008 | ||
912 | |a GBV_ILN_2009 | ||
912 | |a GBV_ILN_2010 | ||
912 | |a GBV_ILN_2011 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_2015 | ||
912 | |a GBV_ILN_2020 | ||
912 | |a GBV_ILN_2021 | ||
912 | |a GBV_ILN_2025 | ||
912 | |a GBV_ILN_2026 | ||
912 | |a GBV_ILN_2027 | ||
912 | |a GBV_ILN_2034 | ||
912 | |a GBV_ILN_2044 | ||
912 | |a GBV_ILN_2048 | ||
912 | |a GBV_ILN_2049 | ||
912 | |a GBV_ILN_2050 | ||
912 | |a GBV_ILN_2055 | ||
912 | |a GBV_ILN_2056 | ||
912 | |a GBV_ILN_2059 | ||
912 | |a GBV_ILN_2061 | ||
912 | |a GBV_ILN_2064 | ||
912 | |a GBV_ILN_2088 | ||
912 | |a GBV_ILN_2106 | ||
912 | |a GBV_ILN_2110 | ||
912 | |a GBV_ILN_2111 | ||
912 | |a GBV_ILN_2112 | ||
912 | |a GBV_ILN_2122 | ||
912 | |a GBV_ILN_2129 | ||
912 | |a GBV_ILN_2143 | ||
912 | |a GBV_ILN_2152 | ||
912 | |a GBV_ILN_2153 | ||
912 | |a GBV_ILN_2190 | ||
912 | |a GBV_ILN_2232 | ||
912 | |a GBV_ILN_2336 | ||
912 | |a GBV_ILN_2470 | ||
912 | |a GBV_ILN_2507 | ||
912 | |a GBV_ILN_4035 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4242 | ||
912 | |a GBV_ILN_4249 | ||
912 | |a GBV_ILN_4251 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4306 | ||
912 | |a GBV_ILN_4307 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4322 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4325 | ||
912 | |a GBV_ILN_4326 | ||
912 | |a GBV_ILN_4333 | ||
912 | |a GBV_ILN_4334 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4393 | ||
912 | |a GBV_ILN_4700 | ||
936 | b | k | |a 54.21 |j Rechnerperipherie |j Datenkommunikationshardware |q VZ |
951 | |a AR | ||
952 | |d 87 |
author_variant |
j h jh f w fw k c kc |
---|---|
matchkey_str |
article:09205489:2023----::atrarxprxmthmmrh |
hierarchy_sort_str |
2023 |
bklnumber |
54.21 |
publishDate |
2023 |
allfields |
10.1016/j.csi.2023.103775 doi (DE-627)ELV062439057 (ELSEVIER)S0920-5489(23)00056-9 DE-627 ger DE-627 rda eng 004 VZ 54.21 bkl Hu, Jifa verfasserin (orcid)0000-0003-0658-9875 aut Faster matrix approximate homomorphic encryption 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Approximate Homomorphic Encryption (AHE) becomes a research hot spot in homomorphic cryptography in recent years as it is widely used in neural network, deep learning and so on. Since matrix multiplication is frequently used in these applications, many researcher have studied on it. In this paper, we propose a new matrix approximate homomorphic encryption scheme with faster matrix homomorphic multiplication. To this end, we homomorphically simulate the Strassen’s algorithm based on CKKS scheme to achieve the faster matrix approximate homomorphic multiplication, which reduces the complexity of the matrix homomorphic multiplication from O ( N 3 ) to C m i n N log 7 , where C m i n is a positive constant. The simulation is realized by the half-cut transformation of the encoded polynomials. Additionally, we estimate the upper bound of the noise for the correctness of the scheme. Approximate homomorphic encryption Fully homomorphic encryption Matrix multiplication Half-cut transformation Wang, Fuqun verfasserin (orcid)0000-0002-6178-3630 aut Chen, Kefei verfasserin aut Enthalten in Computer standards & interfaces Amsterdam : Elsevier Science Publ. BV (North-Holland), 1986 87 Online-Ressource (DE-627)265782694 (DE-600)1466180-9 (DE-576)074890670 0920-5489 nnns volume:87 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.21 Rechnerperipherie Datenkommunikationshardware VZ AR 87 |
spelling |
10.1016/j.csi.2023.103775 doi (DE-627)ELV062439057 (ELSEVIER)S0920-5489(23)00056-9 DE-627 ger DE-627 rda eng 004 VZ 54.21 bkl Hu, Jifa verfasserin (orcid)0000-0003-0658-9875 aut Faster matrix approximate homomorphic encryption 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Approximate Homomorphic Encryption (AHE) becomes a research hot spot in homomorphic cryptography in recent years as it is widely used in neural network, deep learning and so on. Since matrix multiplication is frequently used in these applications, many researcher have studied on it. In this paper, we propose a new matrix approximate homomorphic encryption scheme with faster matrix homomorphic multiplication. To this end, we homomorphically simulate the Strassen’s algorithm based on CKKS scheme to achieve the faster matrix approximate homomorphic multiplication, which reduces the complexity of the matrix homomorphic multiplication from O ( N 3 ) to C m i n N log 7 , where C m i n is a positive constant. The simulation is realized by the half-cut transformation of the encoded polynomials. Additionally, we estimate the upper bound of the noise for the correctness of the scheme. Approximate homomorphic encryption Fully homomorphic encryption Matrix multiplication Half-cut transformation Wang, Fuqun verfasserin (orcid)0000-0002-6178-3630 aut Chen, Kefei verfasserin aut Enthalten in Computer standards & interfaces Amsterdam : Elsevier Science Publ. BV (North-Holland), 1986 87 Online-Ressource (DE-627)265782694 (DE-600)1466180-9 (DE-576)074890670 0920-5489 nnns volume:87 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.21 Rechnerperipherie Datenkommunikationshardware VZ AR 87 |
allfields_unstemmed |
10.1016/j.csi.2023.103775 doi (DE-627)ELV062439057 (ELSEVIER)S0920-5489(23)00056-9 DE-627 ger DE-627 rda eng 004 VZ 54.21 bkl Hu, Jifa verfasserin (orcid)0000-0003-0658-9875 aut Faster matrix approximate homomorphic encryption 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Approximate Homomorphic Encryption (AHE) becomes a research hot spot in homomorphic cryptography in recent years as it is widely used in neural network, deep learning and so on. Since matrix multiplication is frequently used in these applications, many researcher have studied on it. In this paper, we propose a new matrix approximate homomorphic encryption scheme with faster matrix homomorphic multiplication. To this end, we homomorphically simulate the Strassen’s algorithm based on CKKS scheme to achieve the faster matrix approximate homomorphic multiplication, which reduces the complexity of the matrix homomorphic multiplication from O ( N 3 ) to C m i n N log 7 , where C m i n is a positive constant. The simulation is realized by the half-cut transformation of the encoded polynomials. Additionally, we estimate the upper bound of the noise for the correctness of the scheme. Approximate homomorphic encryption Fully homomorphic encryption Matrix multiplication Half-cut transformation Wang, Fuqun verfasserin (orcid)0000-0002-6178-3630 aut Chen, Kefei verfasserin aut Enthalten in Computer standards & interfaces Amsterdam : Elsevier Science Publ. BV (North-Holland), 1986 87 Online-Ressource (DE-627)265782694 (DE-600)1466180-9 (DE-576)074890670 0920-5489 nnns volume:87 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.21 Rechnerperipherie Datenkommunikationshardware VZ AR 87 |
allfieldsGer |
10.1016/j.csi.2023.103775 doi (DE-627)ELV062439057 (ELSEVIER)S0920-5489(23)00056-9 DE-627 ger DE-627 rda eng 004 VZ 54.21 bkl Hu, Jifa verfasserin (orcid)0000-0003-0658-9875 aut Faster matrix approximate homomorphic encryption 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Approximate Homomorphic Encryption (AHE) becomes a research hot spot in homomorphic cryptography in recent years as it is widely used in neural network, deep learning and so on. Since matrix multiplication is frequently used in these applications, many researcher have studied on it. In this paper, we propose a new matrix approximate homomorphic encryption scheme with faster matrix homomorphic multiplication. To this end, we homomorphically simulate the Strassen’s algorithm based on CKKS scheme to achieve the faster matrix approximate homomorphic multiplication, which reduces the complexity of the matrix homomorphic multiplication from O ( N 3 ) to C m i n N log 7 , where C m i n is a positive constant. The simulation is realized by the half-cut transformation of the encoded polynomials. Additionally, we estimate the upper bound of the noise for the correctness of the scheme. Approximate homomorphic encryption Fully homomorphic encryption Matrix multiplication Half-cut transformation Wang, Fuqun verfasserin (orcid)0000-0002-6178-3630 aut Chen, Kefei verfasserin aut Enthalten in Computer standards & interfaces Amsterdam : Elsevier Science Publ. BV (North-Holland), 1986 87 Online-Ressource (DE-627)265782694 (DE-600)1466180-9 (DE-576)074890670 0920-5489 nnns volume:87 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.21 Rechnerperipherie Datenkommunikationshardware VZ AR 87 |
allfieldsSound |
10.1016/j.csi.2023.103775 doi (DE-627)ELV062439057 (ELSEVIER)S0920-5489(23)00056-9 DE-627 ger DE-627 rda eng 004 VZ 54.21 bkl Hu, Jifa verfasserin (orcid)0000-0003-0658-9875 aut Faster matrix approximate homomorphic encryption 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Approximate Homomorphic Encryption (AHE) becomes a research hot spot in homomorphic cryptography in recent years as it is widely used in neural network, deep learning and so on. Since matrix multiplication is frequently used in these applications, many researcher have studied on it. In this paper, we propose a new matrix approximate homomorphic encryption scheme with faster matrix homomorphic multiplication. To this end, we homomorphically simulate the Strassen’s algorithm based on CKKS scheme to achieve the faster matrix approximate homomorphic multiplication, which reduces the complexity of the matrix homomorphic multiplication from O ( N 3 ) to C m i n N log 7 , where C m i n is a positive constant. The simulation is realized by the half-cut transformation of the encoded polynomials. Additionally, we estimate the upper bound of the noise for the correctness of the scheme. Approximate homomorphic encryption Fully homomorphic encryption Matrix multiplication Half-cut transformation Wang, Fuqun verfasserin (orcid)0000-0002-6178-3630 aut Chen, Kefei verfasserin aut Enthalten in Computer standards & interfaces Amsterdam : Elsevier Science Publ. BV (North-Holland), 1986 87 Online-Ressource (DE-627)265782694 (DE-600)1466180-9 (DE-576)074890670 0920-5489 nnns volume:87 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.21 Rechnerperipherie Datenkommunikationshardware VZ AR 87 |
language |
English |
source |
Enthalten in Computer standards & interfaces 87 volume:87 |
sourceStr |
Enthalten in Computer standards & interfaces 87 volume:87 |
format_phy_str_mv |
Article |
bklname |
Rechnerperipherie Datenkommunikationshardware |
institution |
findex.gbv.de |
topic_facet |
Approximate homomorphic encryption Fully homomorphic encryption Matrix multiplication Half-cut transformation |
dewey-raw |
004 |
isfreeaccess_bool |
false |
container_title |
Computer standards & interfaces |
authorswithroles_txt_mv |
Hu, Jifa @@aut@@ Wang, Fuqun @@aut@@ Chen, Kefei @@aut@@ |
publishDateDaySort_date |
2023-01-01T00:00:00Z |
hierarchy_top_id |
265782694 |
dewey-sort |
14 |
id |
ELV062439057 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV062439057</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231205153706.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230831s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.csi.2023.103775</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV062439057</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0920-5489(23)00056-9</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.21</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hu, Jifa</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0003-0658-9875</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Faster matrix approximate homomorphic encryption</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Approximate Homomorphic Encryption (AHE) becomes a research hot spot in homomorphic cryptography in recent years as it is widely used in neural network, deep learning and so on. Since matrix multiplication is frequently used in these applications, many researcher have studied on it. In this paper, we propose a new matrix approximate homomorphic encryption scheme with faster matrix homomorphic multiplication. To this end, we homomorphically simulate the Strassen’s algorithm based on CKKS scheme to achieve the faster matrix approximate homomorphic multiplication, which reduces the complexity of the matrix homomorphic multiplication from O ( N 3 ) to C m i n N log 7 , where C m i n is a positive constant. The simulation is realized by the half-cut transformation of the encoded polynomials. Additionally, we estimate the upper bound of the noise for the correctness of the scheme.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximate homomorphic encryption</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fully homomorphic encryption</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matrix multiplication</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Half-cut transformation</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Fuqun</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-6178-3630</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chen, Kefei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Computer standards & interfaces</subfield><subfield code="d">Amsterdam : Elsevier Science Publ. BV (North-Holland), 1986</subfield><subfield code="g">87</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)265782694</subfield><subfield code="w">(DE-600)1466180-9</subfield><subfield code="w">(DE-576)074890670</subfield><subfield code="x">0920-5489</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:87</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.21</subfield><subfield code="j">Rechnerperipherie</subfield><subfield code="j">Datenkommunikationshardware</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">87</subfield></datafield></record></collection>
|
author |
Hu, Jifa |
spellingShingle |
Hu, Jifa ddc 004 bkl 54.21 misc Approximate homomorphic encryption misc Fully homomorphic encryption misc Matrix multiplication misc Half-cut transformation Faster matrix approximate homomorphic encryption |
authorStr |
Hu, Jifa |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)265782694 |
format |
electronic Article |
dewey-ones |
004 - Data processing & computer science |
delete_txt_mv |
keep |
author_role |
aut aut aut |
collection |
elsevier |
remote_str |
true |
illustrated |
Not Illustrated |
issn |
0920-5489 |
topic_title |
004 VZ 54.21 bkl Faster matrix approximate homomorphic encryption Approximate homomorphic encryption Fully homomorphic encryption Matrix multiplication Half-cut transformation |
topic |
ddc 004 bkl 54.21 misc Approximate homomorphic encryption misc Fully homomorphic encryption misc Matrix multiplication misc Half-cut transformation |
topic_unstemmed |
ddc 004 bkl 54.21 misc Approximate homomorphic encryption misc Fully homomorphic encryption misc Matrix multiplication misc Half-cut transformation |
topic_browse |
ddc 004 bkl 54.21 misc Approximate homomorphic encryption misc Fully homomorphic encryption misc Matrix multiplication misc Half-cut transformation |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Computer standards & interfaces |
hierarchy_parent_id |
265782694 |
dewey-tens |
000 - Computer science, knowledge & systems |
hierarchy_top_title |
Computer standards & interfaces |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)265782694 (DE-600)1466180-9 (DE-576)074890670 |
title |
Faster matrix approximate homomorphic encryption |
ctrlnum |
(DE-627)ELV062439057 (ELSEVIER)S0920-5489(23)00056-9 |
title_full |
Faster matrix approximate homomorphic encryption |
author_sort |
Hu, Jifa |
journal |
Computer standards & interfaces |
journalStr |
Computer standards & interfaces |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2023 |
contenttype_str_mv |
zzz |
author_browse |
Hu, Jifa Wang, Fuqun Chen, Kefei |
container_volume |
87 |
class |
004 VZ 54.21 bkl |
format_se |
Elektronische Aufsätze |
author-letter |
Hu, Jifa |
doi_str_mv |
10.1016/j.csi.2023.103775 |
normlink |
(ORCID)0000-0003-0658-9875 (ORCID)0000-0002-6178-3630 |
normlink_prefix_str_mv |
(orcid)0000-0003-0658-9875 (orcid)0000-0002-6178-3630 |
dewey-full |
004 |
author2-role |
verfasserin |
title_sort |
faster matrix approximate homomorphic encryption |
title_auth |
Faster matrix approximate homomorphic encryption |
abstract |
Approximate Homomorphic Encryption (AHE) becomes a research hot spot in homomorphic cryptography in recent years as it is widely used in neural network, deep learning and so on. Since matrix multiplication is frequently used in these applications, many researcher have studied on it. In this paper, we propose a new matrix approximate homomorphic encryption scheme with faster matrix homomorphic multiplication. To this end, we homomorphically simulate the Strassen’s algorithm based on CKKS scheme to achieve the faster matrix approximate homomorphic multiplication, which reduces the complexity of the matrix homomorphic multiplication from O ( N 3 ) to C m i n N log 7 , where C m i n is a positive constant. The simulation is realized by the half-cut transformation of the encoded polynomials. Additionally, we estimate the upper bound of the noise for the correctness of the scheme. |
abstractGer |
Approximate Homomorphic Encryption (AHE) becomes a research hot spot in homomorphic cryptography in recent years as it is widely used in neural network, deep learning and so on. Since matrix multiplication is frequently used in these applications, many researcher have studied on it. In this paper, we propose a new matrix approximate homomorphic encryption scheme with faster matrix homomorphic multiplication. To this end, we homomorphically simulate the Strassen’s algorithm based on CKKS scheme to achieve the faster matrix approximate homomorphic multiplication, which reduces the complexity of the matrix homomorphic multiplication from O ( N 3 ) to C m i n N log 7 , where C m i n is a positive constant. The simulation is realized by the half-cut transformation of the encoded polynomials. Additionally, we estimate the upper bound of the noise for the correctness of the scheme. |
abstract_unstemmed |
Approximate Homomorphic Encryption (AHE) becomes a research hot spot in homomorphic cryptography in recent years as it is widely used in neural network, deep learning and so on. Since matrix multiplication is frequently used in these applications, many researcher have studied on it. In this paper, we propose a new matrix approximate homomorphic encryption scheme with faster matrix homomorphic multiplication. To this end, we homomorphically simulate the Strassen’s algorithm based on CKKS scheme to achieve the faster matrix approximate homomorphic multiplication, which reduces the complexity of the matrix homomorphic multiplication from O ( N 3 ) to C m i n N log 7 , where C m i n is a positive constant. The simulation is realized by the half-cut transformation of the encoded polynomials. Additionally, we estimate the upper bound of the noise for the correctness of the scheme. |
collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 |
title_short |
Faster matrix approximate homomorphic encryption |
remote_bool |
true |
author2 |
Wang, Fuqun Chen, Kefei |
author2Str |
Wang, Fuqun Chen, Kefei |
ppnlink |
265782694 |
mediatype_str_mv |
c |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1016/j.csi.2023.103775 |
up_date |
2024-07-06T18:47:31.019Z |
_version_ |
1803856538260996096 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV062439057</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231205153706.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230831s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.csi.2023.103775</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV062439057</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0920-5489(23)00056-9</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.21</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hu, Jifa</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0003-0658-9875</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Faster matrix approximate homomorphic encryption</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Approximate Homomorphic Encryption (AHE) becomes a research hot spot in homomorphic cryptography in recent years as it is widely used in neural network, deep learning and so on. Since matrix multiplication is frequently used in these applications, many researcher have studied on it. In this paper, we propose a new matrix approximate homomorphic encryption scheme with faster matrix homomorphic multiplication. To this end, we homomorphically simulate the Strassen’s algorithm based on CKKS scheme to achieve the faster matrix approximate homomorphic multiplication, which reduces the complexity of the matrix homomorphic multiplication from O ( N 3 ) to C m i n N log 7 , where C m i n is a positive constant. The simulation is realized by the half-cut transformation of the encoded polynomials. Additionally, we estimate the upper bound of the noise for the correctness of the scheme.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximate homomorphic encryption</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fully homomorphic encryption</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matrix multiplication</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Half-cut transformation</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Fuqun</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-6178-3630</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chen, Kefei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Computer standards & interfaces</subfield><subfield code="d">Amsterdam : Elsevier Science Publ. BV (North-Holland), 1986</subfield><subfield code="g">87</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)265782694</subfield><subfield code="w">(DE-600)1466180-9</subfield><subfield code="w">(DE-576)074890670</subfield><subfield code="x">0920-5489</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:87</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.21</subfield><subfield code="j">Rechnerperipherie</subfield><subfield code="j">Datenkommunikationshardware</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">87</subfield></datafield></record></collection>
|
score |
7.399308 |