Please use this identifier to cite or link to this item:
https://dspace.ncfu.ru/handle/20.500.12258/630
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Babenko, M. G. | - |
dc.contributor.author | Бабенко, М. Г. | - |
dc.contributor.author | Chervyakov, N. I. | - |
dc.contributor.author | Червяков, Н. И. | - |
dc.contributor.author | Kucherov, N. N. | - |
dc.contributor.author | Кучеров, Н. Н. | - |
dc.contributor.author | Deryabin, M. A. | - |
dc.contributor.author | Дерябин, М. А. | - |
dc.contributor.author | Svyatkin, V. E. | - |
dc.contributor.author | Святкин, В. Е. | - |
dc.date.accessioned | 2018-06-18T13:44:32Z | - |
dc.date.available | 2018-06-18T13:44:32Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | Babenko, M., Chervyakov, N., Tchernykh, A., Kucherov, N., Deryabin, M., Radchenko, G., Navaux, P.O.A., Svyatkin, V. Security analysis of homomorphic encryption scheme for cloud computing: Known-plaintext attack // Proceedings of the 2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering, ElConRus 2018. - 2018. - Pages 270-274 | ru |
dc.identifier.uri | https://www.scopus.com/record/display.uri?eid=2-s2.0-85048047585&origin=resultslist&sort=plf-f&src=s&nlo=1&nlr=20&nls=afprfnm-t&affilName=nort*+caucas*+fed*+univ*&sid=762e6d30544023d6a322a94577ba172b&sot=afnl&sdt=afsp&sl=53&s=%28AF-ID%28%22North+Caucasus+Federal+University%22+60070541%29%29&relpos=25&citeCnt=0&searchTerm= | - |
dc.identifier.uri | https://dspace.ncfu.ru:443/handle/20.500.12258/630 | - |
dc.description.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 | ru |
dc.language.iso | en | ru |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | ru |
dc.relation.ispartofseries | Proceedings of the 2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering, ElConRus 2018 | - |
dc.subject | Cloud computing | ru |
dc.subject | Homomorphic encryption | ru |
dc.subject | Known-plaintext attack | ru |
dc.title | Security analysis of homomorphic encryption scheme for cloud computing: known-plaintext attack | ru |
dc.type | Статья | ru |
vkr.amount | Pages 270-274 | ru |
vkr.inst | Институт математики и естественных наук | - |
Appears in Collections: | Статьи, проиндексированные в SCOPUS, WOS |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
scopusresults (96).pdf Restricted Access | 63.07 kB | Adobe PDF | View/Open | |
WoS 403 .pdf Restricted Access | 107.7 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.