臺灣博碩士論文加值系統

近年來，家族間爭奪遺產的事件時有所聞，導致家庭分裂的案例層出不窮，遺囑的分配問題，成為值得探討的議題。個人和其他家屬間彼此的友好關係往往因為不滿遺囑財產的分配而分裂，因此，如何建構一個具有安全及隱私的線上信託遺囑，是本文努力的目標。
秘密分享的概念，最早是出現在1979年，由Adi Shamir和George Blakley分別所提出的。簡單來說，這是一種解決秘密分享的方法，目的是將秘密S (Secret)切割成n份，分給n個特定的對象；我們稱這n個人各自取得了機密S的次密鑰(shadow)。最後，再重組這些次密鑰，才能得到主金鑰。本文植基於秘密分享(Secret sharing)的機制，解決了信託遺囑的安全問題，本協定結合了密碼學機制以及憑證的應用，不但提供一個具有隱私保護，達到成本降低、效率提高外，而且可防止兄弟鬩牆。

Family quarrels over inheritance, while not new, have featured prominently in the news in recent years. Thus the issue of executing wills for the purpose of dividing inheritance is worth investigating. Acrimony caused by family disputes or distribution of inheritance has a negative impact on society. Thus, we seek to construct a method of constructing a secure and private escrow will.
The concept of secret sharing was proposed by Adi Shamir and George Blakley in 1979. Our method seeks to alleviate problems associated with secret sharing. We divide secret S into n pieces, and distribute those pieces to n specific objects. We call the n owners the shadows. We then reconstruct these shadows and retrieve the original main key. Our method functions on the basis of the secret sharing mechanism. The proposed scheme combines the convenience of the Internet with cryptology technologies to solve the security problems of the online wills. It not only reduces cost and improves performance, but also prevents family infighting.

博、碩士論文授權書.....................................................................................................II
論文口試委員會審定書（中文）........................................................................III
論文口試委員會審定書（英文）........................................................................IV
ACKNOWLEDGEMENTS .....................................................................................V
中文摘要...........................................................................................................................VI
English Abstract............................................................................................................VII
Table of Contents........................................................................................................VIII
LIST OF TABLES..........................................................................................................X
LIST OF FIGURES......................................................................................................XI

1. Introduction 1
1.1 Background 1
1.2 The research motive and purpose 1
1.3 The kernel technique- secret sharing mechanism 3
2. Our proposed protocol for internet will 5
2.1 Our ideas 5
2.2 System framework 6
2.3 Notations 8
2.4 The detail protocol 10
2.4.1 Initialization phase 10
2.4.2 Registration phase 10
2.4.3 The encrypted will delivery and storage phase 12
2.4.4 Death certificate application phase 14
2.4.5 Decrypt the will cipher text phase 15
2.4.6 Will modification phase 19
3. Analyses and discussions 20
3.1 Security analyses 21
3.1.1 Analysis of completeness 21
3.1.2 Analysis of verifiability 21
3.1.3 Analysis of unforgeability 22
3.1.4 Analysis of non-repudiation 23
3.1.5 Analysis of privacy 27
3.2 Analysis of attack patterns 27
3.2.1 Attack by loss of death certificate 27
3.2.2 Internal attack 28
3.2.3 Impersonation attack 29
3.2.4 Man-in-the-middle attack 29
3.3 Discussion on practicality 30
4. Conclusion 30
5. References 31
附錄A:作者簡介 34
附錄B:口試委員意見修正 35


LIST OF TABLES
Table 1. Non-repudiation during the registration phase 24
Table 2. Non-repudiation during the encrypted will delivery and storage phase………………………………………………………………..24
Table 3. Non-repudiation during the death certificate application phase 25
Table 4. Non-repudiation during the decryption of will cipher text phase 26
Table 5. Non-repudiation during the modifying will phase 26



LIST OF FIGURES
Figure 1. The conceptual diagram of the designed escrow will 6
Figure 2. The structure of our scheme 6
Figure 3. The scenarios of the registration phase. 11
Figure 4. The scenarios of the encrypted will delivery and storage phase 12
Figure 5. The scenarios of applying for death certificate phase 14
Figure 6. The scenarios of the will decrypting phase 16
Figure 7. The scenarios of modifying will phase 19

