The Research of Secret Image Sharing Based on RS Erasure Code
نویسندگان
چکیده
منابع مشابه
Secret Image Sharing based on Wavelet Transform
Visual cryptography is a secure technique enable distributing sensitive visual data to participant through public communication channels. In visual cryptography a secret image is cryptographically encrypted into some shares (transparencies) such that the generated secure shares do not reveal any information without they are not combined in prescribed way. The main challenges facing secure image...
متن کاملSecret Sharing Based On Cartesian product Of Graphs
The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...
متن کاملOn Secret Multiple Image Sharing
In traditional secret sharing schemes for general access structures, a secret can be encoded into n sets of (shadow, key)’s which are distributed to n participants one by one. Only those participants belonging to a pre-defined qualified subset can recover the shared secret by using their (shadow, key)’s. The size of (shadow, key)’s may be different for different participants. This problem exist...
متن کاملRandom Matrices Based Image Secret Sharing
This paper presents an image secret sharing method based on some random matrices that acts as a key for secret sharing. The technique allows a secret image to be divided into four image shares with each share individually looks meaningless. To reconstruct the secret image all four shares have to be used. Any subset m (1< m ≤ 4) shares cannot get sufficient information to reveal th e secret imag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2012
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2011.12.662