An efficient Boolean based multi-secret image sharing scheme

Nag, Amitava; Singh, Jyoti; Singh, Amit Kumar

doi:10.1007/s11042-019-07807-7

Cited by 14 publications

(7 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, some properties of the XOR operation are briefly defined. 34,35 If A and B are binary numbers, the operation ⊕ satisfies the following conditions:…”

Section: Xor Propertiesmentioning

confidence: 99%

A new scheme for lossless meaningful visual secret sharing by using XOR properties

Latif

Mehrnahad

Ahmadabadi

2022

Preprint

View full text Add to dashboard Cite

In this paper, a new scheme for lossless meaningful visual secret sharing by using XOR properties is presented. In this method, the input secret image is converted into several share images and these shares are distributed among individuals. In the proposed method, noise-like share images are generated using properties of XOR and genetic algorithm. In the next step by using other properties of XOR, shares become meaningful. In recovery phase the input secret image is fully recoverd by an efficient XOR operation. The proposed method is evaluated using PSNR, MSE, BCR criteria and presents good results on different images with different number of shares compared with other methods. The exprimental results show that the quality of generated share images is satisfable too.

show abstract

“…In this section, some properties of the XOR operation are briefly defined. 34,35 If A and B are binary numbers, the operation ⊕ satisfies the following conditions:…”

Section: Xor Propertiesmentioning

confidence: 99%

A new scheme for lossless meaningful visual secret sharing by using XOR properties

Latif

Mehrnahad

Ahmadabadi

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…A simple multi-secret image share scheme has been proposed by Chattopadhyay et al [6] that uses a stable hash function and Boolean operations. Nag et al [32] have designing a framework for multi-secret image sharing based on XOR when t is not limited only to 2 or n. In order to generate r (where r is the number of qualify subgroups) they have used nalters of the same size as confidential image size to distribute images publicly using XOR operations. Alkhodaidi et al [3] also proposed a technique which adds the technique of image steganography to the counting-based secret-sharing method to obtain more relevant security.…”

Section: Related Workmentioning

confidence: 99%

“…The lower the amount of time, the better for a typical end-user. Because of the time needed for the CPU clock Ref [6] R e f [ 32] R e f [ 3] R e f [ Table 5 (continued)…”

Section: Encryption/ Decryption Timementioning

confidence: 99%

See 1 more Smart Citation

Tree parity machine guided patients’ privileged based secure sharing of electronic medical record: cybersecurity for telehealth during COVID-19

Sarkar

2021

Multimed Tools Appl

View full text Add to dashboard Cite

In the COVID-19 pandemic, telehealth plays a significant role in the e-healthcare. E-health security risks have also risen significantly with the rise in the use of telehealth. This paper addresses one of e-health's key concerns, namely security. Secret sharing is a cryptographic method to ensure reliable and secure access to information. To eliminate the constraint that in the existing secret sharing schemes, this paper presents Tree Parity Machine (TPM) guided patients' privileged based secure sharing. This is a new secret sharing technique that generates the shares using a simple mask based operation. This work considers addressing the challenges presents in the original secret sharing scheme. This proposed technique enhances the security of the existing scheme. This research introduces a concept of privileged share in which among k number of shares one share should come from a specific recipient (patient) to whom a special privilege is given to recreate the original information. In the absence of this privileged share, the original information cannot be reconstructed. This technique also offers TPM based exchange of secret shares to prevent Man-In-The-Middle-Attack (MITM). Here, two neural networks receive common inputs and exchange their outputs. In some steps, it leads to full synchronization by setting the discrete weights according to the specific rule of learning. This synchronized weight is used as a common secret session key for transmitting the secret shares. The proposed method has been found to produce attractive results that show that the scheme achieves a great degree of protection, reliability, and efficiency and also comparable to the existing secret sharing scheme.

show abstract

“…In addition to hierarchical schemes, many researchers have proposed various multi-secret image sharing schemes based on different technologies. For example, the Chinese remainder theorem [10], Boolean [27][28][29], and cellular automaton [30] have been proposed. In 2017, Yuan et al [31] first applied the adjustable threshold into secret image sharing, and they proposed the first adjustable-threshold secret image scheme.…”

Section: Related Workmentioning

confidence: 99%

A Novel Threshold Changeable Secret Image Sharing Scheme

Wang

et al. 2021

Symmetry

View full text Add to dashboard Cite

In secret image sharing, the image is divided into several stego images, which are managed by corresponding participants. The secret image can be recovered only when the number of authorized participants is no less than the threshold. Thus, it is widely used to protect essential images, such as engineering drawings and product design drawings. In the traditional secret image sharing scheme, the threshold is fixed and unique. However, in practice, the security policy and the adversarial structure may change; therefore, the threshold must be adjusted dynamically. In this paper, we propose a novel secret image sharing scheme with a changeable threshold capability. Our scheme eliminates the limit of the changeable threshold and reduces the computation required. Also, our scheme is the first threshold changeable secret image sharing scheme that can recover an undistorted cover image. The theoretical analysis shows that our scheme is safe even if the threshold is changed. The experiments demonstrated that the stego image generated by our algorithm has better quality than other changeable-threshold, secret image sharing algorithms.

show abstract

An efficient Boolean based multi-secret image sharing scheme

Cited by 14 publications

References 44 publications

A new scheme for lossless meaningful visual secret sharing by using XOR properties

A new scheme for lossless meaningful visual secret sharing by using XOR properties

Tree parity machine guided patients’ privileged based secure sharing of electronic medical record: cybersecurity for telehealth during COVID-19

A Novel Threshold Changeable Secret Image Sharing Scheme

Contact Info

Product

Resources

About