Unordered Multisecret Sharing Based on Generalized Chinese Remainder Theorem

Multisecret sharing schemes have been widely used in the area of information security, such as cloud storage, group authentication, and secure parallel communications. One of the issues for these schemes is to share and recover multisecret from their shareholders. However, the existing works consider the recovery of multisecret only when the correspondences between the secrets and their shares are definite. In this paper, we propose a multisecret sharing scheme to share and recover two secrets among the participants based on the generalized Chinese Remainder Theorem (GCRT), where the multisecret and their shares are unordered. To overcome the leakage of information, we propose an improved scheme including the improved sharing phase and the recovery phase. The improved scheme has not only a more secure performance but also a lower computation complexity. The conditions for recovery failure and success are also explored.

Download Full-text

Robust Secret Image Sharing Resistant to Noise in Shares

ACM Transactions on Multimedia Computing Communications and Applications ◽

10.1145/3419750 ◽

2021 ◽

Vol 17 (1) ◽

pp. 1-22

Author(s):

Xuehu Yan ◽

Lintao Liu ◽

Longlong Li ◽

Yuliang Lu

Keyword(s):

Chinese Remainder Theorem ◽

Recovery Phase ◽

Error Correcting Codes ◽

Secret Image Sharing ◽

Data Loss ◽

Least Significant Bit ◽

Recovery Method ◽

Secret Image ◽

Image Sharing ◽

Salt And Pepper

A secret image is split into shares in the generation phase of secret image sharing (SIS) for a threshold. In the recovery phase, the secret image is recovered when any or more shares are collected, and each collected share is generally assumed to be lossless in conventional SIS during storage and transmission. However, noise will arise during real-world storage and transmission; thus, shares will experience data loss, which will also lead to data loss in the secret image being recovered. Secret image recovery in the case of lossy shares is an important issue that must be addressed in practice, which is the overall subject of this article. An SIS scheme that can recover the secret image from lossy shares is proposed in this article. First, robust SIS and its definition are introduced. Next, a robust SIS scheme for a threshold without pixel expansion is proposed based on the Chinese remainder theorem (CRT) and error-correcting codes (ECC). By screening the random numbers, the share generation phase of the proposed robust SIS is designed to implement the error correction capability without increasing the share size. Particularly in the case of collecting noisy shares, our recovery method is to some degree robust to some noise types, such as least significant bit (LSB) noise, JPEG compression, and salt-and-pepper noise. A theoretical proof is presented, and experimental results are examined to evaluate the effectiveness of our proposed method.

Download Full-text

A generalized Chinese remainder theorem-based proactive multi-secret sharing scheme for global wide area network

Telecommunication Systems ◽

10.1007/s11235-021-00791-0 ◽

2021 ◽

Author(s):

Xiaoping Li ◽

Ching-Chun Chang ◽

Yanjun Liu

Keyword(s):

Secret Sharing ◽

Chinese Remainder Theorem ◽

Wide Area ◽

Area Network ◽

Secret Sharing Scheme ◽

Wide Area Network ◽

Sharing Scheme ◽

Multi Secret Sharing

Download Full-text

Secure Data Access and Sharing Scheme for Cloud Storage

Wireless Personal Communications ◽

10.1007/s11277-016-3742-6 ◽

2016 ◽

Vol 96 (4) ◽

pp. 5295-5314 ◽

Cited By ~ 8

Author(s):

Xiong Li ◽

Saru Kumari ◽

Jian Shen ◽

Fan Wu ◽

Caisen Chen ◽

...

Keyword(s):

Cloud Storage ◽

Data Access ◽

Sharing Scheme ◽

Secure Data

Download Full-text

Secure Verifiable Secret Short Sharing Scheme for Multi-Cloud Storage

2018 International Conference on High Performance Computing & Simulation (HPCS) ◽

10.1109/hpcs.2018.00114 ◽

2018 ◽

Cited By ~ 2

Author(s):

Maxim Deryabin ◽

Nikolay Chervyakov ◽

Andrei Tchernykh ◽

Mikhail Babenko ◽

Nikolay Kucherov ◽

...

Keyword(s):

Cloud Storage ◽

Sharing Scheme ◽

Multi Cloud

Download Full-text

AES Cryptograph for Secure Cloud Storage

International Journal of Engineering and Advanced Technology - Regular Issue ◽

10.35940/ijeat.f1243.0986s319 ◽

2019 ◽

Vol 8 (6S3) ◽

pp. 1373-1376

Keyword(s):

Cloud Computing ◽

Information Security ◽

Cloud Storage ◽

Short Message Service ◽

Short Message ◽

Security And Protection ◽

Message Service ◽

Secure Cloud Storage ◽

Cloud Condition

In cloud computing disseminated assets are shared by means of system in open condition. Subsequently client can without much of a stretch access their information from anyplace. Simultaneously exist protection and security problems because of numerous causes. Initial one is emotional improvement in system advances. Another is expanded interest for computing assets, which make numerous associations to reappropriate their information stockpiling. So there is a requirement for secure cloud stockpiling administration in open cloud condition where the supplier isn't a confided in one. Our research tends to various information security and protection assurance problems in a cloud computing condition and suggests a technique for giving diverse security administrations like validation, approval and classification alongside checking in postponement. 128 piece Advanced Cryptograph Standard (AES) is utilized to increment information security and classification. In this supported methodology information is encoded utilizing AES and afterward transferred on a cloud. The supported model uses Short Message Service (SMS) ready instrument with keeping away from unapproved access to client information.

Download Full-text