Please use this identifier to cite or link to this item:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/44684Full metadata record
| ???org.dspace.app.webui.jsptag.ItemTag.dcfield??? | Value | Language |
|---|---|---|
| dc.contributor.advisor | 雷欽隆(Chin-Laung Lei) | |
| dc.contributor.author | Ren-Chiun Wang | en |
| dc.contributor.author | 王仁群 | zh_TW |
| dc.date.accessioned | 2021-06-15T03:52:51Z | - |
| dc.date.available | 2015-07-12 | |
| dc.date.copyright | 2010-07-12 | |
| dc.date.issued | 2010 | |
| dc.date.submitted | 2010-07-06 | |
| dc.identifier.citation | [1] 'The keyed-hash message authentication code (hmac),'. tech. rep., Federal Information Processing Standards Publication, Draft, 2001.
[2] 'Anonymity & Privacy,'. tech. rep., http://anon.inf.tu-dresden.de/, 2009. [3] I. Aad, J.-P. Hubaux, and E. W. Knightly, 'Impact of denial of service attacks on ad hoc networks,' IEEE/ACM Transactions on Networking, vol. 16, no. 4, pp. 791–802, 2008. [4] M. Abdalla, E. Bresson, O. Chevassut, B. M?oller, and D. Pointcheval, 'Strong password-based authentication in tls using the three-party group diffie-hellman protocol,' International Journal of Security and Networks, vol. 2, no. 3/4, pp. 284–296, 2007. [5] M. Abdalla, E. Kiltz, and G Neven, 'Generalized key delegation for hierarchical identity-based encryption,' IET Information Security, vol. 2, no. 3, pp. 67–78, 2008. [6] M. Abdalla and B. Warinschi, 'On the Minimal Assumptions of Group Signature Schemes,' in The 2004 International Conference on Information and Communications Security (ICICS'04), LNCS 3269, pp. 1–13, 2004. [7] R.J. Anderson and M.G. Kuhn, 'Tamper Resistance - a Cautionary Note,' in The 2nd USENIX Workshop on Electronic Commerce Proceedings, pp. 1–11, Nov. 1996. [8] A. Aziz and W. Diffie, 'Privacy and authentication for wireless local area networks,' IEEE Personal Communications, vol. 1, no. 1, pp. 24–31, 1994. [9] Joonsang Baek and Kwangjo Kim, 'Remarks on the unknown key-share attacks,' IEICE Transactions on Fundamentals, vol. E83-A, no. 12, pp. 2766–2769, 2000. [10] D. Balfanz, G. Durfee, N. Shankar, D. K. Smetters, J. Staddon, and H. C.Wong, 'Secret handshakes from pairing-based key agreements,' in Proc. IEEE Symposium on Security and Privacy, pp. 180–196, 2003. [11] M. Bellare, R. Canetti, and H. Krawczyk, 'Keying hash functions for message authentication,' in Advances in Cryptology - Crypto'96, LNCS 1109, pp. 1–15, 1996. [12] M. Bellare, D. Pointcheval, and P. Rogaway, 'Authenticated and key exchange secure against dictionary attacks,' in Advances in Cryptology - EUROCRYPT 2000, LNCS 1807, pp. 139–155, 2000. [13] M. Bellare and P. Rogaway, 'Entity authentication and key distribution,' in Advances in Cryptology - CRYPTO'93, LNCS 773, pp. 232–249, 1993. [14] M. Bellare and P. Rogaway, 'Provably secure session key distribution the three party case,' in Proc. of the 27th ACM Annual Symposium on the Theory of Computing, pp. 57–66, 1995. [15] S. Bellovin and M. Merrit, “Encrypted key exchange: password-based proto- cols secure against dictionary attacks,” in Proc. IEEE Symp. on research in Security and Privacy, pp. 72–84, 1992. [16] V. Benjumea, J. Lopez, J. A. Montenegro, and J. M. Troya, “A first approach to provide anonymity in attribute certificates,” in Proc. of Public Key Cryp- tography (PKC 2004), LNCS 2947, pp. 402–415, 2004. [17] E. Biham, R. Chen, A. Joux, P. Carribault, W. Jalby, and C. Lemuet, “Col- lisions in SHA-0 and reduced SHA-1,” in Advances in Cryptology, EURO- CRYPT’05, pp. 36–57, 2005. [18] S. Blake-Wilson and A. Menezes, “Entity authentication and authenticated key transport protocols employing asymmetric techniques,” in Proc. of the 5th International Workshop on Security Protocols, LNCS 1361, pp. 137–158, 1998. [19] S. Blake-Wilson and A. Menezes, “Unknown key-share attacks on the station- to-station (STS) protocol,” in Public Key Cryptography (PKC ’99) Proceed- ings, LNCS 1560, pp. 154–170, 1999. [20] D. Boneh and M. Franklin, “Identity-based encryption from the Weil pairing,” SIAM Journal on Computing, vol. 32, no. 3, pp. 586–615, 2003. [21] D. Boneh and M. K. Franklin, “Identity based encryption from the Weil pair- ing,” in Advances in Cryptology-CRYPTO 2001, LNCS 2139, pp. 213–229, 2001. [22] E. Bresson, Olivier Chevassut, and David Pointcheval, “Provably-secure au- thenticated group diffie-hellman key exchange,” ACM Transactions on Infor- mation and System Security, vol. 10, no. 3, pp. 1–45, 2007. 188 [23] A. Burnett, K.Winters, and T. Dowling, A Java Implementation of an Elliptic Curve Cryptosystem Recent advances in Java Technology. Computer Science press, Trinity College, 2002. [24] M. Burrows, M. Abadi, and R. Needham, “A logic of authentication,” ACM Transactions on Computer Systems (TOCS), vol. 8, no. 1, pp. 18–36, 1990. [25] L. Butty’an, S. Staamann, and U. Wilhelm, “A simple logic for authentication protocol design,” Proc. of 11th IEEE Computer Security Foundations Work- shop, Rockport, pp. 153–162, 1998. [26] R. Canetti and H. Krawczyk, “Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels,” in Advances in Cryptology - EUROCRYPT 2001, LNCS 2045, pp. 453–474, 2001. [27] T. Cao and D. Lin, “Cryptanalysis of two password authenticated key ex- change protocols based RSA,” IEEE Communications Letters, vol. 10, no. 8, pp. 623–625, 2006. [28] T. Cao, D. Lin, and R. Xue, “ID-based designated-verifier proxy signatures,” IEE Proceedings-Communications, vol. 152, no. 6, pp. 989–994, 2005. [29] X. Cao, X. Zeng, W. Kou, and L. Hu, “Identity-based anonymous remote au- thentication for value-added services in mobile networks,” IEEE Transactions on Vehicular Technology, vol. 58, no. 7, pp. 3508–3517, 2009. [30] X. Cao and S. Zhong, “Breaking a remote user authentication scheme for multi-server architecture,” IEEE Communications Letters, vol. 10, no. 8, pp. 580–581, 2006. [31] C. Castelluccia, S. Jarecki, and G. Tsudik, “Secret handshakes from CA- oblivious encryption,” in Proc. Asiacrypt, LNCS 3329, pp. 293–307, 2004. 189 [32] Chi-Kwong Chan and L. M. Cheng, “Cryptanalysis of a remote user authenti- cation scheme using smart cards,” IEEE Transactions on Consumer Electron- ics, vol. 46, pp. 992–993, 2000. [33] C. C. Chang and C. S. Laih, “Remote password authentication with smart cards (correspondence),” IEE Proceedings-E, vol. 139, p. 372, July 1992. [34] C. C. Chang and H. C. Lee, “A solution to generalized group oriented cryptog- raphy,” in IFIP/Sec’92-Singapore Day2/Track2-Cryptography, pp. 289–299, 1992. [35] Y.-F. Chang, “A practical three-party key exchange protocol with round efficiency,” International Journal of Innovative Computing, Information and Control, vol. 4, no. 4, pp. 953–960, 2008. [36] H.-B. Chen, T.-H. Chen, W.-B. Lee, and C.-C. Chang, “Security enhancement for a three-party encrypted key exchange protocol against undetectable on-line password guessing attacks,” Computer Standards & Interfaces, vol. 30, no. 1-2, pp. 95–99, 2008. [37] X. Chen, F. Zhang, Y. Mu, andW. Susilo, “Efficient provably secure restrictive partially blind signatures from bilinear pairings,” in Financial Cryptography and Data Security 2006, LNCS 4107, pp. 251–265, 2006. [38] H.-Y. Chien, “Practical anonymous user authentication scheme with security proof,” Computers & Security, vol. 27, no. 5-6, pp. 216–223, 2008. [39] H.-Y. Chien and T.-C. Wu, “Provably secure password-based three-party key exchange with optimal message steps,” The Computer Journal, vol. 52, pp. 646–655, 2009. 190 [40] H.-R. Chung and W.-C. Ku, “Three weaknesses in a simple three-party key exchange protocol,” Information Sciences, vol. 178, no. 1, pp. 220–229, 2008. [41] Y. Ding and P. Horster, “Undetected on-line password guessing attacks,” ACM Operating Systems Review, vol. 29, no. 4, pp. 77–86, 1995. [42] R. Dingledine, N. Mathewson, and P. Syverson, “Tor: the second-generation onion router,” in Proceedings of the 13th USENIX security symposium, p. 303V320, 2004. [43] C.-I Fan, Y.-C. Chan, and Z.-K. Zhang, “Robust remote authentication scheme with smart cards,” Computers & Security, vol. 24, pp. 619–628, 2005. [44] C.-I Fan and C.-L. Lei, “Low-computation blind signature schemes based on quadratic residues,” Electronic Letters, vol. 32, no. 17, pp. 1569–1570, 1996. [45] T. Frey, M. M?uller, and H. R?uck, “The tate pairing and the discrete logarithm applied to elliptic curve cryptosystems,” IEEE Transactions on Information Theory, vol. 45, no. 5, pp. 1717–1719, 1999. [46] C. Garrigues, N. Migas, W. Buchanan, S. Robles, and J. Borrell, “Protecting mobile agents from external replay attacks,” Journal of Systems and Software, vol. 82, no. 2, pp. 197–206, 2009. [47] S. M. Ghanem and H. A. Wahah, “A simple XOR-based technique for dis- tributing group key secure multicasting,” in Proc. of 5th IEEE Symposium on Computers and Communications, pp. 166–171, 2000. [48] M. Girault, “An identity-based identification scheme based on discrete log- arithms modulo a composite number,” in EUROCRYPT’90, pp. 481–486, Springer-Verlag, 1991. 191 [49] J. Go and K. Kim, “Wireless authentication protocol preserving user anonymity,” in Proceedings of the 2001 Symposium on Cryptography and In- formation Security (SCIS 2001), pp. 159–164, 2001. [50] F. Guo, Y. Mu, and Z. Chen, “Mutative identity-based signatures or dynamic credentials without random oracles,” in 6th International Conference Cryptol- ogy and Network Security, LNCS 4856, pp. 1–14, 2007. [51] P. Gutman, “Secure Deletion of Data from Magnetic and Solid-State Mem- ory,” in Sixth USENIX Security Symposium Proceedings, pp. 77–89, July 1996. [52] D. Hankerson, A. Menezes, and S. Vanstone, Guide to elliptic curve cryptog- raphy. New York, USA: LNCS, Springer-Verlag, 2004. [53] L. Harn and H.-Y. Lin, “Authenticated key agreement without using one-way hash functions,” Electronics Letters, vol. 37, no. 10, pp. 629–630, 2001. [54] L. Harn and Y. Lin, “A non-repudiation metering scheme,” IEEE Communi- cation Letters, vol. 5, no. 12, pp. 486–487, 2001. [55] G. Horn and B. Preneel, “Authentication and payment in future mobile sys- tems,” in Computer Security - ESORICS’98, LNCS 1485, pp. 277–293, 1998. [56] Bin-Tsan Hsieh, Hung-Min Sun, and Tzonelih Hwang, “Cryptanalysis of en- hancement for simple authenticated key agreement algorithm,” IEE Electron- ics Letters, vol. 38, no. 1, pp. 20–21, 2002. [57] C.-L. Hsu and Y.-H. Chuang, “A novel user identification scheme with key distribution preserving user anonymity for distributed computer networks,” Information Sciences, vol. 179, no. 4, pp. 422–429, 2009. 192 [58] C.-M. Huang, T.-H. Hsu, and M.-F. Hsu, “Network-aware P2P file sharing over the wireless mobile networks,” IEEE Transactions on Selected Areas in Communications, vol. 25, no. 1, pp. 204–210, 2007. [59] H. Huang and Z. Cao, “A Novel and Efficient Unlinkable Secret Handshakes Scheme,” IEEE Communications Letters, vol. 13, no. 5, pp. 363–365, 2009. [60] R.-J. Hwang and S.-H. Shiau, “Provably efficient authenticated key agreement protocol for multi-servers,” The Computer Journal, vol. 50, pp. 602–615, 2007. [61] R.-J. Hwang and F.-F. Su, “A new efficient authentication protocol for mobile networks,” Computer Standards & Interfaces, vol. 28, pp. 241–252, 2005. [62] Y. Itakura, M. Yokozawa, and T. Shinohara, “Model analysis of digital copy- right piracy on p2p networks,” in 2004 International Symposium on Applica- tions and the Internet Workshops, pp. 84–89, 2004. [63] M. Izabach’ene and D. Pointcheval, “New anonymity notions for identity-based encryption,” in Proceedings of the 6th Conference on Security and Cryptogra- phy for Networks (SCN’08), LNCS 5229, pp. 375–391, 2008. [64] J.-K. Jan and W.-D. Lin, “An efficient anonymous channel protocol in wire- less communications,” IEICE Transactions on Communications, vol. E84-B, pp. 494–491, 2001. [65] S. Jarecki, J. Kim, and G. Tsudik, “Group secret handshakes, or affiliation- hiding authenticated group key agreement,” in Topics in Cryptology - CT-RSA 2007, LNCS 4377, pp. 287–308, 2007. [66] S. Jarecki, J. Kim, and G. Tsudik, “Beyond secret handshakes: affiliation- hiding authenticated key exchange,” in Topics in Cryptology - CT-RSA 2008, LNCS 4964, pp. 352–369, 2008. 193 [67] S. Jarecki and X. Liu, “Unlinkable secret handshakes and key-privacy in group key management scheme,” in Applied Cryptography and Network Security, LNCS 4521, pp. 270–287, 2007. [68] A. Joux, “A one round protocol for tripartite Diffie-Hellman,” in Proceedings of the 4th international symposium on algorithmic number theory, LNCS 1838, pp. 385–394. USA: Springer-Verlag, 2000. [69] W.-S. Juang, “Efficient multi-server password authenticated key agreement using smart cards,” IEEE Transactions On Consumer Electronics, vol. 50, no. 1, pp. 251–255, 2004. [70] W.-S. Juang, “Efficient password authenticated key agreement using smart cards,” Computers & Security, vol. 23, pp. 167–173, 2004. [71] W.-S. Juang, “A simple and efficient conference scheme for mobile communi- cations,” in Proc. of the 6th International Workshop on Information Security Applications, LNCS 3786, pp. 81–95, 2006. [72] W.-S. Juang, “D-Cash: A Flexible Pre-paid E-cash Scheme for Date- attachment,” Electronic Commerce Research and Applications, vol. 6, no. 1, pp. 74–80, 2007. [73] W.-S. Juang, S.-T. Chen, and H.-T. Liaw, “Robust and efficient passwordau- thenticated key agreement using smart cards,” IEEE Transactions on Indus- trial Electronics, vol. 55, no. 6, pp. 2551–2556, 2008. [74] W.-S. Juang, C.-L. Lei, and C.-Y. Chang, “Anonymous channel and authen- tication in wireless communications,” Computer Communications, vol. 22, no. 15-16, pp. 1502–1511, 1999. 194 [75] W.-S. Juang, C.-L. Lei, and H.-T. Liaw, “A verifiable multi-authority secret election allowing abstention from voting,” The Computer Journal, vol. 45, no. 6, pp. 672–682, 2002. [76] W.-S. Juang and W.-K. Nien, “Efficient password authenticated key agree- ment using bilinear pairings,” Mathematical and Computer Modelling, vol. 47, no. 11-12, pp. 1238–1245, 2008. [77] T. Kalker, D.H.J. Epema, P.H. Hartel, R.L. Lagendijk, and M. Van Steen, “Music2Share - copyright-compliant music sharing in P2P systems,” Proceed- ings of the IEEE, vol. 92, no. 6, pp. 961–970, 2004. [78] Toshinobu Kaneko, “A known-plaintext attack of feal-4 based on the system of linear equations on difference,” in Advances in Cryptology - ASIACRYPT’91, LNCS 739, pp. 485–488, 1993. [79] J. Katz, R. Ostrovsky, and M. Yung, “Efficient password-authenticated key exchange using human-memorable passwords,” in Proceedings of the Interna- tional Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology, LNCS 2045, pp. 475–494, 2001. [80] S.-W. Kim, S. Park, J.-I. Won, and S.-W. Kim, “Privacy preserving data mining of sequential patterns for network traffic data,” Information Sciences, vol. 178, no. 3, pp. 694–713, 2008. [81] P. Kocher, J. Jaffe, and B. Jun, “Differential power analysis,” in Advances in Cryptology, CRYPTO’99, pp. 388–397, 1999. [82] H. Krawczyk, M. Bellare, and R. Canetti. “Keyed-hashing for message au- thentication,”. Tech. Rep. Request for Comments (RFC) 2104, Internet En- gineering Task Force, February 1997. 195 [83] W.-C. Ku and S.-T. Chang, “Impersonation attack on a dynamic id-based remote user authentication scheme using smart cards,” IEICE Transactions on Communications, vol. E88-B, no. 5, pp. 2165–2167, 2005. [84] W.-K. Lai, C.-S. Shieh, and Y.-C. Kuo, “Reliable broadcasting in ad hoc wireless networks with mac mini-slots and directional antennas,” International Journal of Innovative Computing, Information and Control, vol. 3, no. 6(A), pp. 1487–1500, 2007. [85] L. Lamport, “Password authentication with insecure communication,” cacm, vol. 24, pp. 770–772, November 1981. [86] K. Lauter, “The advantages of elliptic curve cryptography for wireless secu- rity,” IEEE Wireless Communications, vol. 11, no. 1, pp. 62–67, 2004. [87] C.-C. Lee, M.-S. Hwang, and I-E. Liao, “Security enhancement on a new au- thentication scheme with anonymity for wireless environments,” IEEE Trans- actions on Industrial Electronics, vol. 53, no. 5, pp. 1683–1687, 2006. [88] J. K. Lee, S. R. Ryu, and K. Y. Yoo, “Fingerprint-based remote user au- thentication scheme using smart cards,” Electronic Letters, vol. 38, no. 12, pp. 554–555, 2002. [89] N.-Y. LEE and M.-F. LEE, “Web Metering Scheme Based on the Bilinear Pairings,” IEICE Trans. Inf. & Syst., vol. E90-D, no. 3, pp. 688–691, 2007. [90] S.-W. Lee, H.-S. Kim, and K.-Y. Yoo, “Efficient verifier-based key agreement protocol for three parties without server’s public key,” Applied Mathematics and Computation, vol. 167, pp. 996–1003, 2005. 196 [91] T.-F. Lee, S.-H. Chang, T. Hwang, and S.-K. Chong, “Enhanced delegation- based authentication protocol for PCSs,” IEEE Transactions on Wireless Communications, vol. 8, no. 5, pp. 2166–2171, 2009. [92] T.-F. Lee, J.-L. Liu, M.-J. Sung, S.-B. Yang, and C.-M. Chen, “Communication-efficient three-party protocols for authentication and key agreement,” Computers & Mathematics with Applications, vol. 58, no. 4, pp. 641–648, 2009. [93] W.-B. Lee and C.-C. Chang, “User identification and key distribution main- taining anonymity for distributed computer network,” Computer Systems Sci- ence and Engineering, vol. 15, no. 4, pp. 113–116, 1999. [94] W.-B. Lee, C.-C. Wu, and W.-J. Tsaur, “A novel deniable authentication protocol using generalized elgamal signature scheme,” Information Sciences, vol. 177, no. 6, pp. 1376–1381, 2007. [95] F. Li, X. Xin, and Y. Hu, “Indentity-based broadcast signcryption,” Computer Standards & Interfaces, vol. 30, no. 1-2, pp. 89–94, 2008. [96] L.-H. Li, I.-C. Lin, and M.-S. Hwang, “A remote password authentication scheme for multi-server architecture using neural networks,” IEEE Transac- tions on Neural Networks, vol. 12, no. 6, pp. 1498–1504, 2001. [97] X. Li, W. Qiu, D. Zheng, K. Chen, and J. Li, “Anonymity enhance- ment on robust and efficient password-authenticated key agreement us- ing smart cards,” IEEE Transactions on Industrial Electronics, 2009. 10.1109/TIE.2009.2028351. 197 [98] I.-E. Liao, C.-C. Lee, and M.-S. Hwang, “A password authentication scheme over insecure networks,” Journal of Computer and System Sciences, vol. 72, pp. 727–740, 2006. [99] Y.-P. Liao and S.-S. Wang, “A secure dynamic id based remote user authen- tication scheme for multi-server environment,” Computer Standards & Inter- faces, vol. 31, no. 1, pp. 24–29, 2009. [100] C.-L. Lin and C.-P. Hung, “Impersonation attack on two-gene-relation pass- word authentication protocol (2GR),” IEICE Transactions on Communica- tions, vol. E89-B, no. 12, pp. 3425–3427, 2006. [101] I.-C. Lin and C.-C. Chang, “A countable and time-bound password-based user authentication scheme for the applications of electronic commerce,” Informa- tion Sciences, vol. 179, no. 9, pp. 1269–1277, 2009. [102] I.-C. Lin, M.-S. Hwang, and L.-H. Li, “A new remote user authentication scheme for multi-server architecture,” Future Generation Computer Systems, vol. 19, pp. 13–22, 2003. [103] X. Lou, K. Hwang, and R. Zhou, “Integrated copyright protection in peer-to- peer networks,” in 27th International Conference on Distributed Computing Systems Workshops, pp. 28–35, June 2007. [104] R. Lu, Z. Cao, L. Wang, and C. Sun, “A secure anonymous routing protocol with authenticated key exchange for ad hoc networks,” Computer Standards and Interfaces, vol. 29, no. 5, pp. 521–527, 2007. [105] V. P. Gulati M. L. Das, A. Saxena and D. B. Phatak, “A novel remote user authentication scheme using bilinear pairings,” Computers & Security, vol. 25, pp. 184–189, 2006. 198 [106] K. Mangipudi and R. Katti, “A secure identification and key agreement pro- tocol with user anonymity (SIKA),” Computers & Security, vol. 25, no. 6, pp. 420–425, 2006. [107] D. Manini and M. Gribaudo, “Modelling Search, Availability, and Paral- lel Download in P2P File Sharing Applications with Fluid Model,” in In- ternational Conference on Advanced Computing and Communications, 2006, pp. 449–454, Dec. 2006. [108] U.M. Maurer and Y. Yacobi, “A non-interactive public-key distribution sys- tem,” Designs, Codes and Cryptography, vol. 9, no. 3, pp. 305–316, 1996. [109] A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography. CRC Press LLC, 1997. [110] T. Menezes, Okamoto, and S. Vanstone, “Reducing elliptic curve logarithms to logarithms in a finite field,” IEEE Transactions Information Theory, vol. 39, no. 5, pp. 1639–1646, 1993. [111] R. C. Merkle, “One-way hash functions and DES,” in Advances in Cryptology, CRYPTO’89, LNCS 435, pp. 428–446, 1989. [112] T. S. Messerges, E. A. Dabbish, and R. H. Sloan, “Examining smart card security under the threat of power analysis attacks,” IEEE Transactions on Computers, vol. 51, no. 5, pp. 541–552, 2002. [113] S. Minghui, S. Xuemin, and J. W. Mark, “IEEE 802.11 roaming and authen- tication in wireless LAN/cellular mobile networks,” IEEE Wireless Commu- nications, vol. 11, no. 4, pp. 66–75, 2004. 199 [114] M. Minier, R. C. W. Phan, and B. Pousse, “Distinguishers for ciphers and known key attack against rijndael with large blocks,” in AFRICACRYPT 2009, LNCS 5580, pp. 60–76, 2009. [115] NIST. “FIPS 140-2, Security Requirements for Cryptographic Modules,”, 2001. [116] S. Oh, J. Kwak, and D. Won, “An efficient hybrid cryptosystem providing authentication for sender’s identity,” in ICOIN 2003, LNCS 2662, pp. 737– 747, 2003. [117] Dave Otway and Owen Rees, “Efficient and timely mutual authentication,” Operating Systems Review, Jan 1987. [118] L. Owens, A. Duffy, and T. Dowling, “An identity based encryption system,” in Proc. of the 3rd International Symposium on Principles and Practice of Programming in Java, pp. 154–159, June 2004. [119] D. G. Park, C. Boyd, and S. J. Moon, “Forward secrecy and its application to future mobile communication security,” in Proceedings of the Third Interna- tional Workshop on Practice and Theory in Public Key Cryptosystems (PKC 2000), LNCS 1751, pp. 433–445, 2000. [120] W. Patterson, Mathematical Cryptology for Computer Scientists and Mathe- maticians. Rowman, 1987. [121] M. Peyravian, A. Roginsky, and N. Zunic, “Hash-based encryption system,” Computers & Security, vol. 18, pp. 345–350, 1999. [122] R. C.-W. Phan, W.-C. Yau, and B.-M. Goi, “Cryptanalysis of simple three- party key exchange protocol (S-3PAKE),” Information Sciences, vol. 178, no. 13, pp. 2849–2856, 2008. 200 [123] M. Raya, D. Jungels, P. Papadimitratos, I. Aad, and J.P. Hubaux. “Certificate revocation in vehicular ad hoc networks,”. tech. rep., Technical LCA-Report- 2006-006, LCA, 2006. [124] M. A. Reid and M. S. Madan, “Security issues in the use of smart cards,” Computer Communications, vol. 12, pp. 25–30, Feb. 1989. [125] H.-S. Rhee, J.-O. Kwon, and D.-H. Lee, “A remote user authentication scheme without using smart cards,” Computer Standards & Interfaces, vol. 31, no. 1, pp. 6–13, 2009. [126] R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital sig- nature and public-key cryptosystem,” Communications of the ACM, vol. 21, no. 2, pp. 120–126, 1978. [127] K.H. Rosen, Elementary Number Theory and its Applications. Addison- Wesley, Reading, MA, 1988. [128] RSA Laboratories’ Frequently Asked Questions About Today’s Cryptography, V4.0[Online], “Available: http://www.rsasecurity.com/rsalabs/faq/,”. [129] S. Saeednia and H. Ghodosi, “A self-certified group-oriented cryptosystem without a combiner,” in The Second Australasian Confonference on Informa- tion Security and Privacy, LNCS 1587, pp. 192–201, Sydney, Australia, 1999. [130] B. Schneier, Applied cryptography, 2nd edition. John Wiley & Sons Inc., 1996. [131] C. P. Schnorr, “Key distribution system using ID-related information directory suitable for mail systems,” in Proceedings of SECURICOM’90, pp. 115–122, 1990. 201 [132] D. Shah and S. Zhong, “Two methods for privacy preserving data mining with malicious participants,” Information Sciences, vol. 177, no. 23, pp. 5463–5483, 2007. [133] W.-G. Shieh and J.-M. Wang, “Efficient remote mutual authentication and key agreement,” Computers & Security, vol. 25, pp. 72–77, 2006. [134] D. Sisalem, J. Kuthan, and S. Ehlert, “Denial of service attacks targeting a sip voip infrastructure: attack scenarios and prevention mechanisms,” IEEE Network, vol. 20, no. 5, pp. 26–31, 2006. [135] R. Su, “On the Security of a Novel and Efficient Unlinkable Secret Handshakes Scheme,” IEEE Communications Letters, vol. 13, no. 9, pp. 712–713, 2009. [136] D.-Z. Sun, J.-P. Huai, J.-Z. Sun, J.-X. Li, J.-W. Zhang, and Z.-Y. Feng, “Im- provements of Juang et al.’s password-authenticated key agreement scheme us- ing smart cards,” IEEE Transactions on Industrial Electronics, vol. 56, no. 6, pp. 2284–2291, 2009. [137] H.-M. Sun, B.-T. Hsieh, and S.-J. Hwang, “Secure email protocols providing perfect forward secrecy,” IEEE Communications Letters, vol. 9, no. 1, pp. 58– 60, 2005. [138] H.-M. Sun and W.-C. Ting, “A Gen2-Based RFID Authentication Protocol for Security and Privacy,” IEEE Transactions on Mobile Computing, vol. 8, no. 8, pp. 1052–1062, 2009. [139] Anne Tardy-Corfdir and Henri Gilbert, “A Known Plaintext Attack of FEAL-4 and FEAL-6,” in Advances in Cryptology - CRYPTO’91, LNCS 576, pp. 172– 182, 1992. 202 [140] J. J. Tsai, T. Hwang, and C. H. Wang, “New generalized group-oriented cryptosystem based on Diffie-Hellman scheme,” Computer Communications, vol. 22, no. 8, pp. 727–729, 1999. [141] J.-L. Tsai, “Efficient multi-server authentication scheme based on one-way hash function without verification table,” Computers & Security, vol. 27, no. 3- 4, pp. 115–121, 2008. [142] Y.-M. Tseng, “A resource-constrained group key agreement protocol for imbal- anced wireless networks,” Computers & Security, vol. 26, no. 4, pp. 331–337, 2007. [143] Y.-M. Tseng, “A secure authenticated group key agreement protocol for resource-limited mobile devices,” The Computer Journal, vol. 50, no. 1, pp. 41– 52, 2007. [144] J. van der Merwe, D.S. Dawoud, and S. McDonald, “A fully distributed proac- tively secure threshold-multisignature scheme,” IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 4, pp. 562–575, 2007. [145] Paul C. van Oorschot and Michael J. Wiener, “A Known-Plaintext Attack on Two-Key Triple Encryption,” in Advances in Cryptology - EUROCRYPT’90, LNCS 473, pp. 318–325, 1991. [146] H.Wang, F. Zhang, and Y. Sun, “Cryptanalysis of a generalized ring signature scheme,” IEEE Transactions on Dependable and Secure Computing, vol. 6, no. 2, pp. 149–151, 2009. [147] S. Wang, Z. Cao, K.-K. R. Choo, and L. Wang, “An improved identity-based key agreement protocol and its security proof,” Information Sciences, vol. 179, no. 3, pp. 307–318, 2009. 203 [148] X. M. Wang, W.-F. Zhang, J.-S. Zhang, and M.-K. Khan, “Cryptanalysis and improvement on two efficient remote user authentication scheme using smart cards,” Computer Standards & Interfaces, vol. 29, pp. 507–512, 2007. [149] A.C. Weaver and M.W. Condry, “Distributing internet services to the net- work’s edge,” IEEE Transactions on Industrial Electronics, vol. 50, pp. 404– 411, 2003. [150] H.-A. Wen, T.-F. Lee, and T. Hwang, “Provably secure three-party password- based authenticated key exchange protocol using weil pairing,” IEE Proc.- Commun., vol. 152, no. 2, pp. 138–143, 2005. [151] H.-A. Wen, C.-L. Lin, and T. Hwang, “Provably secure authenticated key exchange protocols for low power computing clients,” Computers & Security, vol. 25, pp. 106–113, 2006. [152] D. S. Wong, “Security analysis of two anonymous authentication protocols for distributed wireless networks,” in Proceedings of the Third IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2005), pp. 284–288, 2005. [153] T.-S. Wu and C.-L. Hsu, “Efficient user identification scheme with key distri- bution preserving anonymity for distributed computer networks,” Computers & Security, vol. 23, no. 2, pp. 1227–1239, 2004. [154] T. Xiang, K.-W. Wong, and X. Liao, “Cryptanalysis of a password authen- tication scheme over insecure networks,” Journal of Computer and System Sciences, vol. 74, no. 5, pp. 657–661, 2008. 204 [155] S. Xu, Y. Mu, and W. Susilo, “Secure AODV Routing Protocol Using One-Time Signature,” in Mobile Ad-hoc and Sensor Networks, LNCS 3794, pp. 288–297, 2005. [156] S. Xu and M. Yung, “k-anonymous secret handshakes with reusable creden- tials,” in 11th ACM Conference on Computer and Communications Security, pp. 158–167, New York, NY, USA, 2004. [157] Y. Yacobi, “A key distribution paradox,” in Cryptology - crypto’90, LNCS 537, pp. 268–273, Santa Barbara, California, U.S.A, 1991. [158] C.-C. Yang, Y.-L. Tang, R.-C. Wang, and H.-W. Yang, “A secure and efficient authentication protocol for anonymous channel in wireless communications,” Applied Mathematics and Computation, vol. 169, pp. 1431–1439, 2005. [159] C.-C. Yang and R.-C. Wang, 'Cryptanalysis of a user friendly remote authen- tication scheme with smart card,' Computers & Security, vol. 23, pp. 425–427, 2004. [160] G. Yang, D. S. Wong, H. Wang, and X. Deng, 'Two-factor mutual authentication based on smart cards and password,' Journal of Computer and System Sciences, vol. 74, no. 7, pp. 1160–1172, 2008. [161] J.-H. Yang and C.-C. Chang, 'An ID-based remote mutual authentication with key agreement scheme for mobile devices on elliptic curve cryptosystem,' Computers & Security, vol. 28, no. 3-4, pp. 138 – 143, 2009. [162] Y. Yang, S. Wang, F. Bao, J. Wang, and D. H. Deng, 'New efficient user iden- tification and key distribution protocol providing enhanced security,' Comput- ers & Security, vol. 23, no. 8, pp. 697–704, 2004. 205 [163] E.J. Yoon and K.Y. Yoo, 'Cryptanalysis of two user identification schemes with key distribution preserving anonymity,' in International Conference on Information and Communications Security, LNCS 3783, pp. 315–322, 2005. [164] T.-Y. Youn and Y.-H. Park, 'Security Analysis of an Unlinkable Secret Hand- shakes Scheme,' IEEE Communications Letters, vol. 14, no. 1, pp. 4–5, 2010. [165] L. Zhou, W. Susilo, and Y. Mu, 'Efficient ID-based authenticated group key agreement from bilinear pairings,” in The 2nd International Conference on Mobile Ad Hoc and Sensor Networks (MSN 2006), LNCS 4325, pp. 521–532, 2006. [166] L. Zhou, W. Susilo, and Y. Mu, 'New construction of group secret handshakes based on pairings,' in 9th International Conference on Information and Communications Security (ICICS 2007), LNCS 4861, pp. 16–30, 2007. [167] J. Zhu and J. Ma, 'A new authentication scheme with anonymity for wireless environments,' IEEE Transactions on Consumer Electronics, vol. 50, no. 1, pp. 230–234, 2004. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/44684 | - |
| dc.description.abstract | 隨著網路安全事件不斷增加，人們開始關注各種網路安全議題。然而在眾多解決網路安全威脅的機制中，使用者身份認證往往是第一步也是最重要的工作。通過使用者身份認證，系統才能夠決定要提供的服務和權限，以及進一步地計算雙方加、解密的金鑰，並用來保護之後相互傳遞的資料。隨著網路使用的熱絡，使用者開始注重個人身份隱私的保護，期望個人敏感的資訊在網路上能夠不被惡意使用者得知。
隨著各種網路環境的快速發展，使用者存取網路資源的方式已經不再侷限於過去的有線網路，而可以透過無線網路和行動網路等方式來達到目的。不論使用者利用何種形式來存取網路資源，從網路架構的角度來看，可以區分成下列幾種：(1) 主從式架構(Client/Server Architecture)；(2) 多伺服器架構(Multi-server Architecture)；(3) 行動網路(Mobile Networks)架構；(4) 隨意型網路(Adhoc Network)架構；(5) 點對點網路(Peer-to-Peer Network)架構。 本研究主要的貢獻如下： 1.在主從式架構下，本研究指出過去學者所提出植基於通行碼和智慧卡之身份認證和金鑰協議機制上安全性弱點。其弱點包含了金鑰遺失所造成的偽造問題、智慧卡遺失所造成的偽造問題、使用者隱私未能真正地保護、阻絕服務攻擊和完美地向前隱私保護之缺乏等。同時本研究也提出更強韌的機制，除了能夠解決上述的安全性問題，還能夠滿足更多的安全和隱私需求以及提升系統效能。 2.在多伺服架構下，本研究指出過去學者所提出植基於通行碼和智慧卡之身份認證和金鑰協議機制上安全性弱點。其弱點包含了伺服器的欺騙和使用者身份偽造等。同時本研究也提出更強韌的機制，除了能夠解決上述的安全性問題，還能夠滿足更多的安全和隱私需求以及提升系統效能。 3.在行動網路架構下，本研究指出過去學者所提出植基於通行碼和智慧卡以及代理簽章之身份認證和金鑰協議機制上安全性弱點。其弱點包含了漫遊的使用者身份未能保護、智慧卡遺失所造成的偽造問題以及過度索費等。同時本研究也提出更強韌的機制，除了能夠解決上述的安全性問題，還能夠滿足更多的安全和隱私需求以及提升系統效能。 4.在隨意型網路架構下，本研究指出過去學者所提出植基於智慧卡之身份認證和金鑰協議機制上使用者身份偽造的弱點。同時本研究也提出更強韌的機制，除了能夠解決上述的安全性問題，還能夠滿足更多的安全和隱私需求以及提升系統效能。 5.本研究提出在點對點網路架構下新的身份認證和金鑰協議機制。相較於過去學者的機制，本研究所提出的機制能夠同時滿足使用者身份隱私和各種不易滿足的安全以及提升系統效能。 最後，本研究利用隨機神喻模型來提升安全性證明的可靠性和精準度。在隨機神喻模型以及信賴分析下，本研究證明所提出的各個機制其安全性都能確實地被滿足。 | zh_TW |
| dc.description.abstract | Due to the rapid growth of numerous security accidents, people become more aware about various network security threats. Many solutions for these network security threats were proposed in which authentication is the first and essential step to identify whether a remote user is authorized or not. After identity authentication, a user can be held accountable and the system can decide to grant her/him a specific access privilege. Moreover, the system can generate a session key to protect future communications. In addition to security, nowadays people pay more attention to their privacy protection when they rely on the Internet to access resources and perform electronic transactions. Users are concerned that their sensitive information might be collected by outsiders and be exposed over the Internet. Unfortunately, most of the existing security solutions did not take this issue into consideration.
Today, people can access network resources ubiquitously through wired networks, wireless networks, mobile networks, and vehicle networks etc. From the network architecture point of view, the architectures can be classified into the following types: (1) client/server architecture; (2) multi-server architecture; (3) mobile networks; (4) adhoc networks; and (5) peer-to-peer networks. In this dissertation, our major contributions are that: (1) In client/server architecture, we show the weaknesses of the previous password and smart card-based authentication and key agreement schemes, where the weaknesses are the known-key attack, the smart card loss problem, the exposure of user's identity, the denial of service attack and the dissatisfaction of the perfect forward secrecy. We then propose our novel schemes to overcome the above weaknesses, to satisfy more merits and to enhance the efficiency. (2) In multi-server architecture, we show the weaknesses of the previous password and smart card-based authentication and key agreement schemes, where the weaknesses are the server spoofing and the impersonation attacks. We then propose our novel scheme to overcome the above weaknesses, to satisfy more merits and to enhance the efficiency. (3) In mobile networks, we show the weaknesses of the previous password and smart card-based and proxy signature-based authentication and key agreement schemes, where the weaknesses are the exposure of mobile user's identity, the smart card loss problem and the overcharge problem. We then propose our novel schemes to overcome the above weaknesses, to satisfy more merits and to enhance the efficiency. (4) In adhoc networks, we show the weaknesses of the previous smart card-based authentication and key agreement scheme, where the weakness is the impersonation attack. We then propose our novel scheme to overcome the above weakness, to satisfy more merits and to enhance the efficiency. (5) In P2P networks, we propose two novel authentication and key agreement schemes. Comparing with the previous schemes, our schemes can provide more merits and the efficiency with user privacy. Finally, we use the random oracle model to enhance the reliability and precision of security analysis. By the proof of the model and the BAN logic analysis, the claimed security requirements in the proposed schemes are satisfied actually. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-15T03:52:51Z (GMT). No. of bitstreams: 1 ntu-99-D95921018-1.pdf: 1258711 bytes, checksum: 2b393250ddd4f0853711b90d77ee5765 (MD5) Previous issue date: 2010 | en |
| dc.description.tableofcontents | Contents
1 Introduction . . . . . . . . . .. . . . . . . . . .. .. 9 1.1 Research Motivations . . . . . . . . . . . . . . . . 9 1.2 Backgrounds . . . . . . . . . . . . . . . . . . . . . 12 1.3 Objectives and Organization . . . . . . . . . . . . . 14 2 Preliminary . . . . . . . . . . . . . . . . . . . . .. .16 2.1 Elliptic Curve Cryptosystem . . . . . . . . . . . . . 16 2.2 Bilinear Pairings . . . . . . . . . . . . . . . . . . 18 2.3 RSA Cryptosystem . . . . . . . . . . . . . . . . . . .19 2.4 Cryptographic One-way Hash Function . . . . . . . . . 20 2.5 Symmetric Encryption Scheme . . . . . . . . . . . . . 20 2.6 MAC Function . . . . . . . . . . . . . . . . . . . . .21 3 Security Requirements . . . . . . . . . . . . . . . . . 22 3.1 Secure Authentication Scheme . . . . . . . . . . . . .22 3.2 Secure Password-based Scheme . . . . . . . . . . . . .23 3.3 Secure Smart Card-based Scheme . . . . . . . . . . . .25 3.4 Secure Key Agreement Scheme . . . . . . . . . . . . . 26 3.5 Types of User Privacy Protection . . . . . . . . . . .28 4 Authentication and Key Agreement Schemes for User Privacy Protection in Client/Server Architecture . . . . .. . . . 30 4.1 Previous Scheme in Type 1 of User Privacy Protection .31 4.1.1 Wang et al.'s scheme . . . . . . . . . . . . . . . .31 4.1.2 Weaknesses in Wang et al.'s scheme . . . . . . . . .33 4.2 Our Approach in Type 1 of User Privacy Protection . . 34 4.2.1 The Proposed Scheme . . . . . . . . . . . . . . . . 34 4.2.2 Security Considerations . . . . . . . . . . . . . . 37 4.2.3 Performance Considerations . . . . . . . . . . . . .49 4.3 Previous Schemes in Type 2 of User Privacy Protection 53 4.3.1 Juang and Nien's Scheme . . . . . . . . . . . . . . 53 4.3.2 Weaknesses on Juang and Nien's Scheme . . . . . . . . . . . . 55 4.3.3 Juang et al.'s Scheme . . . . . . . . . . . . . . . 56 4.3.4 Weaknesses on Juang et al.'s Scheme . . . . . . . . 58 4.4 Our Approach in Type 2 of User Privacy Protection . . 59 4.4.1 The Proposed Scheme . . . . . . . . . . . . . . . . 60 4.4.2 Security Considerations . . . . . . . . . . . . . . 63 4.4.3 Performance Considerations . . . . . . . . . . . . .73 5 Schemes for User Privacy Protection in Multi-server Architecture . . . . . . . . . . . . . . . . . . . . . ..77 5.1 Previous Scheme in Type 1 of User Privacy Protection .78 5.1.1 Tsai’s scheme . . . . . . . . . . . . . . . . . . .79 5.1.2 Weaknesses on Tsai's scheme . . . . . . . . . . . . 80 5.2 Previous Scheme in Type 2 of User Privacy Protection .84 5.2.1 Liao and Wang's scheme . . . . . . . . . . . . . . .84 5.2.2 Weaknesses on Liao and Wang's scheme . . . . . . . 84 5.3 Our Approach in Type 2 of User Privacy Protection . . 85 5.3.1 The Proposed Scheme . . . . . . . . . . . . . . . . 85 5.3.2 Security Considerations . . . . . . . . . . . . . . 90 5.3.3 Performance Considerations . . . . . . . . . . . . 101 6 Schemes for User Privacy Protection in Mobile Networks 104 6.1 Previous Scheme in Type 1 of User Privacy Protection 106 6.1.1 Lee et al.'s scheme . . . . . . . . . . . . . . . .106 6.1.2 Weaknesses on Lee et al.'s scheme . . . . . . . . .109 6.2 Our Approach in Type 1 of User Privacy Protection . .111 6.2.1 The Proposed Scheme . . . . . . . . . . . . . . . .111 6.2.2 Security Considerations . . . . . . . . . . . . . .113 6.2.3 Performance Considerations . . . . . . . . . . . . 122 6.3 Previous Scheme in Type 2 of User Privacy Protection 124 6.3.1 Lee et al.'s Scheme . . . . . . . . . . . . . . . .124 6.3.2 Weaknesses on Lee et al.'s Scheme . . . . . . . . .126 6.4 Our Approach in Type 2 of User Privacy Protection . .129 6.4.1 The Proposed Scheme . . . . . . . . . . . . . . . .129 6.4.2 Security Considerations . . . . . . . . . . . . . .132 6.4.3 Performance Considerations . . . . . . . . . . . . 135 7 Schemes for User Privacy Protection in Adhoc Networks .139 7.1 Previous Scheme in Type 3 of User Privacy Protection 141 7.1.1 Hsu and Chuang's scheme . . . . . . . . . . . . . .141 7.1.2 Weaknesses on Hsu and Chuang's Scheme . . . . . . .144 7.2 Our Approach in Type 3 of User Privacy Protection . .146 7.2.1 The Proposed Scheme . . . . . . . . . . . . . . . .146 7.2.2 Security Considerations . . . . . . . . . . . . . .147 7.2.3 Performance Considerations . . . . . . . . . . . . 158 7.2.4 Discussion . . . . . . . . . . . . . . . . . . . . 161 8 Schemes for User Privacy Protection in Peer-to-Peer Networks . . . . . . . . . . . . . . . . . . . .. . . . .162 8.1 Our Approaches in Type 4 of User Privacy Protection .165 8.1.1 Security Definition . . . . . . . . . . . . . . . .165 8.1.2 The Proposed Unlinkable Secret Handshakes Schemes .167 8.2 Security Considerations . . . . . . . . . . . . . . .171 8.2.1 Security Analysis . . . . . . . . . . . . . . . . .171 8.2.2 Proof of Session Key Indistinguishability . . . . .174 8.2.3 Proof of User's Privacy and Affiliation . . . . . 179 8.3 Performance Considerations . . . . . . . . . . . . . 180 9 Conclusions and Future Works . . . . . . . . . . . . . 182 9.1 Conclusions . . . . . . . . . . . . . . . . . . . . .182 9.2 Future Works . . . . . . . . . . . . . . . . . . . . 184 | |
| dc.language.iso | en | |
| dc.subject | 密碼學 | zh_TW |
| dc.subject | 單向雜湊函數 | zh_TW |
| dc.subject | 智慧卡安全 | zh_TW |
| dc.subject | 橢圓曲線密碼系統 | zh_TW |
| dc.subject | 隱私權 | zh_TW |
| dc.subject | 金鑰協議 | zh_TW |
| dc.subject | 身份識別 | zh_TW |
| dc.subject | 信賴分析 | zh_TW |
| dc.subject | 隨機神喻模型 | zh_TW |
| dc.subject | 通行碼 | zh_TW |
| dc.subject | key agreement | en |
| dc.subject | belief logic. | en |
| dc.subject | random oracle model | en |
| dc.subject | password | en |
| dc.subject | one-way hash function | en |
| dc.subject | smart card | en |
| dc.subject | elliptic curve cryptography | en |
| dc.subject | Authentication | en |
| dc.subject | privacy | en |
| dc.title | 各種通訊環境下使用者隱私保護之認證及金鑰協議之研究 | zh_TW |
| dc.title | Authentication and Key Agreement in Various Communication Environments for User Privacy Protection | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 98-2 | |
| dc.description.degree | 博士 | |
| dc.contributor.oralexamcommittee | 莊文勝(Wen-Shenq Juang),楊中皇(Chung-Huang Yang),林祝興(Chu-Hsing Lin),孫宏民(Hung-Min Sun),黃仁俊(Ren-Junn Hwang),郭斯彥(Sy-Yen Kuo),顏嗣鈞(Hsu-chun Yen) | |
| dc.subject.keyword | 身份識別,金鑰協議,隱私權,橢圓曲線密碼系統,智慧卡安全,單向雜湊函數,密碼學,通行碼,隨機神喻模型,信賴分析, | zh_TW |
| dc.subject.keyword | Authentication,key agreement,privacy,elliptic curve cryptography,smart card,one-way hash function,password,random oracle model,belief logic., | en |
| dc.relation.page | 206 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2010-07-06 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
| Appears in Collections: | 電機工程學系 | |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| ntu-99-1.pdf Restricted Access | 1.23 MB | Adobe PDF |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.