Thursday, December 27, 2012
2
IEEE Dot Net Project - A Probabilistic Model of (t,n) Visual Cryptography Scheme With Dynamic Group
A
Probabilistic Model of (t,n) Visual Cryptography Scheme With Dynamic Group
ABSTRACT:
The
visual cryptography (VC) is a secret sharing scheme where a secret image is
encoded into transparencies, and the stacking of any out of transparencies
reveals the secret image. The stacking of or fewer transparencies is unable to
extract any information about the secret. We discuss the additions and
deletions of users in a dynamic user group. To reduce the overhead of
generating and distributing transparencies in user changes, this paper proposes
a VC scheme with unlimited based on the probabilistic model. The proposed
scheme allows to change dynamically in order to include new transparencies without
regenerating and redistributing the original transparencies. Specifically, an
extended VC scheme based on basis matrices and a probabilistic model is
proposed. An equation is derived from the fundamental definitions of the VC
scheme, and then the VC scheme achieving maximal contrast can be designed by
using the derived equation. The maximal contrasts with to are explicitly solved
in this paper.
ARCHITECTURE:
 |
EXISTING SYSTEM:
In
visual cryptography, the decoding process is performed directly by the human
eyes; while in existing, the shared images need some processing to reconstruct
the secret image. The increasing numbers of possibilities to create, publishes,
and distribute images calls for novel protection methods, new sharing and
access control mechanisms for the information contained in the published
images. Secure image sharing techniques overcome the traditional cryptographic
approach, providing new solutions for the development of new and secure imaging
applications.
PROPOSED SYSTEM:
We
have proposed a (t, n) VC scheme with flexible value of (n). From the practical
perspective, the proposed scheme accommodates the dynamic changes of users
without regenerating and redistributing the transparencies, which reduces
computation and communication resources required in managing the dynamically
changing user group. From the theoretical perspective, the scheme can be
considered as the probabilistic model of (t, n) VC with unlimited. Initially,
the proposed scheme is based on basis matrices, but the basis matrices
with infinite size cannot be
constructed practically. Therefore, the probabilistic model is adopted in the
scheme.
MODULES:
1. Login
modules.
2. Matrices
(Black and White) Method.
3.
VC Scheme Method.
4.
Encoding Algorithm Method.
MODULE DESCRIPTION:
Login modules.
Login or logon (also called logging in
or on and signing in or on) is the process by which individual access to a
computer system is controlled by identification of the user using credentials
provided by the user.
A user can log in to a system tovyfvs
and can then log out or log off (perform a logout / logoff) when the access is
no longer needed.
Logging out may be done explicitly by
the user performing some action, such as entering the appropriate command, or
clicking a website link labeled as such. It can also be done implicitly, such
as by powering the machine off, closing a web browser window, leaving a
website, or not refreshing a webpage within a defined period.
Matrices (Black and White) Method.
The
basis matrices of VC scheme were first introduced, a white-and-black secret
image or pixel is also described as a binary image or pixel. In the basis
matrices, to encode a binary secret image, each secret pixel white black will
be turned into blocks at the corresponding position of transparencies,
respectively. Each block consists of subpixels and each subpixel is opaque or
transparent. Throughout this paper, we use 0 to indicate a transparent subpixel
and 1 to indicate an opaque subpixel. If any two subpixels are stacked with
matching positions, the representation of a stacked pixel may be transparent,
when the two corresponding pixels are both transparent.
VC Scheme Method.
Proposed
method is based on the basis matrices and the idea of probabilistic model. For
a (t, n) VC scheme, the “totally symmetric” form of (B0)and(B1) are both
constructed and described as H0 and H1, respectively.
VC
scheme with flexible value of (n). From the practical perspective, the proposed
scheme accommodates the dynamic changes of users without regenerating and
redistributing the transparencies, which reduces computation and communication
resources required in managing the dynamically changing user group.
Encoding Algorithm Method.
For
a given value of (t), the transparencies can be continuously generated with the
OptPrVC scheme. However, practical applications require the algorithm to
terminate within finite steps. To meet the requirement, a finite number is used
to specify the number of transparencies in the algorithm.
HARDWARE REQUIREMENTS
·
Processor : Any Processor above 500 MHz.
·
Ram : 128Mb.
·
Hard Disk : 10 GB.
·
Compact Disk : 650 Mb.
·
Input device : Standard Keyboard and Mouse.
·
Output device : VGA and High Resolution Monitor
SOFTWARE
REQUIREMENTS
·
Operating System
: Windows XP.
·
Coding Language :
Visual C# .Net
REFERENCE:
Sian-Jheng Lin and Wei-Ho Chung, Member, IEEE, “A Probabilistic
Model of (t,n) Visual Cryptography Scheme With Dynamic Group”, IEEE TRANSACTIONS ON INFORMATION FORENSICS
AND SECURITY, VOL. 7, NO. 1, FEBRUARY 2012.
Subscribe to:
Post Comments (Atom)
2 Responses to “IEEE Dot Net Project - A Probabilistic Model of (t,n) Visual Cryptography Scheme With Dynamic Group”
April 10, 2015 at 11:13 PM
can anyone get me the code for A_Probabilistic_Model_of_(t,n)_VC scheme
November 22, 2022 at 7:46 PM
Grosvenor presents a €30 deposit bonus for a minimum deposit of €20 model spanking new|for model new} gamers. This lively bonus has a wagering requirement of five instances, which doesn't 카지노 apply to every recreation. If you benefit of|benefit from|reap the advantages of} Grosvenor’s welcome bonus, evaluation the list of video games excluded from this promotion. Whether you’re new to online playing sites or need to find a better slot or live recreation selection, MagicRed might present the variety you seek.
Post a Comment