Bishoy Kamal Sharobim

Secret Image Sharing (SIS) transfers an image to mutually suspicious receivers as n meaningless shares, where k or more shares must be present to recover the secret. This paper proposes a (k, n)-SIS system for any image type using polynomial interpolation based on Lagrange polynomials, where the generated shares are of size 1/k of the secret image size. A full encryption system, consisting of

Multi-Secret Image Sharing (MSIS) systems share multiple images to multiple participants in unintelligible forms that can be recovered using all the shares. This paper employs the concept of progressive secret sharing with MSIS to introduce a new system, where the number of used shares in the recovery process defines the quality of the recovered secrets. The proposed system works for any number of

This paper introduces a Multi-Visual Cryptography (MVC) system for sharing two color images, where the secrets can be revealed with low computation power using all the shares. The system uses the generalized Tent map as a source of randomness to generate any number of random shares. More specifically, (n-1) random shares are generated, and then, the nth share is calculated from the random shares

(n, n)-Visual Secret Sharing (VSS) allows a user to send an image in the form of shares to different participants. Every share can not reveal the secret alone, and only all shares together can reveal the secret with fast recovery. This paper proposes a pixel-based (n, n)-VSS system, where to share a pixel from the secret image, (n - 1) random pixels are generated from the Lorenz chaotic system for

Artificial Neural Networks (ANNs) are remarkably able to fit complex functions, making them useful in various applications and systems. This paper uses ANN to fit the Pehlivan–Uyaroglu Chaotic System (PUCS) to produce an Artificial Neural Network Chaotic Pseudo-Random Number Generator (ANNC-PRNG). The proposed PRNG imitates the PUCS chaotic system's properties and attractor shape. The proposed

Multi-Secret Image Sharing (MSIS) is important in information security when multiple images are shared in an unintelligible form to different participants, where the images can only be recovered using the shares from participants. This paper proposes a simple and efficient ( n,n )-MSIS system for colored images based on XOR and Chinese Remainder Theorem (CRT), where all the n share are required in

Multi-Secret Image Sharing (MSIS) is used when multiple images need to be shared to multiple participants, but the images can not be recovered without the presence of all shares. In this paper, a unified system for performing encryption and (n,n)-MSIS is proposed. While MSIS is based on the XOR operation, encryption combines the utilization of Chinese Remainder Theorem (CRT), SHA-256, and S-box

Nowadays, with the rapid growth in information, a fast and secure method is eagerly needed to share images. (n, n)-Visual Secret Sharing (VSS) is used to share a secret image into n shares, where the secret can only be recovered using all the n shares and the recovery must be fast with low computational complexity. This paper proposes a secured lossless (n, n)-VSS system based on Arnold transform