TY - CONF
T1 - Towards mitigating uncertainty of data security breaches and collusion in cloud computing
AU - Tchernykh, A.
AU - Babenko, M.
AU - Chervyakov, N.
AU - Cortés-Mendoza, J.M.
AU - Kucherov, N.
AU - Miranda-López, V.
AU - Deryabin, M.
AU - Dvoryaninova, I.
AU - Radchenko, G.
N1 - Conference code: 130863
Cited By :14
Export Date: 27 August 2021
Funding text 1: Russian Federation President Grant SP-1215.2016, and Act 211 Government of the Russian Federation, contract ? 02.A03.21.0011.
PY - 2017
Y1 - 2017
N2 - 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. © 2017 IEEE.
AB - 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. © 2017 IEEE.
KW - Cloud computing
KW - Collusion
KW - Redundant residue number system
KW - Secret sharing schemes
KW - Uncertainty
KW - Cryptography
KW - Error correction
KW - Expert systems
KW - Numbering systems
KW - Risk assessment
KW - Approximate methods
KW - Correction accuracy
KW - International experts
KW - Redundant residue number systems
KW - Uncertain condition
KW - Distributed computer systems
U2 - 10.1109/DEXA.2017.44
DO - 10.1109/DEXA.2017.44
M3 - Paper
SP - 137
EP - 141
T2 - 28th International Workshop on Database and Expert Systems Applications
Y2 - 28 August 2017 through 31 August 2017
ER -