淡江大學覺生紀念圖書館 (TKU Library)
進階搜尋


下載電子全文限經由淡江IP使用) 
系統識別號 U0002-1808202017511300
中文論文名稱 多人影像之隱私保護研究
英文論文名稱 A Study of Privacy Protection on Multi-person Image
校院名稱 淡江大學
系所名稱(中) 資訊工程學系碩士班
系所名稱(英) Department of Computer Science and Information Engineering
學年度 108
學期 2
出版年 109
研究生中文姓名 呂易翰
研究生英文姓名 Yi-Han Lyu
學號 607410114
學位類別 碩士
語文別 中文
第二語文別 英文
口試日期 2020-07-15
論文頁數 46頁
口試委員 指導教授-陳建彰
委員-洪文斌
委員-楊權輝
中文關鍵字 布林運算  秘密影像分享  拉格朗日插值  還原順序性 
英文關鍵字 Boolean operation  secret image sharing  Lagrange interpolation  pre-defined sequence 
學科別分類 學科別應用科學資訊工程
中文摘要 本論文提出一個基於布林函數且具還原順序性之(t, n)秘密影像分享技術。本論文使用布林函數進行互斥或運算產生中間影像,每組的中間影像彼此之間具有關聯性,因此還原的時須依照順序還原中間影像,才能還原秘密影像。先將秘密影像分割,將分割後的子影像使用重排函數產生亂數子影像,將亂數子影像做(t, n)秘密影像分享,當中每一組有n個分享影像,且還原回秘密影像時,需收集t個分享影像,其中分享影像包括指定的分享影像,且指定的分享影像經雜湊函數產生出的中間影像,與其餘分享影像進行互斥或運算產生各組的分享影像。在此技術中還原具有順序性,必需從第一組還原,如果還原缺少指定的分享影像或無順序性,則無法還原後面組數。
英文摘要 This paper proposes a Boolean-based (t, n) secret image sharing scheme with recovering on pre-defined sequence. The proposed scheme first generates intermediate images, in which each intermediate image is related to different owner. The recovering process should follow a pre-defined sequence to obtain the intermediate images sequentially.
The proposed scheme performs as the following steps. First, the secret image is segmented to intermediate images. These intermediate images are then permuted to random-like images. Each random-like intermediate image is then applied to conventional (t, n) secret image sharing approach and XOR processing for obtaining n shared images. Moreover, results of performing hash and generation from some shared images are applied the XOR calculation to the shared images, excepting the pre-defined owner. In the recovering process, the intermediate images should be recovered sequentially. Moreover, the pre-defined owner should be included in the intermediate image’s recovery. Experimental results show that the proposed scheme can efficiently preserving a multi-person image’s face privacy.
論文目次 目錄
第一章 緒論 1
1.1 研究背景與動機 1
1.2 研究架構 2
第二章 文獻探討 3
2.1 Li等人的方法 3
2.2 Yang等人的方法 4
2.3 Chen的方法 4
2.4 Chen等人的方法 5
2.5 Li等人的方法(2018) 5
2.6 Wu等人的方法 6
2.7 Beugnon等人的方法 6
第三章 本論文提出方法 8
3.1 GF(28)在秘密分享中的運算 8
3.2 本論文目的 9
3.3 基於布林函數並具還原順序性之(t, n)秘密影像分享技術演算法 12
3.3.1基於布林函數具還原順序性之(t, n)秘密影像分享的分享演算法 12
3.3.2基於布林函數具還原順序性之(t, n)秘密影像分享的還原演算法 15
第四章 實驗結果及討論 17
4.1 實驗結果 17
4.2比較與討論 26
第五章 結論 29
參考文獻 30
附錄一 英文論文 33
圖目錄
圖 1為本研究分享流程圖 9
圖 2為三人分享示意圖 11
圖 3本論文基於布林函數並具還原順序性之(t, n)秘密影像分享示意圖 14
圖 4本論文基於布林函數並具還原順序性之(t, n)秘密影像還原示意圖 16
圖 5本論文方法在三人分割且經重排函數示意圖 19
圖 6本論文方法在三人秘密影像分享實驗圖 19
圖 7本論文方法的三人秘密影像分享影像 20
圖 8本論文方法在五人分割且經重排函數示意圖 23
圖 9本論文方法在五人秘密影像分享實驗圖 24
圖 10本論文方法的五人秘密影像分享影像 25
表目錄
表 1本論文方法和七個秘密影像分享[2, 3, 6, 10, 11, 27, 29]中的比較表 27
表 2本論文方法和四個秘密影像分享[3, 10, 11, 27]中的比較表 28
參考文獻 [1] G. R. Blakley, “Safeguarding cryptographic keys,” American Federation of Information Processing Societies Proceedings, vol. 48, pp. 313-317, 1979.
[2] S. Beugnon, P. Puteaux, W. Puech, “Privacy Protection For Social Media Based On A Hierarchical Secret Image Sharing Scheme,” 2019 IEEE International Conference on Image Processing (ICIP), 22-25 Sept. 2019
[3] C. C. Chen and S. C. Chen, “Two-layered structure for optimally essential secret image sharing scheme,” Journal of Visual Communication and Image Representation, 2016, 38, pp. 595–601. 

