Аннотация:—In this paper, we propose a new approach to the
construction of computationally secure secret sharing scheme
based on the simultaneous use of the Residue Number System
(RNS), as the symmetric encryption, and the perfect AsmuthBloom
secret sharing scheme. We combine the useful features of
Redundant RNS to design space efficient secret sharing scheme
with enough level of security and to control of data integrity. This
combination provides verifiability and achieves a high speed of
data processing.