An innocuous visual cryptography scheme

Hyong Joong Kim, Vasiliy Sachnev, Su Jeong Choi, Shijun Xiang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

An innocuous visual secret sharing scheme over natural images is presented in this paper. Secret sharing scheme allows a group of participants to share a secret (i.e., an image) among them. In case of(k, n) visual cryptography any group of k qualified participants among n (where k ≤ n) can reconstruct the secret. This paper presents (n, n) visual cryptography scheme. This scheme does not apply dithering techniques to hide a secret image. Thus, it does not degrade quality of the secret image and in particular, this scheme is far from negative photo effect. Instead of dithering, this scheme spreads data by applying simple arithmetic operations. The rationale of arithmetic operations is presented.

Original languageEnglish
Title of host publication8th International Workshop on Image Analysis for Multimedia Interactive Services, WIAMIS 2007
DOIs
Publication statusPublished - 2007 Dec 1
Event8th International Workshop on Image Analysis for Multimedia Interactive Services, WIAMIS 2007 - Santorini, Greece
Duration: 2007 Jun 62007 Jun 8

Other

Other8th International Workshop on Image Analysis for Multimedia Interactive Services, WIAMIS 2007
CountryGreece
CitySantorini
Period07/6/607/6/8

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Computer Networks and Communications
  • Signal Processing

Fingerprint Dive into the research topics of 'An innocuous visual cryptography scheme'. Together they form a unique fingerprint.

  • Cite this

    Kim, H. J., Sachnev, V., Choi, S. J., & Xiang, S. (2007). An innocuous visual cryptography scheme. In 8th International Workshop on Image Analysis for Multimedia Interactive Services, WIAMIS 2007 [4279173] https://doi.org/10.1109/WIAMIS.2007.19