research-article

A verifiable secret sharing scheme based on AMBTC

Authors:

Shin-Shian Wang,

Chia-Chen LinAuthors Info & Claims

ICUIMC '11: Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication

Article No.: 129, Pages 1 - 9

https://doi.org/10.1145/1968613.1968762

Published: 21 February 2011 Publication History

Abstract

In this paper, we combine absolute moment block truncation coding (AMBTC) and Shamir's secret sharing scheme to propose a verifiable secret sharing scheme. Shares construction is based on the compression codes generated by AMBTC; therefore, the shadow size is about one third of the original secret image. During the shares construction phase, the compression codes generated by AMBTC are first shuffled according to a watermark that is used to verify the authenticity of the reconstructed secret image during the revealing and verifying phase. Then the shuffled compression codes are used to generate the shadows by applying Shamir's scheme. To operate as a cheating prevention function without the need to transmit extra data, the hidden watermark can be a logo or a binary version of the secret image. Comparisons confirm that our proposed scheme offers relatively low computational complexity and smaller shadows than can be achieved with existing schemes offering a cheating prevention function.

References

[1]

R. Ahlswede, and I. Csiszar, "Common Randomness in Information Theory and Cryptography-Part I: Secret Sharing," IEEE Transactions on Information Theory, Vol. 39, No. 4, pp. 1121--1132, 1993.

Digital Library

[2]

A. Adhikari, and S. Sikdar, "A New (2, n)-Visual Threshold Scheme for Color Images," INDOCRYPT2003, Lecture Notes in Computer Science, Vol. 2904, pp. 148--161, 2003.

[3]

G. R. Blakley, "Safeguarding Cryptographic Keys," AFIPS, Proceedings of the National Computer Conference, pp. 313--317, 1979.

[4]

A. Beimel, and B. Chor, "Universally Ideal Secret-Sharing Schemes," IEEE Transaction on Information Theory, Vol. 40, Issue. 3, pp. 786--794, 1994.

Digital Library

[5]

C. Blude, A. De Santis, and M. Naor, "Visual Cryptography for Grey Level Images," Information Processing Letters, Vol. 75, Issue. 6, pp. 255--259, 2000.

Digital Library

[6]

