跳到主要內容

臺灣博碩士論文加值系統

(44.200.194.255) 您好!臺灣時間:2024/07/18 13:16
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:侯咸伍
研究生(外文):Xian-wu Hou
論文名稱:基於使用者驗證的金鑰協議安全及模糊傳輸之研究
論文名稱(外文):Security of Key Agreement and Oblivious Transfer Based on User Authenticated
指導教授:周志賢
指導教授(外文):Jue-sam Chou
學位類別:碩士
校院名稱:南華大學
系所名稱:資訊管理學研究所
學門:電算機學門
學類:電算機一般學類
論文種類:學術論文
論文出版年:2008
畢業學年度:96
語文別:英文
論文頁數:28
中文關鍵詞:金鑰協議偽裝攻擊模糊傳輸身份認證
外文關鍵詞:key agreementuser authenticationimpersonation attackoblivious transfer
相關次數:
  • 被引用被引用:1
  • 點閱點閱:287
  • 評分評分:
  • 下載下載:24
  • 收藏至我的研究室書目清單書目收藏:1
  在現今網路快速發展的世界裡,資訊大量的公開交換取得,造成有心人士可以輕易的竊取、偽造他人訊息,因此為保障重要資訊交換的安全性,人們常採取許多的安全措施,其中常見的有加密及模糊傳輸這兩種技術。首先以金鑰協商技術來說,溝通兩方在傳輸重要訊息前先行協議建立一把共享的秘密金鑰,在 2005 年時 Zhou 他們提出一個應用憑證以達到遠端使用者身份相互認證及會議金鑰協議。不過他的架構存在著安全上的弱點,也就是無法阻擋攻擊者的偽裝攻擊。其次,在 n 個訊息中挑選 k 個的模糊傳輸的技術來說,接收端只能從 n 個訊息中獲得到 k 個,而傳送端無法得知接收端所挑選的 k 個訊息,在 2006 年時 Kim 他們發展出一個使用RSA加密方式的安全驗證非交換作用的糊模傳輸,不過我們發現他們的架構存在著安全上的弱點,無法抵擋攻擊者的偽裝攻擊。
  
  因此,在本篇論文我們將個別的分析 Zhou 和 Kim 的架構,指出其安全上的弱點,並提出偽裝攻擊的演算法。我們將提出一個基於橢圓雙曲線的 n 選 k 模糊傳輸,以達到使用者相互身份驗證及有效率溝通的安全性需求,同時在安全性和溝通效率上與現存的其它方法提出比較。
  The key agreement and oblivious transfer (OT) is an important primitive for designing secure protocols. At first, in the method of key agreement, two parties can establish a common secret session key over an insecure. In 2005, Zhou et al. proposed an end-to-end security protocol with certificate-based authentication to mutually authentication and session key agreement. But their scheme is suffers from the impersonation attack, it cannot achieve the claimed security. Secondly, in the oblivious transfer protocol, the sender has n encrypted messages to be sending to the receiver while the receiver only intends to get k messages among the n transmitted messages, the sender cannot figure out which messages the receiver selected. In 2006, Kim et al. proposed secure verifiable non-interactive oblivious transfer protocol using RSA. However, we found that their protocol suffers from impersonation attack.
  
  We will take cryptanalysis of Zhou et al. scheme and Kim et al. scheme and propose impersonation attack for Zhou et al. scheme and Kim et al. scheme. We present an efficient mutual authentication k-out-of-n oblivious transfer protocol based on bilinear pairing, which offers the security requirements of mutual authentication and is communicationally efficient while compared with all of the existing schemes.
書名頁 i
論文口試合格証明 iv
誌謝 v
中文提要 vi
英文提 vii
目錄 viii
List of Tables ix
List of Figures x
  
Chapter 1 Introduction 1
  
Chapter 2 Preliminaries 5
2.1 Bilinear pairings 5
2.2 The security requirements of the oblivious transfer 6
  
Chapter 3 Review Related Paper 7
3.1 Review of Zhou et al.’s protocol 7
3.1.1 Zhou et al.’s protocol 7
3.1.2 Cryptanalysis of Zhou et al.’s protocol 9
3.2 Review of Kim et al.s’ protocol 10
3.2.1 Kim et al.’s protocol 10
3.2.2 Cryptanalysis of Kim’s NIOT scheme 13
  
Chapter 4 Proposed scheme 14
  
Chapter 5 Security analysis and bandwidth comparisons 16
5.1 Security analysis 16
5.2 Bandwidth consumption comparisons 20
  
Chapter 6 Conclusion 24
References 25
[1]Y. B. Zhou, Z. F. Zhang, and D. G. Feng, Cryptanalysis of the End-to-End Security Protocol for Mobile Communications with End-User Identification/Authentication, IEEE Communications Letters 9, 2005.
  
[2]W. Diffie and M. E. Hellman, “New directions in cryptography, IEEE Trans. Inform. Theory 22, pp. 644-654, 1976.
  
[3]C. C. Chang, K. L. Chen, and M. S. Hwang, End-to-end security protocol for mobile communications with end-user identification/authentication, Wireless Personal Communications 28, pp. 95-106, 2004.
  