[4] C. Chen and W. Wu, “A secure Boolean-based multi-secret image sharing scheme,” The Journal of Systems and Software, vol. 92, pp.107-114, 2014.
[5] M. C. Chien and J. I. G. Hwang, “Secret image sharing using (t, n) threshold scheme with lossless recovery,” International Conference on Image and Signal Processing (ICISP), 2012 5th International Congress on. 2012, pp. 1325-1329, 2012.
[6] S. Chen, “Essential secret image sharing with increasable shadows,” Optical Engineering, vol. 55, pp. 013103, 2016.
[7] T. Chen and C. Wu, “Efficient multi-secret image sharing based on Boolean operations,” Signal Processing, vol. 91, pp. 90-97, 2011.
[8] Z. Eslami and J. Zarepour Ahmadabadi, “A verifiable multi-secret sharing scheme based on cellular automata,” Information Sciences, vol. 180, pp. 2889-2894, 2010.
[9] C. Huang, C. Hsieh and P. S. Huang, “Progressive sharing for a secret image,” The Journal of Systems and Software, vol. 83, pp. 517-527, 2010.
[10] P. Li, C. Yang, C. Wu, Q. Kong and Y. Ma, “Essential secret image sharing scheme with different importance of shadows,” Journal of Visual Communication and Image Representation, vol. 24, pp. 1106-1114, 2013.
[11] P. Li, Z. Liu, C. N. Yang, “A construction method of (t, k, n)-essential secret image sharing scheme,” Signal Processing: Image Communication. 2018, 65, 210–220. 

[12] S. Lin and J. Lin, “VCPSS: A two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches,” Pattern Recognition, vol. 40, pp. 3652-3666, 2007.
[13] Y. Y. Lin and R. Z. Wang, “Scalable secret image sharing with smaller shadow images,” IEEE Signal Processing Letters, vol. 17, pp. 316-319, 2010.
[14] Z. Liu, M. A. Ahmad and S. Liu, “Image sharing scheme based on combination theory,” Optics Communications, vol. 281, pp. 5322-5325, 2008.
[15] A. Shamir, “How to share a secret,” Communication of the ACM, vol. 22, pp. 612-613, 1979.
[16] D. Singh and S. K. Singh, “Effective self-embedding watermarking scheme for image tampered detection and localization with recovery capability,” Journal of Visual Communication and Image Representation, vol. 38, pp. 775-789, 2016.
[17] R. Y. V. Subba and B. Chakravarthy, “CRT Based Threshold Multi Secret Sharing Scheme,” International Journal of Network Security 16,pp. 249255, 2014.
[18] W. Stalling, “Cryptography and Network Security: Principles and Practices,” Pearson Education Inc., pp. 126-134, 2003.
[19] M. Tang, W. Song, X. Chen and J. Hu, “An image information hiding using adaptation and radix,” Optik - International Journal for Light and Electron Optics, vol. 126, pp. 4136-4141, 2015.
[20] C. Thien and J. Lin, “Secret image sharing,” Computers & Graphics, Vol. 26, pp. 765-770, 2002.
[21] H. Tso, “Sharing secret images using Blakley’s concept,” Optical Engineering, vol. 47, pp. 077001-077001-3, 2008.
[22] M. Ulutas, G. Ulutas and V. V. Nabiyev, “Invertible secret image sharing for gray level and dithered cover images,” The Journal of Systems and Software, vol. 86, pp. 485-500, 2013.
[23] R. Wang, Y. Chien and Y. Lin, “Scalable user-friendly image sharing,” Journal of Visual Communication and Image Representation, vol. 21, pp. 751-761, 2010.
[24] R. Wang and C. Su, “Secret image sharing with smaller shadow images,” Pattern Recognition Letters, vol. 27, pp. 551-555, 2006.
[25] H. Wu and C. Chang, “Sharing visual multi-secrets using circle shares,” Computer Standards & Interfaces, vol. 28, pp. 123-135, 2005.
[26] X. Wu, D. Ou, Q. Liang and W. Sun, “A user-friendly secret image sharing scheme with reversible steganography based on cellular automata,” The Journal of Systems and Software, vol. 85, pp. 1852-1863, 2012.
[27] Z. Wu, Y. Liu, D. Wang and C. Yang,“An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial, ” Symmetry 2019, 11, 69.
[28] C. Yang, C. Chen and S. Cai, “Enhanced boolean-based multi secret image sharing scheme,” The Journal of Systems and Software, vol. 116, pp. 22-34, 2016.
[29] C. Yang, P. Li, C. Wu and S. Cai, “Reducing shadow size in essential secret image sharing by conjunctive hierarchical approach,” Signal Processing: Image Communication, vol. 31, pp. 1-9, 2015.
論文使用權限
  • 同意紙本無償授權給館內讀者為學術之目的重製使用,於2020-08-26公開。
  • 同意授權瀏覽/列印電子全文服務,於2020-08-26起公開。


  • 若您有任何疑問,請與我們聯絡!
    圖書館: 請來電 (02)2621-5656 轉 2487 或 來信