Please use this identifier to cite or link to this item:
Title: Computationally secure threshold secret sharing scheme with minimal redundancy
Authors: Babenko, M. G.
Бабенко, М. Г.
Golimblevskaia, E. I.
Голимблевская, Е. И.
Keywords: Control systems;Digital storage;Multiprocessing systems;Redundancy;Codes (symbols)
Issue Date: 2020
Publisher: CEUR-WS
Citation: Babenko, M., Tchernykh, A., Golimblevskaia, E., Hung, N.V., Chaurasiya, V.K. Computationally secure threshold secret sharing scheme with minimal redundancy // CEUR Workshop Proceedings. - 2020. - Volume 2638. -Pages 23-32
Series/Report no.: CEUR Workshop Proceedings
Abstract: When designing and using distributed storage systems with cloud technology, the security issues become crucial. One of the promising mechanisms is the computationally secure threshold secret sharing scheme. We propose a computationally secure secret sharing scheme based on the minimally redundant modular code. It reduces the computational complexity of data encoding and decoding and reduce data redundancy. We show that it is computationally secure and provides data redundancy equivalent to the redundancy of the Rabin system. We demonstrate that the minimally redundant modular code does not satisfy the criterion of compactness of a sequence, but it can be used as an asymptotically ideal secret sharing scheme
Appears in Collections:Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:
File SizeFormat 
scopusresults 1389 .pdf64.01 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.