[4]C. S. Park, On certificate-based security protocols for wireless mobile communication systems, IEEE Network 11, pp. 50-55, 1997.
  
[5]G. Brassard, C. Cre''peau, and J.-M. Robert, All-or-nothing disclosure of secrets. Advances in Cryptology – CRYPTO ’86, LNCS 263, Springer-Verlag, pp. 234–238, 1986.
  
[6]C. K. Chu, W. G. Tzeng, Efficient k-out-of-n oblivious transfer Schemes with adaptive and non-adptive queries. PKC 2005, LNCS 3386, pp. 172-183, 2005.
  
[7]J. Camenish, G. Neven, and A. shelat. Simulatable adaptive oblivious transfer. EUROCRYPT 2007, LNCS 4515, pp. 573-590, 2007.
  
[8]M. L. Das, A. Saxena, V. P. Gulati and D. B. Phatak, A novel remote user authentication scheme using bilinear pairings, Computers & Security 25, pp. 184-189, 2006.
  
[9]S. Even, O. Goldreich, and A. Lempel, A randomized protocol for signing contracts, Communications of the ACM 28, pp. 637–647, 1985.
  
[10]M. Green, S. Hohenberger, Blind identity-based encryption and simulatable oblivious transfer, Cryptology ePrint Archive 2007/235, 2007.
  
[11]H. Ghodosi, On insecurity of Naor–Pinkas'' distributed oblivious transfer, Information Processing Letters (2007) 104, 2007.
  
[12]H. F. Huang, C. C. Chang, A New Design for Efficient t-out-n Oblivious Transfer Scheme, Advanced Information Networking and Applications 2, IEEE, pp. 28-30, 2005.
  
[13]O. Rabin, Exchange secrets by oblivious transfer, Computer Science Lab, Harvard University, Cambridge, MA, TR-81, 1981.
  
[14]S. Halevi, Y. T. Kalai, Smooth projective hashing and two-message oblivious transfer, Cryptology ePrint Archive 2007/118, 2007.
  
[15]S. Kim, S. Kim, and G. Lee, Secure verifiable non-interactive oblivious transfer protocol using RSA and Bit commitment on distributed environment, Future Generation Computer Systems, 2006.
  
[16]C. Y. Lin, T. C. Wu, and F. Zhang and J. J. Hwang, New identity-based society oriented signature schemes from pairings on elliptic curves, Applied Mathematics and Computation 160, pp 245-260, 2005.
  
[17]K. Peng, C. Boyd and E. Dawson, Batch verification of validity of bids in homomorphic e-auction, Computer Communications 29, pp. 2798-2805, 2006.
  
[18]A. Parakh, Oblivious Transfer Using Elliptic Curves, the 15th International Conference on Computing, IEEE , pp. 323-328 , 2006.
  
[19]Shamir, Identity based cryptosystems & signature schemes. Advances in Cryptology, CRYPTO’84, LNCS, pp. 47–53, 1984.
  
[20]W. G. Tzeng, Efficient 1-out-n oblivious transfer schemes, the Public-Key Cryptography (PKC ’02), Springer-Verlag, pp. 159-171. 2002.
  
[21]J. Zhang, Y. Wang, Two provably secure k-out-of-n oblivious transfer schemes, Applied Mathematics and Computation 169, pp. 1211-1220, 2005.
  
[22]J. Zhang, W. Zou, Two t-out-of-n oblivious transfer schemes with designated reeiver, wuhan university journal of natural sciences 11, pp. 2006.
  
[23]Y. Mu, J. Zhang, and V. Varadharajan, m out of n oblivious transfer, the 7th Australasian Conference on Information Security and Privacy (ACISP ’02), 2384 , LNCS, pp. 395-405, Springer-Verlag, 2002.
  
[24]M. Naor, B. Pinkas, Oblivious transfer with adaptive queries, Advances in Cryptology–CRYPTO ’99, LNCS 1666, pp. 573–590. Springer-Verlag, 1999.
  
[25]M. Naor, B. Pinkas, Distributed oblivious transfer, Advances in Cryptology–Proceedings of ASIACRYPT’00, LNCS 1976, Springer-Verlag, 2000.
  
[26]D. Boneh, M. K. Franklin, Identity-based encryption from the Weil Pairing, In CRYPTO''01, pp. 213-229, 2001.
  
[27]C. C. Chang, J. S. Lee, Robust t-out-of-n oblivious transfer mechanism based on CRT, Journal of Network and Computer Applications, 2008.
  
[28]A. Menezes, T. Okamoto, and S. Vanston, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Transaction on Information Theory 39, pp. 1639-1646, 1993.
  
[29]L.M. Kohnfelder, On the signature reblocking problem in public-key cryptography, Communications of the ACM 21 (2) 179, 1978.
  
[30]D. Boneh, X. Boyen, Efficient selective-ID secure Identity-Based Encryption without random oracles. In EUROCRYPT ''04, LNCS 3027, pp. 223-238, 2004.
  
[31]C. Crepeau, Equivalence between two floavors of oblivious transfer, EUROCRYPTO 87, pp.350-354, 1987.
  
[32]M. Naor, B. Pinkas, Oblivious transfer and polynomial evaluation, Proc. 31th ACM Symp. on Theory of Computing, pp. 245-254, 1999.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