38,094 research outputs found

    The Visual Secret Sharing Scheme Based on the Rgb Color System

    Full text link
    The visual secret sharing (VSS) scheme is a method to maintain the confidentiality of a se-cret image by sharing it to some number participants. A (k, n) VSS divides the secret images into n parts, that are called shadows ; to recover the secret back, k shadows should be stacked. Some methods have been developed to implement VSS for color images. However, the methods are only suitable for images with limited number of colors. When more colors are used, the resulted stacked shadow image becomes unclear. Besides that, the size of the shadows becomes bigger as more colors are used. We develop a new method implementing the VSS using the RGB color system. Using our method, the problem related to the unclear stacked shadow image can be overcome

    A generalization of the Mignotte's scheme over Euclidean domains and applications to secret image sharing

    Get PDF
    Secret sharing scheme is an efficient method to hide secret key or secret image by partitioning it into parts such that some predetermined subsets of partitions can recover the secret but remaining subsets cannot. In 1979, the pioneer construction on this area was given by Shamir and Blakley independently. After these initial studies, Asmuth-Bloom and Mignotte have proposed a different (k,n)(k,n) threshold modular secret sharing scheme by using the Chinese remainder theorem. In this study, we explore the generalization of Mignotte's scheme to Euclidean domains for which we obtain some promising results. Next, we propose new algorithms to construct threshold secret image sharing schemes by using Mignotte's scheme over polynomial rings. Finally, we compare our proposed scheme to the existing ones and we show that this new method is more efficient and it has higher security

    A review on medicinal properties of saffron toward major diseases

    Get PDF
    The stigma of Crocus sativus, known as saffron, is one of the most expensive spices in the world. The bioactive components in saffron, picrocrocin, crocin, and safranal, have demonstrated a wide range of uses and capabilities in the medical field. This review is focused on the potential therapeutic applications of saffron on diabetes mellitus (DM), antitumor, anticancer, anti-depressant, Alzheimer’s disease (AD), cardiovascular disease (CVD), erectile dysfunction and antibacterial effects

    A new (k,n) verifiable secret image sharing scheme (VSISS)

    Get PDF
    AbstractIn this paper, a new (k,n) verifiable secret image sharing scheme (VSISS) is proposed in which third order LFSR (linear-feedback shift register)-based public key cryptosystem is applied for the cheating prevention and preview before decryption. In the proposed scheme the secret image is first partitioned into several non-overlapping blocks of k pixels. Every k pixel is then used to form m=⌈k/4⌉+1 pixels of one encrypted share. The original secret image can be reconstructed by gathering any k or more encrypted shared images. The experimental results show that the proposed VSISS is an efficient and safe method

    THE VISUAL SECRET SHARING SCHEME BASED ON THE RGB COLOR SYSTEM

    Get PDF
    The visual secret sharing (VSS) scheme is a method to maintain the confidentiality of a se-cret image by sharing it to some number participants. A (k, n) VSS divides the secret images into n parts, that are called shadows ; to recover the secret back, k shadows should be stacked. Some methods have been developed to implement VSS for color images. However, the methods are only suitable for images with limited number of colors. When more colors are used, the resulted stacked shadow image becomes unclear. Besides that, the size of the shadows becomes bigger as more colors are used. We develop a new method implementing the VSS using the RGB color system. Using our method, the problem related to the unclear stacked shadow image can be overcome

    The Research of Secret Image Sharing Based on RS Erasure Code

    Get PDF
    AbstractSecret image sharing is an attractive research problem in information security filed. After more than ten years of development, secret image sharing has become a relatively independent area. Most current secret image sharing scheme used Lagrange interpolation of Shamir scheme as the core idea, but which way will greatly reduce the computational efficiency and system availability without a doubt because of a huge amount of data in images. According to the internal relationship between coding theory and secret sharing technology, the paper proposed a secret image scheme based on coding theory. In addition to have advantages which most secret image sharing schemes based on Lagrange interpolation own, the new method which has a more simple idea reduced computational complexity and easy to extend the field of video and audio, so has a more obvious practical value; The design and realization of the new secret image sharing scheme has indirectly proved the internal relationship between coding and secret sharing scheme

    Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual Cryptography for Security of Handwritten Images

    Get PDF
    The secret sharing is a method to protect confidentiality and integrity of the secret messages by distributing the message shares into several recipients. The secret message could not be revealed unless the recipients exchange and collect shares to reconstruct the actual message. Even though the attacker obtain shares shadow during the share exchange, it would be impossible for the attacker to understand the correct share. There are few algorithms have been developed for secret sharing, e.g. secret splitting, Asmuth-Bloom secret sharing protocol, visual cryptography, etc. There is an unanswered question in this research about which method provides best level of security and efficiency in securing message. In this paper, we evaluate the performance of three methods, i.e. secret splitting, secret sharing, and recursive threshold visual cryptography for handwritten image security in terms of execution time and mean squared error (MSE) simulation. Simulation results show the secret splitting algorithm produces the shortest time of execution. On the other hand, the MSE simulation result that the three methods can reconstruct the original image very well
    corecore