Increasing Participants Using Counting-Based Secret Sharing via Involving Matrices and Practical Steganography

Abstract

Secret sharing is an approach for accessing sensitive information by several authorized participants. It shares the secret key in different forms among several authorized participants, where a certain number of which is required to retrieve the original secret. This secret sharing raised a new practicality challenge of human secrecy memorization as well as limited number of users allowed, which have been addressed within this work. This paper examines two particular secret sharing techniques known as the counting-based secret sharing and the matrix-based secret sharing, which enhances the former to accommodate a high number of participants. This work aimed to serve participants accommodating the share's memorization challenge via image steganography as well as testing both schemes in the cases of original 1-bit and 2-bit methods. We compared practicality applying the secret sharing methods combined with two image steganography methods: the least significant bit and the discrete wavelet transform. Our findings included interesting remarks regarding both security and robustness. Our results demonstrated that despite the large number of shares generated, as to serve more participants using the matrix-based scheme, its performance was highly satisfactory. Our experiments illustrated high imperceptibility levels for the matrix-based scheme, which in turn provides higher security and robustness compared to the original method, which provided very few shares serving a limited number of participants.

Analysis of community question‐answering issues via machine learning and deep learning: State‐of‐the‐art review

“…It has been recently found that malicious users can disrupt the seamless functioning of CQAs. Identifying such users and developing ways to stop them also need immediate attention, not as reported for increasing number of participants adopting counting‐based secret sharing [191]. Besides topic modelling, the tag suggestion for a new question has attracted very limited research [192].…”

Novel Arabic e-Text Watermarking Supporting Partial Dishonesty Based on Counting-Based Secret Sharing

“…This is a benefit of using counting-based secret sharing, as principally discussed for image steganography optimization within [38]. The challenge in the extraction algorithm is that extraction can be from any part of the watermarked text [39], not always from the beginning [40], and it is not known where shares start and end in the watermarked text part [41]. A solution is to test all possibilities of the positions of shares.…”

Efficient computation of Hash Hirschberg protein alignment utilizing hyper threading multi‐core sharing technology

“…The main difference between them is the alphabet where DNA and RNA sequences are represented by four letters while protein sequences are represented by 20 letters [55]. This memory sharing strategy can benefit boost-up parallel sharing via counting-based secret-sharing [56] and its enhancement in matrices [57] as well as increasing shares [58], trustfulness hiding [59], and sharing regularity optimization [60]. The proposed method can be extended and generalized to cover genomic sequences since, computer-wise, all of them are represented as a string of letters.…”