A pervasive secret sharing scheme for embedded visual communication system

Chul Ung Lee, Hyong Joong Kim, Jong Hyuk Park, Sang Soo Yeo, Jaesoo Yang

Research output: Contribution to journalArticle

Abstract

A simple secret sharing scheme for secure visual communications is pre-sented in this paper. Secret sharing schemes allow a group of participants at different lo-cations to share a secret (i.e., an image) among them by splitting it into n pieces ("shares" or "shadows"). In case of the (k, n) secret sharing scheme only a group of k qualified par-ticipants among n (where k = n) can reconstruct the secret. This paper presents an (n, n) secret sharing scheme. This scheme randomizes one share after another by executing XOR operations with random seeds derived from an initial seed. This scheme can also be used as an image encryption scheme. This scheme is resistant to collusion attacks.

Original languageEnglish
Pages (from-to)433-447
Number of pages15
JournalIntelligent Automation and Soft Computing
Volume16
Issue number3
Publication statusPublished - 2010 Nov 1

Fingerprint

Visual communication
Secret Sharing Scheme
Visual System
Cryptography
Communication Systems
Seed
Communication systems
Positive ions
Collusion Attack
Image Encryption
Secure communication

Keywords

  • Embedded System
  • Information Security
  • Pervasive Computing
  • Secret Shar-ing

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

A pervasive secret sharing scheme for embedded visual communication system. / Lee, Chul Ung; Kim, Hyong Joong; Park, Jong Hyuk; Yeo, Sang Soo; Yang, Jaesoo.

In: Intelligent Automation and Soft Computing, Vol. 16, No. 3, 01.11.2010, p. 433-447.

Research output: Contribution to journalArticle

@article{8c9a64d295b348b3ab96edc5c01df472,
title = "A pervasive secret sharing scheme for embedded visual communication system",
abstract = "A simple secret sharing scheme for secure visual communications is pre-sented in this paper. Secret sharing schemes allow a group of participants at different lo-cations to share a secret (i.e., an image) among them by splitting it into n pieces ({"}shares{"} or {"}shadows{"}). In case of the (k, n) secret sharing scheme only a group of k qualified par-ticipants among n (where k = n) can reconstruct the secret. This paper presents an (n, n) secret sharing scheme. This scheme randomizes one share after another by executing XOR operations with random seeds derived from an initial seed. This scheme can also be used as an image encryption scheme. This scheme is resistant to collusion attacks.",
keywords = "Embedded System, Information Security, Pervasive Computing, Secret Shar-ing",
author = "Lee, {Chul Ung} and Kim, {Hyong Joong} and Park, {Jong Hyuk} and Yeo, {Sang Soo} and Jaesoo Yang",
year = "2010",
month = "11",
day = "1",
language = "English",
volume = "16",
pages = "433--447",
journal = "Intelligent Automation and Soft Computing",
issn = "1079-8587",
publisher = "AutoSoft Press",
number = "3",

}

TY - JOUR

T1 - A pervasive secret sharing scheme for embedded visual communication system

AU - Lee, Chul Ung

AU - Kim, Hyong Joong

AU - Park, Jong Hyuk

AU - Yeo, Sang Soo

AU - Yang, Jaesoo

PY - 2010/11/1

Y1 - 2010/11/1

N2 - A simple secret sharing scheme for secure visual communications is pre-sented in this paper. Secret sharing schemes allow a group of participants at different lo-cations to share a secret (i.e., an image) among them by splitting it into n pieces ("shares" or "shadows"). In case of the (k, n) secret sharing scheme only a group of k qualified par-ticipants among n (where k = n) can reconstruct the secret. This paper presents an (n, n) secret sharing scheme. This scheme randomizes one share after another by executing XOR operations with random seeds derived from an initial seed. This scheme can also be used as an image encryption scheme. This scheme is resistant to collusion attacks.

AB - A simple secret sharing scheme for secure visual communications is pre-sented in this paper. Secret sharing schemes allow a group of participants at different lo-cations to share a secret (i.e., an image) among them by splitting it into n pieces ("shares" or "shadows"). In case of the (k, n) secret sharing scheme only a group of k qualified par-ticipants among n (where k = n) can reconstruct the secret. This paper presents an (n, n) secret sharing scheme. This scheme randomizes one share after another by executing XOR operations with random seeds derived from an initial seed. This scheme can also be used as an image encryption scheme. This scheme is resistant to collusion attacks.

KW - Embedded System

KW - Information Security

KW - Pervasive Computing

KW - Secret Shar-ing

UR - http://www.scopus.com/inward/record.url?scp=77958548249&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77958548249&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:77958548249

VL - 16

SP - 433

EP - 447

JO - Intelligent Automation and Soft Computing

JF - Intelligent Automation and Soft Computing

SN - 1079-8587

IS - 3

ER -