臺灣博碩士論文加值系統

摘要

在本論文中,我們針對行動隨意網路認證安全協定提出基於階層式存取控制使用線性同餘和鑰匙交換之新的認證安全協定,我們不但應用在行動隨意網路的安全同時也降低整個系統的複雜度以及計算量。
在我們新的認證安全協定中,我們使用了線性同餘之方法，在安全層級較高使用者可以推算出層級較低使用者的秘密鑰匙，反之則不然，同時透過我們所提出的認證安全架構,即使使用者突然加入、離開原先的使用者並不需要改變其秘密鑰匙。另外我們又有另一個想法那就是再加上鑰匙交換方式,來減少資料傳輸路徑，這樣一來，我們便同時提供了認證和安全機制。

我們研究主要貢獻有下列幾點:
(1)我們結合秘密鑰匙以及互斥或閘運算減少整個系統的複雜度及運算量。
(2)我們設計單向函數的方法來避免群體鑰匙因使用者突然加入、離開而改變。
(3)使用鑰匙交換技術來減少資料傳輸路徑而不需要在透過上面的使用者來幫忙傳送資料。
(4)本架構整合密碼學、階層架構、線性同餘以及鑰匙交換來達到同時認證及安全對於所有使用者。
我們相信運用本論文所提出的架構,會讓行動隨意網路更加的安全以及便利。

Abstract
In this thesis, we propose two authentication protocols and security schemes for MANET based on hierarchy access control, symmetric key cryptosystem, and hierarchy structure. We will make an application of our scheme on MANET security. We also make detailed security analysis about our schemes. The proposed new protocol not only at the same time offer security and authentication on MANET but also reduce systematic complexity and calculating amount.
Our first proposed scheme operational complexity is based on hierarchy access control with linear congruence. In this scheme, via the generated public parameter, the higher level mobile node (predecessor) can derive the secret key of the lower level mobile node (successor). However, the lower level mobile node (successor) can not be able to deduce the secret key of the higher level mobile node (predecessor). There is an another idea proposed by the authors. Except transmitting information form lower level to upper lever, the mobile nodes are also allowed to transmit information to the nodes on the same level with it. For this reason, our second scheme is given based on hierarchy access control with Diffie – Hellman key exchange. In this scheme, through the exchange key scheme, the nodes on the same level can derive the same key for information transmission.
The contributions of our new scheme are as follows:
(1)Reducing complexity and calculating amount of the whole system
The feature of our scheme is that authentication and security protocol is based on secret key system and bit-wise XOR operations to make whole system simpler and reduce calculation amount.
(2)Group key needn't change
Our proposed scheme designs a one-way function with simple linear congruence. By this characteristic, dynamic mobile node such as inserting a group, deleting a group, changing a key etc., can be implemented simply.
(3)Reducing the route
We use Diffie – Hellman key exchange in the same level. Utilizing this method, mobile nodes do not need to take the place of spreading through the node above while transmitting the data. And then jumping one hop directly in the same level can reduce the route.
(4)Integrating multi-techniques
The techniques of hierarchical structure, secret key cryptography and Number Theory are integrated to reach at the same time security and authentication among all participators.
We trust that the results of our research in this thesis will be more helpful to future research in the area of the authentication and security protocols in MANET.

Contents
Abstract………………………………………………………………...Ⅰ
List of Figures……………………………………………………..…...Ⅳ
List of Tables……………...………………………….………………...Ⅴ
Chapter 1. Introduction……………………………………………..….1
1.1 Motivation and Purposes……………………………………………1
1.2 Our Schemes and Main Results..……………………………………3
1.3 Organization of This Thesis…………………………………………5

Chapter 2. Background and Previous Works…………………………6
2.1 MANET Overview…………………………………………………...6
2.1.1 MANET Introduction……………………………………….….6
2.1.2 MANET Challenges……………………………………………9
2.2 A Brief Review Cryptography……………………………….……...10
2.2.1 Base Concepts of Number Theory………………………….....10
2.2.2 Concepts of Cryptography………………………..…..….……13
2.2.3 Diffie-Hellman Key Exchange………………………………..17
2.3 Previous Research on Hierarchy Access Control…...………………19

Chapter 3. Three Proposed Schemes of MANET Security Based on Hierarchy Access Control…………………….………..24
3.1 The protocol Based on Hierarchy Access Control with Linear Congruence………………………………………………………...24
3.2 The protocol Based on Hierarchy Access Control with Diffie – Hellman …………………………………………………………...30
3.3 The hybrid protocol Based on Hierarchy Access Control with Linear Congruence and Diffie – Hellman ………………………………...34
3.4 Security analysis……………………………………………….…...36

Chapter 4. Conclusions and Future Research………………………….40
References……………………..…………………..…………………....42

