政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/75682

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113648/144635 (79%)
Visitors : 51615817 Online Users : 466

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大機構典藏 > 資訊學院 > 資訊科學系 > 期刊論文 > Item 140.119/75682

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/75682

Title:	A secret sharing scheme for EBTC using steganography
Authors:	Kim, C.;Shin, D.;Shin, D.;Tso, Ray-Lin;Yang, C.-N. 左瑞麟
Contributors:	資科系
Keywords:	Algorithms;Authentication;Steganography;Block truncation coding;DE;EBTC;Hamming code;Image compression techniques;Interpolation algorithms;Secret sharing;Secret sharing schemes;Image coding
Date:	2014-04
Issue Date:	2015-06-11 13:37:00 (UTC+8)
Abstract:	In this paper, a new method based on Block Truncation Coding (BTC) and the halftoning technique is proposed for secret sharing of lossy compressed images. BTC is a simple and efficient image compression technique. However, it yields images of undesirable quality, and significant blocking effects are seen as the block size that is used increases. A modified method known as Enhanced Block Truncation Coding (EBTC) is proposed to solve these problems. For secret sharing, we propose a (2, 2) secret sharing scheme which provides authentication using DE scheme. This scheme was developed for data hiding with grayscale images, but our proposed EBTC uses bitmap images for which the DE scheme is not appropriate. We show the solution for such a problem. Moreover, we reduce the computation complexity for secret sharing using the DE algorithm because past schemes which used polynomial or interpolation algorithms require too much time for secret sharing. In addition, we show how to authenticate a cover image. Experimental results show that our proposed scheme provides secret sharing with proper authentication and acceptable computational complexity. © 2012 Springer Science+Business Media, LLC.
Relation:	Journal of Intelligent Manufacturing, 25(2), 241-249
Data Type:	article
DOI 連結:	http://dx.doi.org/10.1007/s10845-012-0660-7
DOI:	10.1007/s10845-012-0660-7
Appears in Collections:	[資訊科學系] 期刊論文

Files in This Item:

File	Description	Size	Format
241-249.pdf		1651Kb	Adobe PDF2	707	View/Open

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

Loading...