Security analysis of homomorphic encryption scheme for cloud computing: Known-plaintext attack

M. Babenko; N. Chervyakov; A. Tchernykh; N. Kucherov; M. Deryabin; G. Radchenko; P.O.A. Navaux; V. Svyatkin

doi:10.1109/EIConRus.2018.8317083

Security analysis of homomorphic encryption scheme for cloud computing: Known-plaintext attack

M. Babenko, N. Chervyakov, A. Tchernykh, N. Kucherov, M. Deryabin, G. Radchenko, P.O.A. Navaux, V. Svyatkin

Publikation: Konferenzbeitrag › Papier › Begutachtung

Abstract

We consider cryptosystems for homomorphic encryption schemes based on the Residue Number System (RNS) and Secret Sharing Schemes. One of their disadvantages is that they are directly related to data redundancy, and hence, increasing the size of the storage. To minimize it, homophonic encryption can be combined with the arithmetic coding known as Chinese remainder theorem. We describe a new method of cryptanalysis based on a property of RNS and theory of numbers. We prove that an attacker needs only η · [log2 log2(k · pn)l arbitrary generated input files that form the 'known-plaintext', where pi is moduli RNS, to calculate the secret key required to decrypt the entire data. © 2018 IEEE.

Originalsprache	Englisch
Seiten	270-274
Seitenumfang	5
DOIs	https://doi.org/10.1109/EIConRus.2018.8317083
Publikationsstatus	Veröffentlicht - 2018
Veranstaltung	2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering - St. Petersburg Electrotechnical University “LETI”, St. Petersburg, Russland Dauer: 29 Jän. 2018 → 1 Feb. 2018

Konferenz

Konferenz	2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering
Kurztitel	ElConRus 2018
Land/Gebiet	Russland
Ort	St. Petersburg
Zeitraum	29/01/18 → 1/02/18

Zugriff auf Dokument

10.1109/EIConRus.2018.8317083

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048047585&doi=10.1109%2fEIConRus.2018.8317083&partnerID=40&md5=a6e975fdafb4448dc3b6e783fcd22d7b

Dieses zitieren

Babenko, M., Chervyakov, N., Tchernykh, A., Kucherov, N., Deryabin, M., Radchenko, G., Navaux, P. O. A., & Svyatkin, V. (2018). Security analysis of homomorphic encryption scheme for cloud computing: Known-plaintext attack. 270-274. Beitrag in 2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering, St. Petersburg, Russland. https://doi.org/10.1109/EIConRus.2018.8317083

@conference{465b414f4ae04986aae39e9309cca149,

title = "Security analysis of homomorphic encryption scheme for cloud computing: Known-plaintext attack",

abstract = "We consider cryptosystems for homomorphic encryption schemes based on the Residue Number System (RNS) and Secret Sharing Schemes. One of their disadvantages is that they are directly related to data redundancy, and hence, increasing the size of the storage. To minimize it, homophonic encryption can be combined with the arithmetic coding known as Chinese remainder theorem. We describe a new method of cryptanalysis based on a property of RNS and theory of numbers. We prove that an attacker needs only η · [log2 log2(k · pn)l arbitrary generated input files that form the 'known-plaintext', where pi is moduli RNS, to calculate the secret key required to decrypt the entire data. {\textcopyright} 2018 IEEE.",

keywords = "cloud computing, homomorphic encryption, known-plaintext attack, Cloud computing, Computation theory, Digital storage, Number theory, Numbering systems, Arithmetic Coding, Chinese remainder theorem, Ho-momorphic encryptions, Homomorphic Encryption Schemes, Known-plaintext attacks, Residue number system, Secret sharing schemes, Security analysis, Cryptography",

author = "M. Babenko and N. Chervyakov and A. Tchernykh and N. Kucherov and M. Deryabin and G. Radchenko and P.O.A. Navaux and V. Svyatkin",

note = "Conference code: 135266 Cited By :3 Export Date: 27 August 2021 Funding details: Russian Foundation for Basic Research, RFBR, 18-07-01224 Funding details: Council on grants of the President of the Russian Federation, MK-6294.2018.9, SP-1215.2016 Funding text 1: The work is partially supported by Russian Federation President Grant SP-1215.2016, MK-6294.2018.9, and Russian Foundation for Basic Research (RFBR) 18-07-01224.; 2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering, ElConRus 2018 ; Conference date: 29-01-2018 Through 01-02-2018",

year = "2018",

doi = "10.1109/EIConRus.2018.8317083",

language = "English",

pages = "270--274",

}

Babenko, M, Chervyakov, N, Tchernykh, A, Kucherov, N, Deryabin, M, Radchenko, G, Navaux, POA & Svyatkin, V 2018, 'Security analysis of homomorphic encryption scheme for cloud computing: Known-plaintext attack', Beitrag in 2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering, St. Petersburg, Russland, 29/01/18 - 1/02/18 S. 270-274. https://doi.org/10.1109/EIConRus.2018.8317083

TY - CONF

T1 - Security analysis of homomorphic encryption scheme for cloud computing: Known-plaintext attack

AU - Babenko, M.

AU - Chervyakov, N.

AU - Tchernykh, A.

AU - Kucherov, N.

AU - Deryabin, M.

AU - Radchenko, G.

AU - Navaux, P.O.A.

AU - Svyatkin, V.

N1 - Conference code: 135266 Cited By :3 Export Date: 27 August 2021 Funding details: Russian Foundation for Basic Research, RFBR, 18-07-01224 Funding details: Council on grants of the President of the Russian Federation, MK-6294.2018.9, SP-1215.2016 Funding text 1: The work is partially supported by Russian Federation President Grant SP-1215.2016, MK-6294.2018.9, and Russian Foundation for Basic Research (RFBR) 18-07-01224.

PY - 2018

Y1 - 2018

N2 - We consider cryptosystems for homomorphic encryption schemes based on the Residue Number System (RNS) and Secret Sharing Schemes. One of their disadvantages is that they are directly related to data redundancy, and hence, increasing the size of the storage. To minimize it, homophonic encryption can be combined with the arithmetic coding known as Chinese remainder theorem. We describe a new method of cryptanalysis based on a property of RNS and theory of numbers. We prove that an attacker needs only η · [log2 log2(k · pn)l arbitrary generated input files that form the 'known-plaintext', where pi is moduli RNS, to calculate the secret key required to decrypt the entire data. © 2018 IEEE.

AB - We consider cryptosystems for homomorphic encryption schemes based on the Residue Number System (RNS) and Secret Sharing Schemes. One of their disadvantages is that they are directly related to data redundancy, and hence, increasing the size of the storage. To minimize it, homophonic encryption can be combined with the arithmetic coding known as Chinese remainder theorem. We describe a new method of cryptanalysis based on a property of RNS and theory of numbers. We prove that an attacker needs only η · [log2 log2(k · pn)l arbitrary generated input files that form the 'known-plaintext', where pi is moduli RNS, to calculate the secret key required to decrypt the entire data. © 2018 IEEE.

KW - cloud computing

KW - homomorphic encryption

KW - known-plaintext attack

KW - Cloud computing

KW - Computation theory

KW - Digital storage

KW - Number theory

KW - Numbering systems

KW - Arithmetic Coding

KW - Chinese remainder theorem

KW - Ho-momorphic encryptions

KW - Homomorphic Encryption Schemes

KW - Known-plaintext attacks

KW - Residue number system

KW - Secret sharing schemes

KW - Security analysis

KW - Cryptography

U2 - 10.1109/EIConRus.2018.8317083

DO - 10.1109/EIConRus.2018.8317083

M3 - Paper

SP - 270

EP - 274

T2 - 2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering

Y2 - 29 January 2018 through 1 February 2018

ER -

Security analysis of homomorphic encryption scheme for cloud computing: Known-plaintext attack

Abstract

Konferenz

Zugriff auf Dokument

Fingerprint

Dieses zitieren