Computationally secure threshold secret sharing scheme with minimal redundancy

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 mo...

Popoln opis

Shranjeno v:

Bibliografske podrobnosti
Главные авторы:	Babenko, M. G., Бабенко, М. Г., Golimblevskaia, E. I., Голимблевская, Е. И.
Format:	Статья
Jezik:	English
Izdano:	CEUR-WS 2020
Teme:	Control systems Digital storage Multiprocessing systems Redundancy Codes (symbols)
Online dostop:	https://dspace.ncfu.ru/handle/20.500.12258/14119
Oznake:	Označite Brez oznak, prvi označite!

id	ir-20.500.12258-14119
record_format	dspace
spelling	ir-20.500.12258-141192020-09-22T12:25:34Z Computationally secure threshold secret sharing scheme with minimal redundancy Babenko, M. G. Бабенко, М. Г. Golimblevskaia, E. I. Голимблевская, Е. И. Control systems Digital storage Multiprocessing systems Redundancy Codes (symbols) 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 2020-09-22T12:24:42Z 2020-09-22T12:24:42Z 2020 Статья 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 http://hdl.handle.net/20.500.12258/14119 en CEUR Workshop Proceedings application/pdf CEUR-WS
institution	СКФУ
collection	Репозиторий
language	English
topic	Control systems Digital storage Multiprocessing systems Redundancy Codes (symbols)
spellingShingle	Control systems Digital storage Multiprocessing systems Redundancy Codes (symbols) Babenko, M. G. Бабенко, М. Г. Golimblevskaia, E. I. Голимблевская, Е. И. Computationally secure threshold secret sharing scheme with minimal redundancy
description	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
format	Статья
author	Babenko, M. G. Бабенко, М. Г. Golimblevskaia, E. I. Голимблевская, Е. И.
author_facet	Babenko, M. G. Бабенко, М. Г. Golimblevskaia, E. I. Голимблевская, Е. И.
author_sort	Babenko, M. G.
title	Computationally secure threshold secret sharing scheme with minimal redundancy
title_short	Computationally secure threshold secret sharing scheme with minimal redundancy
title_full	Computationally secure threshold secret sharing scheme with minimal redundancy
title_fullStr	Computationally secure threshold secret sharing scheme with minimal redundancy
title_full_unstemmed	Computationally secure threshold secret sharing scheme with minimal redundancy
title_sort	computationally secure threshold secret sharing scheme with minimal redundancy
publisher	CEUR-WS
publishDate	2020
url	https://dspace.ncfu.ru/handle/20.500.12258/14119
work_keys_str_mv	AT babenkomg computationallysecurethresholdsecretsharingschemewithminimalredundancy AT babenkomg computationallysecurethresholdsecretsharingschemewithminimalredundancy AT golimblevskaiaei computationallysecurethresholdsecretsharingschemewithminimalredundancy AT golimblevskaâei computationallysecurethresholdsecretsharingschemewithminimalredundancy
_version_	1760599221162999809

Computationally secure threshold secret sharing scheme with minimal redundancy

Podobne knjige/članki