List of Figures
Figure 1.1 A tree hierarchy structure…………………………….…….…2
Figure 1.2 A partial order hierarchy structure………………………….…3
Figure 2.1(a) The infrastructure-based wireless network………………...6
Figure 2.1(b) Mobile ad hoc network…………………………………….7
Figure 2.2a The block diagram of the traditional cryptosystem………...14
Figure 2.2b The secret-key cryptosystem……………….…. …………..15
Figure 2.2c The public-key cryptosystem………………………………16
Figure 2.2d Complete Diffie-Hellman Key Exchange Process………....18
Figure 2.3 (a) A tree hierarchy structure………………………………...19
Figure 2.3 (b) A partial order hierarchy structure……………………….20
Figure 3.1 The hierarchy construction…………………………………..25
Figure 3.2 The process of public parameter generation………………...26
Figure 3.3 The graph of key derivation process…………………...……27
Figure 3.4 The modified hierarchy construction by joining membership MN .………………………………………………………..29
Figure 3.5 The modified hierarchy construction by leaving membership MN . ……………………………………………………….30
Figure 3.6 Process of key exchange …………………………………....32
Figure 3.7 Modified hierarchy construction using Diffie-Hellman key exchange in the same level………………………………..32
Figure 3.8 The user hierarchy includes eight security memberships…...34

List of Tables
Table 3.1 The secret keys and public parameter of Example 3.1…….....27
Table 3.2 The secret keys of example 3.6……………………………….35
Table 3.3 The public parameter of example 3.6…………………………35

