Secure verifiable secret short sharing scheme for multi-cloud storage
2018 International Conference on High Performance Computing …, 2018•ieeexplore.ieee.org
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 Asmuth-Bloom 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.
secret sharing scheme based on the simultaneous use of the Residue Number System
(RNS), as the symmetric encryption, and the perfect Asmuth-Bloom 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.
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 Asmuth- Bloom 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.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果