A pervasive secret sharing scheme for embedded visual communication system

Chul Ung Lee; Hyoung Joong Kim; Jong Hyuk Park; Sang Soo Yeo; Jaesoo Yang

doi:10.1080/10798587.2010.10643091

A pervasive secret sharing scheme for embedded visual communication system

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

Research output: Contribution to journal › Article › peer-review

Abstract

A simple secret sharing scheme for secure visual communications is presented in this paper. Secret sharing schemes allow a group of participants at different locations to share a secret (i.e., an image) among them by splitting it into n pieces (“shazes” or “shadows”. In case of the (k, n) secret shazing scheme only a group of k qualified participants among n (where k≤n) can reconstruct the secret. This paper presents an (n, n) secret sharing scheme. This scheme randomizes one shaze 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 language	English
Pages (from-to)	433-447
Number of pages	15
Journal	Intelligent Automation and Soft Computing
Volume	16
Issue number	3
DOIs	https://doi.org/10.1080/10798587.2010.10643091
Publication status	Published - 2010 Jan

Keywords

Embedded System
Information Security
Pervasive Computing
Secret Sharing

ASJC Scopus subject areas

Software
Theoretical Computer Science
Computational Theory and Mathematics
Artificial Intelligence

Access to Document

10.1080/10798587.2010.10643091

Fingerprint Dive into the research topics of 'A pervasive secret sharing scheme for embedded visual communication system'. Together they form a unique fingerprint.

Cite this

@article{8c9a64d295b348b3ab96edc5c01df472,

title = "A pervasive secret sharing scheme for embedded visual communication system",

abstract = "A simple secret sharing scheme for secure visual communications is presented in this paper. Secret sharing schemes allow a group of participants at different locations to share a secret (i.e., an image) among them by splitting it into n pieces (“shazes” or “shadows”. In case of the (k, n) secret shazing scheme only a group of k qualified participants among n (where k≤n) can reconstruct the secret. This paper presents an (n, n) secret sharing scheme. This scheme randomizes one shaze 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 Sharing",

author = "Lee, {Chul Ung} and Kim, {Hyoung Joong} and Park, {Jong Hyuk} and Yeo, {Sang Soo} and Jaesoo Yang",

year = "2010",

month = jan,

doi = "10.1080/10798587.2010.10643091",

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, Hyoung Joong

AU - Park, Jong Hyuk

AU - Yeo, Sang Soo

AU - Yang, Jaesoo

PY - 2010/1

Y1 - 2010/1

N2 - A simple secret sharing scheme for secure visual communications is presented in this paper. Secret sharing schemes allow a group of participants at different locations to share a secret (i.e., an image) among them by splitting it into n pieces (“shazes” or “shadows”. In case of the (k, n) secret shazing scheme only a group of k qualified participants among n (where k≤n) can reconstruct the secret. This paper presents an (n, n) secret sharing scheme. This scheme randomizes one shaze 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 presented in this paper. Secret sharing schemes allow a group of participants at different locations to share a secret (i.e., an image) among them by splitting it into n pieces (“shazes” or “shadows”. In case of the (k, n) secret shazing scheme only a group of k qualified participants among n (where k≤n) can reconstruct the secret. This paper presents an (n, n) secret sharing scheme. This scheme randomizes one shaze 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 Sharing

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

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

U2 - 10.1080/10798587.2010.10643091

DO - 10.1080/10798587.2010.10643091

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 -

A pervasive secret sharing scheme for embedded visual communication system

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this