References
[1]C. H. Lin and P. J. Lee, “Several practical protocols for authentication and key exchange,” Information Processing Letters, Vol.53, 1995, pp.92-95.
[2]J. McHung, and A. P. Moore, “A security policy and formal top level specification for a multilevel secure local area network,” Proceedings IEEE Symposium on Security and Privacy, Oakland, CA, April 7-9, 1986, pp. 43-49.
[3]D. McCullough, “Specifications for multilevel security and a hook-up property,” Proceedings IEEE Symposium on Security and Privacy, Oakland, CA, April 27-29, 1987, pp. 161-166.
[4]W. P. Lu, and M. K. Sundareshaan, “A model for multilevel security in computer networks,” Proceedings 1988 INFCOM, New Orleans, LA, March 1988, pp. 1095-1104.
[5]M. Maekawa, A. E. Oldehoeft, and R. R. Oldehoeft, Operating Systems Advanced Concepts, The Benjamin Cummings Publishing Company, Inc. Menlo Park, CA, 1987.
[6]K. Siil, “Adaptive applications to multilevel secure UNIX Systems,” Proceedings 7 International Conference and Exhibition on Information Security, Brighton, UK, May 1991.
[7]D. E. Denning, S. G. Akl, M. Morgenstern, and P. G. Nermann, “Views of multilevel database security,” Proceedings IEEE Symposium on Security and Privacy, Oakland, CA, April 7-9, 1986, pp. 156-172.
[8]D. E. Denning, “Cryptographic checksums for multilevel database security,” Proceedings IEEE Symposium on Security and Privacy, Oakland, CA, April 29-May 2, 1984, pp.52-61.
[9]G. I. Davida, D. L. Wells, and J. B. Kam, “A database enctyption system with subkeys,” ACM Transaction Database System, Vol6, No. 2, 1981, pp.312-328.
[10]M. Frodigh, P. Johansson, and P. Larsson, “Wireless ad hoc networking：the art of networking without a network,” Ericsson Review, No.4,
[11]IETF Working Group： Mobile Ad hoc Networks (MANET). http://www.ietf.org/html.charters/manet-charter.html.
[12]Ad Hoc Networking Extended Research Project. Online Project. http://triton.cc.gatech.edu/ubicomp/505.
[13]J. P. O Grady, and A. McDonald, “ State of the Art：Ad Hoc Networking,” Adaptive Wireless Systems Group Cork Institute of Technology, State of Art Surveys：Release 2, May 2003.
[14]Charles E. Perkins and Pravin Bhagwat, “ Highly Dynamic Destination-Sequenced Distance-Vector routing (DSDV) for Mobile Computers,” In Proceedings of the SIGCOMM ’94 Conference on Communication Architectures, Protocols and Applications, August 1994, pp. 234-244.
[15]Shree Murthy and J. J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks,” Mobile Networks and Applications, 1(2)183-197, 1996.
[16]T. Clausen, P. Jacquet, A. Laouiti, P. Muhlethaler, a. Qayyum et L. Viennot, IEEE INMIC Pakistan, 2001.
[17]Tsu-Wei Chen and Mario Gerla, "Global State Routing: A New Routing Scheme for Ad-hoc Wireless Networks" Proc. IEEE ICC’98, 5 pages.
[18]A. Iwata, C.-C. Chiang, G. Pei, M. Gerla, and T.-W. Chen, "Scalable Routing Strategies for Ad Hoc Wireless Networks" IEEE Journal on Selected Areas in Communications, Special Issue on Ad-Hoc Networks, Aug. 1999, pp.1369-79.
[19]Charles Perkins and Elizabeth Royer, “Ad Hoc On-Demand Distance Vector Routing,” in 2nd IEEE Workshop on Selected Areas in Communication, February 1999, pp. 90-100.
[20]D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad-Hoc Wireless Networks,” T. Imielinski and H. Korth, editors, Mobile Computing, 1996, Kluwer Academic Publishers.
[21]V. D. Park and M. Scott Corson, “ A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” in IEEE Conference on Computer Communications (Infocom ’97), 1997.
[22]M. R. Pearlman and Z. J. Haas, “Determining the Optimal Configuration for the Zone Routing Protocol,” IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, August 1999, pp. 1395-1414.
[23]Y. C. Tseng and T. Y. Hsieh, “Fully power-aware and location-aware protocols for wireless multi-hop ad hoc networks,” Computer Communications and Networks, 2002. Proceedings. Eleventh International Conference on 14-16 Oct. 2002 Page(s):608 - 613
[24]Dongkyun Kim, Jaewoo Park, Toh, C.-K., and Yanghee Choi, “Power-aware route maintenance protocol for mobile ad hoc networks,” Telecommunications, 2003. ICT 2003. 10th International Conference on Volume 1, 23 Feb.-1, March 2003,pp. 501 - 506 vol.1
[25]J. R. Jing, Y. C. Tseng, C. S. Hsu, and T. H. Lai, “Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks,” Parallel Processing, 2003. Proceedings. 2003 International Conference on 6-9, Oct. 2003, pp. 257 – 264.
[26]閔嗣鶴, 嚴士健, 初等數論, 第二版, 凡異出版社, 1957
[27]David M. Burton, Elementary Number Theory, 3rd ed., 1994.
[28]K. H. Rosen, Elementary Number Theory and It’s Applications,3rd ed., Addison Wesley, 1992
[29]D. Knuth, The Art of Computer Programming：Vol. 2 Seminumerical Algorithm, 2nd ed., Addison- Wesley, 1981.
[30]賴溪松, 韓亮, 張真誠, 近代密碼學及其應用, 松岡電腦圖書資料股份有限公司, 1994.
[31]楊吳泉, 現代密碼學入門與程式設計, 全華圖書科技, 1995.
[32]W. Diffe and M. E. Hellman, “New Direction in Cryptography,” IEEE Transactions on Information Theory, Vol. IT-22, No. 6, November 1976, pp.644-654.
[33]Jinn-Ke Jan and Ren-Hung Lin, “A secure Anonymous Voting by Employing Diffie-Hellman PKD Concept,” Institute of Applied Mathematics, National Chung University, Taichung, Taiwan 420 ROC.
[34]William Stallings, “Cryptography and Network Security,” International Edition 3rded.
[35]NetIP, Inc. and Keith Palmgren, “Diffie-Hellman Key Exchange – A Non-Mathematician’s Explanation,” CISSP, 2001.
[36]周志昇, 建構於階層式存取控制, 中原大學電機工程學系碩士論文, 2003.
[37]陳淵翔, New Schemes of Hierarchy Access Control Based on Linear Congruence, 中原大學電機工程學系碩士論文, 2001.
[38]黃宗賢, An Anonymous Authentication Protocol and Security Scheme of Mobile IP, 中原大學電機工程學系碩士論文, 2004.
[39]S. G. Akl, and P.D. Taylor, “Cryptographic solution to a problem of access control in hierarchy,” ACM Transaction on computer systems, Vol. 1, No. 3, August 1983, pp. 239-247.
[40]S. J MacKinnon, P. D. Taylor, H. Meijer and S. G. Akl, “An optimal algorithm for assigning cryptographic keys to access control in a hierarchy,” IEEE Transactions on computers, Vol. C-34, Vol. 9, September 1985, pp.797-802.
[41]L. Harn and H. Y. Lin, “A cryptographic keys generation scheme for multilevel data security,” Computers and Security, Vol. 9, 1990, pp.539-546.
[42]R. S. Sandhu, “Cryptographic Implementation of a tree hierarchy for access control,” Information Processing Letters, Vol. 27, No. 2, 1988, pp.95-98.
[43]C. S. Laih and T. L. Hwang, “A branch oriented key management solution to dynamic access control in a hierarchy,” Proceedings of IEEE Symposium on Applied Computing, Kansas City, MO, 1991, pp. 422-429.