Skip to main navigation Skip to search Skip to main content

Equivalence proof of two (2, n) progressive visual secret sharing

  • School of Computer Science and Technology, Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Apart from traditional visual secret sharing (VSS), progressive visual secret sharing (PVSS) can gain clearer recovered secret image with more shares. In the literature, Hou and Quan [Hou, Y. C., Quan, Z. Y.: Progressive visual cryptography with unexpanded shares. IEEE Trans. on Circ. and Sys. for Video Tech. 21(11), Pages 1760-1764(2011)], and Chen et al. [Chen, T.-H., et al., Quality-adaptive visual secret sharing by random grids. J. Syst. Software, Volume 86, Issue 5, May 2013, Pages 1267-1274(2013)] proposed two PVSS schemes, respectively, that solved the pixel expansion and poor visual quality problems of previous PVSS. In this paper, we show that the two means are equal in terms of their ideas, security and visual quality.

Original languageEnglish
Title of host publicationProceedings - 2014 10th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2014
EditorsJunzo Watada, Akinori Ito, Jeng-Shyang Pan, Han-Chieh Chao, Chien-Ming Chen
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages223-226
Number of pages4
ISBN (Electronic)9781479953905
DOIs
StatePublished - 24 Dec 2014
Externally publishedYes
Event10th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2014 - Kitakyushu, Japan
Duration: 27 Aug 201429 Aug 2014

Publication series

NameProceedings - 2014 10th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2014

Conference

Conference10th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2014
Country/TerritoryJapan
CityKitakyushu
Period27/08/1429/08/14

Keywords

  • Progressive visual secret sharing
  • Random grid
  • Visual cryptography
  • Visual secret sharing

Fingerprint

Dive into the research topics of 'Equivalence proof of two (2, n) progressive visual secret sharing'. Together they form a unique fingerprint.

Cite this