Please use this identifier to cite or link to this item:
|Title:||Towards mitigating uncertainty of data security breaches and collusion in cloud computing|
|Authors:||Babenko, M. G.|
Бабенко, М. Г.
Chervyakov, N. I.
Червяков, Н. И.
Kucherov, N. N.
Кучеров, Н. Н.
Deryabin, M. A.
Дерябин, М. А.
Dvoryaninova, I. V.
Дворянинова, И. В.
|Keywords:||Cloud computing;Collusion;Redundant residue number system;Secret sharing schemes;Uncertainty|
|Publisher:||Institute of Electrical and Electronics Engineers Inc.|
|Citation:||Tchernykh, A., Babenko, M., Chervyakov, N., Cortés-Mendoza, J.M., Kucherov, N., Miranda-López, V., Deryabin, M., Dvoryaninova, I., Radchenko, G. Towards mitigating uncertainty of data security breaches and collusion in cloud computing // Proceedings - International Workshop on Database and Expert Systems Applications, DEXA. - 2017. - статья № 8049702, pp. 137-141|
|Series/Report no.:||Proceedings - International Workshop on Database and Expert Systems Applications, DEXA|
|Abstract:||Cloud computing has become a part of people's lives. However, there are many unresolved problems with security of this technology. According to the assessment of international experts in the field of security, there are risks in the appearance of cloud collusion in uncertain conditions. To mitigate this type of uncertainty, and minimize data redundancy of encryption together with harms caused by cloud collusion, modified threshold Asmuth-Bloom and weighted Mignotte secret sharing schemes are used. We show that if the villains do know the secret parts, and/or do not know the secret key, they cannot recuperate the secret. If the attackers do not know the required number of secret parts but know the secret key, the probability that they obtain the secret depends the size of the machine word in bits that is less than 1/2 ((l-1)). We demonstrate that the proposed scheme ensures security under several types of attacks. We propose four approaches to select weights for secret sharing schemes to optimize the system behavior based on data access speed: pessimistic, balanced, and optimistic, and on speed per price ratio. We use the approximate method to improve the detection, localization and error correction accuracy under cloud parameters uncertainty|
|Appears in Collections:||Статьи, проиндексированные в SCOPUS, WOS|
Files in This Item:
|scopusresults (104).pdf||64.23 kB||Adobe PDF|
|WoS 56 .pdf||83.22 kB||Adobe PDF|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.