Project Login
Registration No:
Password:
MAIL ALERTS SMS ALERTS
 
     
   
     

A PROBABILISTIC MODEL OF (T, N) VISUAL CRYPTOGRAPHY SCHEME WITH DYNAMIC GROUP

Platform : DOT NET

IEEE Projects Years : 2012 - 13

A PROBABILISTIC MODEL OF (T, N) VISUAL CRYPTOGRAPHY

SCHEME WITH DYNAMIC GROUP

ABSTRACT:

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 out of 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) changing 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.



NOW GET PROJECTS ! GET TRAINED ! GET PLACED !

IEEE, NON-IEEE, REAL TIME LIVE ACADEMIC PROJECTS,

PROJECTS WITH COMPLETE COURSES,SOFT SKILLS & PLACEMENTS

ALLOVER INDIA & WORLD WIDE,

HOSTEL FACILITY AVAILABLE FOR GIRLS & BOYS SEPARATELY,

CALL: 08985129129 ,  E-Mail Id: support@ascentit.in

REGISTER FOR PROJECTS NOW ! GET DISCOUNT
   
1