Please use this identifier to cite or link to this item:
https://idr.l3.nitk.ac.in/jspui/handle/123456789/6833
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kumar, S. | |
dc.contributor.author | Jaipal, P.B.J. | |
dc.contributor.author | Sen, Gupta, S. | |
dc.contributor.author | Ungrapalli, V.R. | |
dc.date.accessioned | 2020-03-30T09:46:13Z | - |
dc.date.available | 2020-03-30T09:46:13Z | - |
dc.date.issued | 2013 | |
dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, Vol.8303 LNCS, , pp.199-213 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/6833 | - |
dc.description.abstract | In this paper, we study the problem of traitor-traceable key pre-distribution for general access structures. We propose a new scheme for key pre-distribution using visual secret sharing, where the keys are generated based on certain combinatorial block designs. Our scheme naturally extends for general access structures, and provides a flexible many-to-one function using visual secret sharing concepts to efficiently avoid the problem of pixel expansion. In addition, our proposal accommodates a simple traitor-tracing functionality for video broadcast applications; using efficient PBIBD based combinatorial constructs and visual secret sharing based on random grids. In effect, our scheme provides a novel technique for secure video and image broadcast, using general access structures to reduce collusions, trace forgery, and identify traitors in case there is a collusion. We duly analyze and discuss the efficiency of our scheme for varying number of users in the broadcast network. � 2013 Springer-Verlag. | en_US |
dc.title | Traitor-traceable key pre-distribution based on visual secret sharing | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.