A Probabilistic Model of Visual Cryptography Scheme With Dynamic Group - 2012


The (t, n) visual cryptography (VC) is a secret sharing scheme where a secret image is encoded into n transparencies, and the stacking of any t out of n transparencies reveals the secret image. The stacking of t - 1 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 (t, n) VC scheme with unlimited n based on the probabilistic model. The proposed scheme allows n 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 (t, n) VC scheme, and then the (t, ∞) VC scheme achieving maximal contrast can be designed by using the derived equation. The maximal contrasts with t = 2 to 6 are explicitly solved in this paper.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : GPCA A Probabilistic Framework for Gaussian Process Embedded Channel Attention ABSTRACT: It is common practice to employ channel attention mechanisms in a variety of visual tasks in order to achieve effective
PROJECT TITLE : Data Dissemination in VANETs Using Clustering and Probabilistic Forwarding Based on Adaptive Jumping Multi-Objective Firefly Optimization ABSTRACT: The dissemination of data within a VANETs network calls for
PROJECT TITLE : Learning Compact Features for Human Activity Recognition Via Probabilistic First-Take-All ABSTRACT: With the rise in popularity of mobile sensor technologies, smart wearable devices provide a once-in-a-lifetime
PROJECT TITLE : A Spatially Constrained Probabilistic Model for Robust Image Segmentation ABSTRACT: In probabilistic model based segmentation, the hidden Markov random field (HMRF) is used to describe the class label distribution
PROJECT TITLE : Convex Relaxations of Probabilistic AC Optimal Power Flow for Interconnected AC and HVDC Grids ABSTRACT: Increased reliability, connection to offshore wind, and coupling of power markets are all benefits of

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry