動態門檻值秘密分享設計於動態節點系統之研究與秘密分享設計之應用

簡易檢索 / 詳目顯示

回結果列表

研究生：	陳品佑 Pin-Yu Chen
論文名稱：	動態門檻值秘密分享設計於動態節點系統之研究與秘密分享設計之應用 Dynamic Threshold Secret Sharing Schemes with Mobile Systems and Applications
指導教授：	蔡育仁 Yuh-Ren Tsai
口試委員:
學位類別：	碩士 Master
系所名稱：	電機資訊學院 - 通訊工程研究所 Communications Engineering
論文出版年：	2008
畢業學年度：	96
語文別：	英文
論文頁數：	46
中文關鍵詞：	門檻值秘密分享設計
外文關鍵詞：	Threshold secret sharing scheme
相關次數：	點閱：2 下載：0
分享至:	分享至facebook 分享至twitter

查詢本校圖書館目錄查詢臺灣博碩士論文知識加值系統勘誤回報

秘密分享設計的主要概念為，將欲保存的秘密分配給多位分享者共同持有，在此稱為節點，而欲還原此秘密時，部分的分享者可共同解出此秘密。在此論文主要探討(k, n)門檻值秘密分享設計，將欲保存的秘密分享給n個分享者，且任意k個分享者可還原此秘密。在秘密分享設計中，分配給各分享者所持有的訊息稱為shadow，而proactive的概念即為：定期更新使用者所持有的shadow，以增加此設計的強韌性。基於proactive秘密分享設計，我們提出一個適合於分享者為動態的環境，即分享者會離開或加入此秘密分享系統。除此之外，此設計還能依據分享者的總數調整其門檻值，k，以維持高度安全性。
另外，在本論文裡我們將探討shadow的大小。現存許多秘密分享系統裡，部分設計具有此特性：分享者所持有的shadow的大小，小於秘密。然此系列設計不具備proactive的特性。因此，我們利用多項式以及矩陣投影的方式，設計一個，具備上述特性，以及proactive特性的秘密分享設計。
本論文的最後一個部份，我們將秘密分享設計的概念應用在點對點視訊平台上。根據人接收影視的習慣，收視者可能隨時離開；訊息傳輸的架構，不同以往的廣播方式；以及資料傳輸的便捷性下，如何管理收看者的權限，等種種問題。我們利用金鑰管理系統以及認證系統，提出一個管理設計。

Abstract    一
Introduction    1
Preliminaries    4
1.    Shamir’s Secret Sharing Scheme    4
2.    Feldman’s Verifiable Secret Sharing Scheme    4
3.    Herzberg et al.’s Proactive Secret Sharing Scheme    5
3.1.    The Initial Protocol    6
3.2.    The Shadow Update Protocol    6
3.3.    The Shadow Recovery Protocol    7
3.4.    Reconstructing the secret    8
Mobile proactive threshold secret sharing scheme    9
1.    The Initial Protocol    10
2.    Shadow Update Protocol    11
3.    The Threshold Change Protocol    12
3.1.    Case 1: When m < k    12
3.2.    Case 2: When m > k    14
4.    Reconstruct the Secret    14
Discussions    16
Proactive secret sharing scheme by using projection matrix    19
1.    Our purpose    19
2.    Utilized schemes    20
2.1.    Bai’s scheme    20
2.2.    Thien’s scheme    21
3.    Proposed Proactive secret sharing scheme by using projection matrix    22
3.1.    Initial phase    24
3.2.    Shadow update phase    25
3.3.    Secret reconstruction phase    27
4.    Analysis and Compare    28
4.1.    Compare with other schemes    28
4.2.    Security analysis    29
Applications    31
1.    The introduction of peer-to-peer live stream platform    31
2.    Related works    34
2.1.    Chaum and Pedersen’s scheme    34
2.2.    Diffie-Hellman key establishment protocol    35
2.3.    User authentication scheme    36
3.    An efficient authentication Scheme in Peer-to-peer Based Live Stream Sharing Management Systems    36
3.1.    The key establishment phase    36
3.2.    The authentication phase    37
3.3.    Common key establishment phase    39
4.    Analysis and discussions    39
4.1.    Accuracy    39
4.2.    Security    40
4.3.    Required resources    41
4.4.    Performance    42
4.5.    Comparisons    42
Conclusions    43
Bibliography    45

                                

