Please use this identifier to cite or link to this item:
|Title:||The development of secure mobile computing network based on secret sharing schemes|
|Authors:||Chervyakov, N. I.|
Червяков, Н. И.
Babenko, M. G.
Бабенко, М. Г.
Deryabin, M. A.
Дерябин, М. А.
Shabalina, M. N.
Шабалина, М. Н.
|Keywords:||Mobile networks;Residue number system (RNS);Secret Sharing Schemes;Distributed computer systems|
|Publisher:||Institute of Electrical and Electronics Engineers Inc.|
|Citation:||Chervyakov, N.I., Babenko, M.G., Deryabin, M.A., Shabalina, M.N., Alassane, B.A. The development of secure mobile computing network based on secret sharing schemes // Proceedings of the 2016 IEEE North West Russia Section Young Researchers in Electrical and Electronic Engineering Conference, EIConRusNW 2016. - 2016. - Номер статьи 7448149. - Pages 180-184|
|Series/Report no.:||Proceedings of the 2016 IEEE North West Russia Section Young Researchers in Electrical and Electronic Engineering Conference, EIConRusNW 2016|
|Abstract:||In the article the problem of construction of mobile networks for solving computationally complex problems is researched. It is proposed to use the modified secret sharing scheme (SSS) Asmuth-Bloom for distributed computing in the mobile network. The SSS constructed on the basis of residue number system (RNS) allows to parallelize arithmetic operations of addition and multiplication of numbers, but make it difficult to perform a division operation. The proposed method allows the efficient implementation of arithmetic operations of addition, multiplication and division in the RNS. To evaluate the performance of a mobile computing network the problem of solving systems of linear equations was used. It is shown that the use of the proposed approach makes it possible to parallelize computations and to ensure their safety|
|Appears in Collections:||Статьи, проиндексированные в SCOPUS, WOS|
Files in This Item:
|scopusresults 457 .pdf||63.17 kB||Adobe PDF|
|WoS 276 .pdf||296.85 kB||Adobe PDF|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.