AC-RRNS: Anti-collusion secured data sharing scheme for cloud storage

Tchernykh, Andrei; Babenko, Mikhail; Chervyakov, Nikolay I.; Miranda-López, Vanessa; Kuchukov, Viktor; Cortés-Mendoza, Jorge M.; Deryabin, Maxim; Kucherov, Nikolay Nikolaevich; Радченко, Глеб; Avetisyan, Arutyun

doi:10.1016/j.ijar.2018.07.010

Cited by 44 publications

(26 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This method, instead of an approximate conversion (a conversion with the excess flow), estimates and uses the exact value for the conversion [19,[21][22][23][24][25]. Equation (17) can be reformulated to find as follows:…”

Section: Extension Methods Using Floating-point Arithmeticmentioning

confidence: 99%

Neural network method for base extension in residue number system

Babenko¹,

Shiriaev²,

Tchernykh³

et al. 2020

The International Workshop on Information, Computation, and Control Systems for Distributed Environments

View full text Add to dashboard Cite

Confidential data security is associated with the cryptographic primitives, asymmetric encryption, elliptic curve cryptography, homomorphic encryption, cryptographic pseudorandom sequence generators based on an elliptic curve, etc. For their efficient implementation is often used Residue Number System that allows executing additions and multiplications on parallel computing channels without bit carrying between channels. A critical operation in Residue Number System implementations of asymmetric cryptosystems is base extension. It refers to the computing a residue in the extended moduli without the application of the traditional Chinese Remainder Theorem algorithm. In this work, we propose a new way to perform base extensions using a Neural Network of a final ring. We show that it reduces 11.7% of the computational cost, compared with state-of-the-art approaches.

show abstract

Section: Extension Methods Using Floating-point Arithmeticmentioning

confidence: 99%

Neural network method for base extension in residue number system

Babenko¹,

Shiriaev²,

Tchernykh³

et al. 2020

The International Workshop on Information, Computation, and Control Systems for Distributed Environments

View full text Add to dashboard Cite

show abstract

“…An alternative way is to use RRNS, which on the one hand, is the error correction code, which allows restoring the result when an error occurs, and on the other hand, is a secret sharing scheme that ensures data security [14]. Tchernykh et al [33] show how the security of stored data depends on the RRNS parameters. 2L-RRNS can increase the number of detected and correctable errors compared to 1L-RRNS [23].…”

Section: Distributed Storage Securitymentioning

confidence: 99%

“…The Gentry C Cryptosystem is safe and resistant to various attacks but has high computational complexity, which does not allow it to be used in practical applications. To reduce the computational complexity, [33] proposed an analog of the Gentry C scheme based on the RNS. Tchernykh et al [16] showed that RNS provides the necessary level of security and reduces the computational complexity of encoding and decoding.…”

Section: Privacy-preserving For Cloud Computingmentioning

confidence: 99%

2Lbp-RRNS: Two-Levels RRNS With Backpropagation for Increased Reliability and Privacy-Preserving of Secure Multi-Clouds Data Storage

et al. 2020

Self Cite

View full text Add to dashboard Cite

Cloud storage as service is the mainstream technology used to retain digital data. However, there are significant risks for confidentiality, integrity, and availability violation associated with the loss of information, denial of access, technical failures, etc. In this article, we propose a two-level 2Lbp-RRNS scheme based on a Redundant Residue Number System with a backpropagation and hamming distance mechanisms for increasing reliability of a configurable and secure multi-cloud data storage. We provide a theoretical analysis of the 2Lbp-RRNS solution as an extension of the classical 2L-RRNS and a variant of fully homomorphic encryption for privacy-preserving, parallel processing, and scalability. We formulate, explain, and prove its main properties to extend existing knowledge within the limits of the critical bounding RRNS assumptions. We show that 2Lbp-RRNS can identify and recover more errors than traditional 2L-RRNS. We provide the upper bounds of the traditional threshold 2L-RRNS and our solution to estimate the number of detectable and correctable errors. We study various data access scenarios and show that it detects 1.58x and corrects 3.37x more errors than 2L-RRNS, on average. We also provide efficient implementations of encoding and decoding algorithms MRC8, and MRC16 based on the Mixed-Radix system, Finite Ring Neuronal Network, and signed binary window method. We evaluate encoding/decoding speeds using three algorithms: Mignotte, MRC8, and MRC16. The experimental system includes seven cloud storages: DropBox, GoogleDrive, OneDrive, Sharefile, Box, Egnyte, and Salesforce. To assess the efficiency of the system on real data, we vary scenarios of the first and second levels. The results show that our solution outperforms MRC8 by 2.53x (1.78x), and Mignotte by 4.83x (11.43x) for the encoding (decoding) speed, respectively.

show abstract

“…Компромиссом являются вычислительно стойкие схемы разделения секрета [4], которые обеспечивают достаточную конфиденциальность при сравнительно небольшой избыточности. Примером может быть основанная на СОК AC-RRNS, предложенная в работе [41] как метод кодирования для облачного хранения данных. Другая вычислительно стойкая схема разделения секрета предложена в работе [5] и основывается на симметричном шифровании и распределении данных с помощью СОК.…”

Section: система остаточных классов и схемы разделения секретаunclassified

Secure and Reliable Data Transmission Over MANET Based On Principles of Computationally Secure Secret Sharing

Chervyakov¹,

Deryabin²,

Nazarov³

et al. 2019

Proceedings of ISP RAS

View full text Add to dashboard Cite

Mobile Ad-Hoc Networks (MANET) require special approaches to the design and selection of data transmission and security algorithms Nodes mobility and dynamic topology give rise to two key problems of MANET-the difficulty of ensuring confidentiality when transmitting data through a network and the complexity of organizing reliable data transfer. This paper proposes a new approach to organizing data transfer through MANET, based on node disjoint multipath routing and modular coding of data. Distributed modular coding allows the use of secret-sharing schemes to ensure confidentiality on the one hand and reliable coding on the other hand. In this paper, a Computationally Secure Secret Sharing Scheme based on the Residue Number System is used, which ensures the confidentiality of data and the reliability of their transmission. Such an approach also allows for balancing the network loading.

show abstract

AC-RRNS: Anti-collusion secured data sharing scheme for cloud storage

Cited by 44 publications

References 31 publications

Neural network method for base extension in residue number system

Neural network method for base extension in residue number system

2Lbp-RRNS: Two-Levels RRNS With Backpropagation for Increased Reliability and Privacy-Preserving of Secure Multi-Clouds Data Storage

Secure and Reliable Data Transmission Over MANET Based On Principles of Computationally Secure Secret Sharing

Contact Info

Product

Resources

About