[1] L. Bai, “A strong ramp secret sharing scheme using matrix projection,” Proceedings of the 2006 International Symposium on World of Wireless, Mobile and Multimedia Networks, pp. 652-656, 2006.
[2] L. Bai, “A reliable (k, n) image secret sharing scheme,” Dependable, Autonomic and Secure Computing, 2nd IEEE International Symposium on, pp. 31-36, 2006.
[3] G. Blakley, “Safeguarding cryptographic keys,” In Proceedings of the AFIPS 1979 National Computer Conference, Vol. 48, Arlington, VA, pp. 313-317, June 1997.
[4] S. M. Chang, S. P. Shieh, W. W. Lin, and C. M. Hsieh, “An efficient broadcast authentication scheme in wireless sensor networks,” Proceedings of the 2006 ACM Symposium on Information, computer, and communications security, pp. 311-320, 2006.
[5] D. Chaum, and T. P. Pedersen, “Wallet Databases with Observers,” Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, pp. 89-105, 1992.
[6] W. Diffie, and M. E. Hellman, “New Directions in Cryptography,” IEEE Transactions on Information Theory, Vol. 22, pp. 644-654, 1976.
[7] P. Feldman, “A practical scheme for non-interactive verifiable secret sharing,” In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pp. 427-437, 1987.
[8] A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung, “Proactive secret sharing, or how to cope with perpetual leakage,” Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology, pp. 339-352, August 27-31, 1995.
[9] P. Horster, M. Michels, and H. Peterson, “Generalized ElGamal signatures for one message block,” Proceedings of Second International Workshop on IT-Security, pp. 66-81, 1994.
[10] J. Kilian and E. Petrank, “Identity escrow,” In Proceedings of Advances in Cryptology – Crypto 98, pp. 169-185, 1998.
[11] X. Liu, H. Yin, and C. Lin, “sStream: Peer-to-Peer Live Streaming with Efficient User Authentication and Key Management,” Second International Conference on Communications and Networking in China, pp. 270-274, 2007.
[12] A. Lysyanskaya, R. Rivest, A. Sahai, and S. Wolf, “Pseudonym systems,” The 6th Annual Workshop on Selected Areas in Cryptography, 1999.
[13] T.P. Pederson, “Non-interactive and information- theoretic secure verifiable secret sharing,” Advances in Cryptology, pp. 129-140, 1991.
[14] A. Perrig, R. Canetti, D. Song, and J. D. Tygar, “Efficient and secure source authentication for multicast,” In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS 2001), pp. 35-46, 2001.
[15] D. Schultz, B. Liskov, and M. Liskov, “MPSS: mobile proactive secret sharing,” Unpublished, November 10, 2006. Available at http://www.cs.wm.edu/~mliskov/full-paper.pdf.
[16] A. Shamir, “How to share a secret,” Communications of the ACM, Vol. 22, no.11, pp. 612-613, 1979.
[17] C. C. Thien and J. C. Lin, “Secret image sharing,” Computers & Graphics, vol. 26, no. 5, pp. 765–770, 2002.
[18] A. Weimerskirch, and D. Westhoff, “Identity certified authentication for ad-hoc networks,” Proceedings of the 1st ACM workshop on Security of ad-hoc and sensor networks, pp. 33-40, 2003.

全文公開日期本全文未授權公開 (校內網路)
全文公開日期本全文未授權公開 (校外網路)

簡易檢索 / 詳目顯示

相關論文