[1]Ajmani, S., Morris, R. and Liskov, B., "A Trusted Third-Party Computation Service.", MIT Laboratory for Computer Science 200 Technology Square, Cambridge, pp. 512-521, 2001.
[2]Asokan, N., Shoup, V., and Waidner, M., "Optimistic fair exchange of digital signatures", IEEE Journal on selected areas in communications, Vol. 18, No. 4, April pp. 593–610, 2000.
[3]Blakley, G., "Safeguarding cryptographic keys", Proc AFIPS 1979 National Computer Conference, AFIPS Press, New York, pp. 313–317, 1979.
[4]Chen, Y. Y., Chen, C. L, and Jan, J. K., "Design of a Fair Proxy Raffle Protocol on the Internet", Computer Standards & Interfaces, Vol. 27, No. 4, pp.417-424, 2005.
[5]Chen, Y. Y., Chen, C. L, and Jan, J. K., "A Mobile Ticket System Based on Personal Trusted Device", Wireless Personal Communications, Vol. 40, No. 4, pp.569-578, 2007.
[6]Chen, Y. Y., Jan, J. K. and Chen, C. L., "The design of a secure anonymous Internet voting system", Computers & Security, 23, pp.330–337, 2004.
[7]Chien, H. Y, and Lin, R. Y., "ID-Based E-Will System using Bilinear Pairings", IWCS2006, Hong Kong, Jun. pp.20-22, 2006.
[8]Chien, H. Y. and Tseng, J. K., "A practical (t, n) multi-secret sharing scheme", IEICE Transactions on Fundamentals of Electronics, Communications and Computer 83-A (12), pp.2762–2765, 2000.
[9]Franklin, M. K, and Reiter, M. K., "Fair-Exchange with a Semi-Trusted Third Party", Fourth ACM Conference. Computer and Comm. Security, Japan, pp. 1-7, 1997.
[10]Harn, L. "Efficient sharing (broadcasting) of multiple secret ", Computers and Digital Techniques 142 (3), pp. 237–240, 1995.
[11]Housley, R., Polk, W. and Solo, D., "Internet X.509 public key infrastructure certificate and CRL profile", PKIX Working Group Internet Draft, 2001.
[12]Rivest, R. L., Shamir, A. and Adleman, L., "Method for Obtaining Digital Signatures and Public Key Cryptosystems", Communications of the ACM, Vol. 21, No. 2, pp.120-126, 1978.
[13]Shamir, A., "How to share a secret", Communications of the ACM, Vol. 22, No.11, pp. 612–613, 1979.
[14] Stinson, D. R, "An Explication of secret sharing schemes", Designs, Codes Cryptography, Vol. 2, No.4, pp.357–390, 1992.
[15]Susilo, W., Zhang, F. and Mu, Y., "Identity-based strong designated verifier signature schemes", in ACSIP, Vol. 3108, Springer-Verlag, 2004, pp. 313–324, 2004.
[16]Tseng, Y. M., "Digital signature of type and application, "Communications of the CCISA, Vol. 7, No.3, pp. 59-67, 2001.
[17]Tseng, Y. M., Jan, J. K. and Chien, H. Y., "On the security of generalization of threshold signature and authenticated encryption", IEICE Fund. E84-A (10), pp. 2606–2609, 2001.
[18]Tompa, M. and Woll, H., "How to share a secret with cheaters ", Journal of Cryptology, Vol. 1, No.3, pp.133–138, 1988.
[19]Wang, C. T., Chang, C. C. and Lin C. H., "Generalization of threshold signature and authenticated encryption for group communications", IEICE Transactions on Fundamentals E83-A (6) 1228–1237, 2000.
[20]Yang, C. C., Chang, T. Y. and Hwang, M. S. "A (t, n) multi-secret sharing scheme", Applied Mathematics and Computation, Vol.151, No. 2, pp.483–490, 2004.
[21]Zhou, J. and Gollmann, D., "A Fair Non-repudiation Protocol", Proc. IEEE Symp. Research in Security and Privacy, pp. 55-61, 1996.
[22]News morning paper, battle of a century of mystery succeeding to the throne, China Cantonese, 2005.
http://big5.xinhuanet.com/gate/big5/news.xinhuanet.com/st/2005-05/25/content _2998558.htm
[23]Undertake and the trust law office in plan of the property legacy, Hong Kong, 2001, http://www.asset.hk/