L. Bai, "A Reliable (k, n) Image Secret Sharing Scheme," Proceedings of the 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing (DASC'06), 2006.

Digital Library

[7]

T. S. Chen, C. C. Chang, and M. S. Hwang, "A Virtual Image Cryptosystem Based on Vector Quantization," IEEE Transactions on Image Processing, Vol. 7, Issue. 10, pp. 1485--1488, 1997.

Digital Library

[8]

C. C. Chang, and M. N. Wu, "An Algorithm for Color Image Compression Base on Common Bit Map Block Truncation Coding," Proceedings of Joint Conference on Information Sciences, pp. 964--967, 2002.

[9]

C. C. Chang, C. C. Lin, C. S. Tseng, and W. L. Tai, "Reversible Hiding in DCT-based Compressed Images," Information Sciences, Vol. 177, Issue. 13, pp. 2768--2786, 2007.

Digital Library

[10]

Y. F. Chen, Y. K. Chan, C. C. Huang, M. H. Tsai, and Y. P. Chu, "A Multiple-Level Visual Secret-Sharing Scheme without Image Size Expansion," Information Sciences, Vol. 177, Issue. 21, pp. 4696--4710, 2007.

Digital Library

[11]

C. C. Chang, Y. P. Hsieh, and C. H. Lin, "Sharing Secrets in Stego Images with Authentication," Pattern Recognition, Vol. 41, Issue. 10, pp. 3130--3137, 2008.

Digital Library

[12]

C. C. Chang, C. C. Lin, T. H. N. Le, and H. B. Le, "Sharing a Verifiable Secret Image Using Two Shadows," Pattern Recognition, Vol. 42, Issue. 11, pp. 3097--3114, 2009.

Digital Library

[13]

W. Diffie, and M. E. Hellman, "New Directions in Cryptography," IEEE Transactions on Information Theory, Vol. 22, No. 6, pp. 644--654, 1976.

Digital Library

[14]

W. Diffie, and M. E. Hellman, "Privacy and Authentication: An Introduction to Cryptography," Proceedings of the IEEE, Vol. 67, Issue. 3, pp. 397--427, 1979.

[15]

E. J. Delp, and O. R. Mitchell, "Image Compression Using Block Truncation Coding," IEEE Transactions on Communications, Vol. 27, Issue. 9, pp. 1335--1342, 1979.

[16]

R. M. Gray, "Vector Quantization," IEEE ASSP Magazine, Vol. 1, Issue. 2, pp. 4--29, 1984.

[17]

G. Horng, T. Chen, and D. Tasi, "Cheating in Visual Cryptography," Designs, Codes and Cryptography, Vol. 38, No. 2, pp. 219--236, 2006.

Digital Library

[18]

R. Ito, H. Kuwakado, and H. Tanaka, "Image Size Invariant Visual Cryptography," IEICE Transactions on Fundamentals, Vol. E82-A, No. 10, pp. 2172--2177, 1999.

[19]

N. F. Johnson, and S. Jajodia, "Exploring Steganography: Seeing the Unseen," IEEE Computer, Vol. 31, No. 2, pp. 26--34, 1998.

Digital Library

[20]

K. Kaya, and A. A. Selcuk, "Threshold Cryptography Based on Asmuth-Bloom Secret Sharing," Information Sciences, Vol. 177, Issue. 19, pp. 4148--4160, 2007.

Digital Library

[21]

M. D. Lema, and O. R. Mitchell, "Absolute Moment Block Truncation Coding and Its Application to Color Images," IEEE Transactions on Communications, Vol. 32, Issue. 10, pp. 1148--1157, 1984.

[22]

C. C. Lin, and P. F. Shiu, "Reversible Data Hiding Scheme with High Payload for JPEG Images," ICUIMC 2009, pp. 327--335, 2009.

Digital Library

[23]

L. M. Marvel, C. G. Boncelet, Jr., and C. T. Retter, "Spread Spectrum Image Steganography," IEEE Transactions on Image Processing, Vol. 8, Issue. 8, pp. 1075--1083, 1999.

Digital Library

[24]

M. Naor, and A. Shamir, "Visual Cryptography," Advances in Cryptology- Eurocrypt'94: Lecture Notes in Computer Science, Vol. 950, pp. 1--12, 1995.

[25]

R. D. Prisco, and A. D. Santis, "Cheating Immune (2, n)-Threshold Visual Secret Sharing," Proceedings of Security and Cryptography for Networks, Vol. 4116, pp. 216--228, 2006.

Digital Library

[26]

R. L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Communications of the ACM, Vol. 21, Issue. 2, pp. 120--126, 1978.

Digital Library

[27]

A. Shamir, "How to Share a Secret," Communications of the ACM, Vol. 22, Issue. 11, pp. 612--613, 1979.

Digital Library

[28]

D. R. Stinson, "Decomposition Constructions for Secret-Sharing Schemes," IEEE Transactions Information Theory, Vol. 40, Issue. 1, pp. 118--124, 1994.

Digital Library

[29]

S. J. Shyu, "Efficient Visual Secret Sharing Scheme for Color Images," Pattern Recognition, Vol. 39, Issue. 5, pp. 866--880, 2006.

Digital Library

[30]

C. C. Thien, and J. C. Lin, "Secret Image Sharing," Computers &amp; Graphics, Vol. 26, Issue. 5, pp. 765--770, 2002.

[31]

C. N. Yang, T. S. Chen, K. H. Yu, and C. C. Wang, "Improvements of Image Sharing with Steganography and Authentication," Journal of Systems and Software, Vol. 80, Issue. 7, pp. 1070--1076, 2007.

Digital Library

[32]

R. Zhao, J. J. Zhao, F. Dai, and F. Q. Zhao, "A New Image Secret Sharing Scheme to Identify Cheaters," Computer Standards and Interfaces, Vol. 31, Issue. 1, pp. 252--257, 2009.

Digital Library

Cited By

Cheng TChang CLiu L(2017)Secret sharingMultimedia Tools and Applications10.1007/s11042-016-3535-776:7(9337-9362)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1007/s11042-016-3535-7
Junlan Bai Ching-Chun Chang (2015)An optimized secret sharing scheme using Hungarian algorithm2015 IEEE 16th International Conference on Communication Technology (ICCT)10.1109/ICCT.2015.7399853(334-338)Online publication date: Oct-2015
https://doi.org/10.1109/ICCT.2015.7399853
Ou DWu XDai LSun W(2014)Secret Sharing in Images Based on Error-Diffused Block Truncation Coding and Error DiffusionDigital-Forensics and Watermarking10.1007/978-3-662-43886-2_9(123-138)Online publication date: 9-Jul-2014
https://doi.org/10.1007/978-3-662-43886-2_9
Show More Cited By

Index Terms

A verifiable secret sharing scheme based on AMBTC
1. Information systems
  1. Data management systems

Recommendations

A novel reversible data hiding scheme based on AMBTC compression technique

Data hiding encompasses a wide range of applications for embedding messages in content. However, hiding data inevitably destroys the host image, even though the distortion is imperceptible. To enhance the hiding capacity and maintain the quality of the ...
Strong (n,t,n) verifiable secret sharing scheme

A (t,n) secret sharing divides a secret into n shares in such a way that any t or more than t shares can reconstruct the secret; but fewer than t shares cannot reconstruct the secret. In this paper, we extend the idea of a (t,n) secret sharing scheme ...
A (2, 2) secret sharing scheme based on hamming code and AMBTC
ACIIDS'12: Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II

We present a secret sharing scheme based on absolute moment block truncation coding (AMBTC) and Hamming code theory. AMBTC is composed of bit planes and two representative gray level pixel values, which are the high and low range means. In this secret ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

ICUIMC '11: Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication

February 2011

959 pages

ISBN:9781450305716

DOI:10.1145/1968613

General Chairs:
Suk-Han Lee
Sungkyunkwan University, Korea
,
Lajos Hanzo
University of Southampton
,
Program Chairs:
Min Young Chung
Sungkyunkwan University, Korea
,
Sang-Won Lee
Sungkyunkwan University, Korea
,
Kwangsu Cho
University of Missouri

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SKKU: SUNGKYUNKWAN UNIVERSITY

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 February 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

ROC Grant

Conference

ICUIMC '11

Sponsor:

ICUIMC '11: The 5th International Conference on Ubiquitous Information Management and Communication

February 21 - 23, 2011

Seoul, Korea

Acceptance Rates

ICUIMC '11 Paper Acceptance Rate 135 of 534 submissions, 25%;

Overall Acceptance Rate 251 of 941 submissions, 27%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
243
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Cheng TChang CLiu L(2017)Secret sharingMultimedia Tools and Applications10.1007/s11042-016-3535-776:7(9337-9362)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1007/s11042-016-3535-7
Junlan Bai Ching-Chun Chang (2015)An optimized secret sharing scheme using Hungarian algorithm2015 IEEE 16th International Conference on Communication Technology (ICCT)10.1109/ICCT.2015.7399853(334-338)Online publication date: Oct-2015
https://doi.org/10.1109/ICCT.2015.7399853
Ou DWu XDai LSun W(2014)Secret Sharing in Images Based on Error-Diffused Block Truncation Coding and Error DiffusionDigital-Forensics and Watermarking10.1007/978-3-662-43886-2_9(123-138)Online publication date: 9-Jul-2014
https://doi.org/10.1007/978-3-662-43886-2_9
Kim CShin DShin DYang C(2012)A (2, 2) secret sharing scheme based on hamming code and AMBTCProceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II10.1007/978-3-642-28490-8_14(129-139)Online publication date: 19-Mar-2012
https://dl.acm.org/doi/10.1007/978-3-642-28490-8_14

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten