請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/37883完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 郭斯彥(Sy-Yen Kuo) | |
| dc.contributor.author | Ming-Wei Wu | en |
| dc.contributor.author | 吳明蔚 | zh_TW |
| dc.date.accessioned | 2021-06-13T15:49:03Z | - |
| dc.date.available | 2008-07-02 | |
| dc.date.copyright | 2008-07-02 | |
| dc.date.issued | 2008 | |
| dc.date.submitted | 2008-06-27 | |
| dc.identifier.citation | [1] P. McFedries, “Technically Speaking: The Spyware Nightmare,” IEEE Spectrum, vol. 42, no. 8, p. 72-72, 2005.
[2] M. B. Schmidt and K. P. Arnett, “Spyware: A Little Knowledge is a Wonderful Thing,” Communications of the ACM, New York, vol. 48, no. 8, p. 67-70, 2005. [3] Battling 'Spyware': Debate Intensifies on Controlling Deceptive Programs, Microsoft, 20 April 2004, Available at: http://www.microsoft.com/presspass/features/2004/apr04/04-20Spyware.mspx [4] G. Lawton, “Invasive Software: Who's Inside Your Computer,” IEEE Computer, vol. 35, no. 7, p. 15-18, 2002. [5] S. Saroiu, S. D. Gribble, and H. M. Levy, “Measurement and analysis of spyware in a university environment,” in Proceedings of the First Symposium on Networked Systems Design and Implementation (NSDI '04), 2004. [6] W. Aaron, “Spyware be Gone,” NetWorker, New York, vol. 9, no. 1, p. 18, 2005. [7] Y.-M. Wang, D. Beck, X. Jiang, R. Roussev, C. Verbowski, S. Chen, and S. King, “Automated Web Patrol with Strider HoneyMonkeys: Finding Web Sites That Exploit Browser Vulnerabilities,” In Proceedings of the Network and Distributed System Security (NDSS) Symposium, February 2006. Also see http://research.microsoft.com/HoneyMonkey/. [8] Q. Hu and T. Dinev, “Is Spyware an Internet Nuisance or Public Menace,” Communications of the ACM, New York, vol. 48, no. 8, p. 61-66, 2005 [9] W. Ames, “Understanding spyware: risk and response,” IEEE IT Professional, vol. 6, no. 5, p. 25-29, 2004. [10] Lavasoft Ad-Aware, http://www.lavasoftusa.com/software/adaware/ [11] Spybot Search & Destroy, http://www.safer-networking.org/ [12] Microsoft Windows Defender, http://www.microsoft.com/athome/security/spyware/software/default.mspx [13] W. Harrison and T. Bollinger, “User Confidence – and the Software Developer,” IEEE Software, vol. 21, no. 6, p. 5-8, 2004. [14] Y. M. Wang, R. Roussev, C. Verbowski, A. Johnson, M. W. Wu, Y. N. Huang, and S. Y. Kuo, “Gatekeeper: Monitoring Auto-Start Extensibility Points (ASEPs) for Spyware Management,” In Proceedings of the Usenix 18th Large Installation System Administrations (LISA’04), 2004. [15] R. S. Sandhu, “Lattice-Based Access Control Models,” IEEE Computer, vol. 26, no. 11, p. 9-19, 1993. [16] Y. Kaplan, “API Spying Techniques for Windows 9x, NT and 2000,” available at http://www.internals.com/articles/apispy/apispy.htm [17] Y. M. Wang, D. Beck, B. Vo, R. Roussev, and C. Verbowski, “Detecting Stealth Software with Strider GhostBuster,” In Proceedings of the International. Conference on Dependable Systems and Networks (DSN-DCCS), p. 368-377, 2005. [18] DLL Injection tutorial, http://www.codeproject.com/dll/DLL_Injection_tutorial.asp [19] T. Truong, “Taking Advantage of the Winlogon Notification Package,” The Code Project, Jan. 2001, available at http://www.codeproject.com/system/winlogon_notification_package.asp [20] J. Richter, “Advanced Windows,” Microsoft Press; 3rd Bk&Cdr edition (February 1997); ISBN: 1572315482. [21] O. Zaytsev, “Rootkits, Spyware/Adware, Keyloggers and Backdoors: Detection and Neutralization,” A-List Publishing (September 1, 2006); ISBN: 1931769591 [22] S. Forrest, S.A. Hofmeyr, A. Somayaji, and T.A. Longtaff, “A Sense of Self for Unix Processes,” In Proceedings of the 1996 IEEE Symposium on Security and Privacy, IEEE Computer Society Press, Los Alamitors, CA, p.120-128, 1996. [23] S. Forrest, S.A. Hofmeyr, and A. Somayaji, “Intrusion detection using sequences of system calls,” Journal of Computer Security, vol. 6, p. 151-180, 1998. [24] C. Warrender, S. Forrest, B. Pearlmutter, “Detecting Intrusions Using System Calls: Alternative Data Models,” In Proceedings of IEEE Symposium on Security and Privacy, May 9-12, 1999. [25] V. G. Jecheva, and E. P. Nikolova, “An Application of Learning Problem in Anomaly-based Intrusion Detection Systems,” In Proceedings of the Second International Conference on Availability, Reliability and Security (ARES'07), 2007. [26] A. Arnes, F. Valeur, G. Vigna, and R. Kemmerer, “Using Hidden Markov Models to Evaluate the Risks of Intrusions: System Architecture and Model Validation,” In Proceedings of the International Symposium on Recent Advances in Intrusion Detection (RAID), Hamburg, Germany, September, 2006. [27] M. Christodorescu, S. Jha, S. A. Seshia, D. Song, and R.E. Bryant, “Semantics-Aware Malware Detection,” In Proceedings of IEEE Symposium on Security and Privacy, Oakland, CA, USA, May, 2005. [28] C. Kruegel, W. Robertson, and G. Vigna, “Detecting Kernel-Level Rootkits through Binary Analysis,” In Proceedings of the Annual Computer Security Applications Conference (ACSAC), Tucson, AZ, December 2004. [29] C. C. Michael, and A. Ghosh, “Simple, state-based approaches to program-based anomaly detection,” ACM Transactions on Information and System Security, vol. 5, no. 3, p. 203-237, August, 2002. [30] Sekar R., M. Bendre, Dhurjati, and P. Bullineni, “A fast automaton-based method for detecting anomalous program behaviors,” In Proceedings of IEEE Symposium on Security and Privacy, 2001. [31] M. W. Wu, Y. M. Wang, S. Y. Kuo, and Y. N. Huang, “A Stateful Approach to Spyware Detection and Removal,” In Proceedings of the 12th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2006), Dec. 2005. [32] C. E. Shannon, “A Mathematical Theory of Communication,” The Bell Systems Technical Journal, vol. 27, p. 379-423, July, 1948. [33] L. R. Rabiner, “A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition,” In Proceedings of the IEEE, vol. 77, no. 2, p. 257-286, February, 1989. [34] M. A. Mohamed and P. D. Gader, “Handwriting Word Recognition Using Segmentation-free Hidden Markov Modeling and Segmentation-based Dynamic Programming Techniques,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, p. 548-554, May, 1996. [35] O. D. Vel, N. Liu, T. Caelli, and T. Caetano, “An Embedded Bayesian Network Hidden Markov Models for Digital Forensics,” In IEEE Intelligence and Security Informatics Conference (ISI 2006), p. 459-465, May 2006. [36] A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimal decoding algorithm,” IEE Trans. Informat. Theory, vol. IT-13, p. 260-269, April, 1967. [37] G. D. Forney, “The Viterbi Algorithm,” In Proceedings of the IEEE, vol. 61, p. 268-278, March 1973. [38] Touch, J. D., “Those pesky NATs,” IEEE Internet Computing, vol. 6-4, pp. 96, July 2002. [39] Shieh, S.-P., Ho, F.-S., et al., “Network address translators: effects on security protocols and applications in the TCP/IP stack,” IEEE Internet Computing, vol. 4-6, pp. 42–49, Nov. 2000. [40] Bidirectional peer-to-peer communication with interposing firewalls and NATs, Peer-to-peer working group, Aug. 2001 [41] Gong, L., “JXTA: a network programming environment,” IEEE Internet Computing, vol. 5-3, pp. 88–95, May 2001. [42] Miller, B.A., and Nixon, T., “Home networking with Universal Plug and Play,” IEEE Communications Magazine, vol. 39-12, pp. 104–109, Dec. 2001. [43] Rosenberg, J., Huitema, C., Mahy, R. and J. Weinberger, “STUN - Simple Traversal of UDP Through Network Address Translators,” draft-ietf-midcom-stun-05 (work in progress), December 2002. Available at http://www.ietf.org/internet-drafts/draft-ietf-midcom-stun-05.txt [44] Rosenberg, J., Weinberger, J., Mahy, R., and Huitema, C., “Traversal Using Relay NAT (TURN),” draft-rosenberg-midcom-turn-02 (work in progress), October 2003. Available at http://www.jdrosen.net/papers/draft-rosenberg-midcom-turn-02.html [45] Kegel, D., NAT and peer-to-peer networking, July 1999, available at: http://alumnus.caltech.edu/~dank/peer-nat.html [46] Holdrege, M., and Srisuresh, P., “Protocol complications with the IP network address translator,” January 2001., RFC 3027. [47] Huitema. C., Teredo: Tunneling IPv6 over UDP through NATs, June 2004., Internet-Draft (available at http://www.dfn-pca.de/bibliothek/standards/ietf/none/internet-drafts/draft-huitema-v6ops-teredo-02.txt). [48] Rosenberg, J., “Interactive connectivity establishment (ICE),” October 2003, Internet-Draft (available at http://www.jdrosen.net/papers/draft-rosenberg-sipping-ice-00.html). [49] Eppinger., J. L., “TCP connections for P2P apps: A software approach to solving the NAT problem,” Technical Report CMU-ISRI-05-104, Carnegie Mellon University, January 2005. [50] Guha, S., Takeday, Y., and Francis, P., “NUTSS: A SIP-based approach to UDP and TCP network connectivity,” In ACM SIGCOMM 2004 Workshops, August 2004. [51] Biggadike, A., Ferullo, D., Wilson, G., and Adrian Perrig., “NATBLASTER: Establishing TCP connections between hosts behind NATs,” In ACM SIGCOMM Asia Workshop, Beijing, China, April 2005. [52] Baset, S. A., and Schulzrinne, H. An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol”, In Proceedings of the INFOCOM '06 [53] Saroiu, S., Gummadi, P. K., and Gribble, S. D., “A Measurement Study of Peer-to-Peer File Sharing Systems,” In Proceedings of Multimedia Computing and Networking 2002 (MMCN'02), San Jose, CA, January 2002. [54] Lin, Y.-D., Wei, H.-Y., and Yu, S.-T. , “Building an Integrated Security Gateway: Mechanisms, Performance Evaluation, Implementation, and Research Issues,” IEEE Communication Surveys and Tutorials, Vol.4, No.1, third quarter, 2002 [55] Marketing & Branding Forecast: Online Advertising & E-mail Marketing Through 2007, Jupiter Research, available at http://www.jupitermedia.com/corporate/releases/02.09.24-spamreport.html [56] Spam to Cost U.S. Companies $10 Billion in 2003, ENT News, Jan. 9, 2003, available at http://www.entmag.com/news/article.asp?EditorialsID=5651 [57] Spam overtakes legitimate mail, ZDNet Australia, Jun. 2, 2003, available at http://www.zdnet.com.au/news/communications/0,2000061791,20275016,00.htm [58] Evan Harris, The Next Step in the Spam Control War: Greylisting, Aug. 21, 2003, available at http://projects.puremagic.com/greylisting/whitepaper.html [59] Backup MX usefulness, http://archives.neohapsis.com/archives/postfix/2002-03/0859.html [60] RMX/RMX++, http://www.danisch.de/work/security/antispam.html [61] DMP, http://www.pan-am.ca/dmp/ [62] DomainKey Library and Implementor's Tools, http://domainkeys.sourceforge.net/ [63] SPF, http://spf.pobox.com/ [64] Sender ID, http://www.microsoft.com/mscorp/safety/technologies/senderid/default.mspx [65] Androutsopoulos, I., Koutsias, J., Chandrinos, K. V., Paliouras, G., and Spyropoulos, C. D., “An evaluation of Naive Bayesian anti-spam filtering,” In Proceedings of the workshop on Machine Learning in the New Information Age, pp. 9-17, 2000. [66] Schneider, K.-M., “A comparison of event models for Naive Bayes anti-spam e-mail filtering,” In Proceedings of the 10th Conference of the European Chapter of the Association for Computational Linguistics, Budapest, Hungary, pp. 307–314, 2003. [67] Joachims, T., “Text categorization with support vector machines: Learning with many relevant features,” In Proceedings of the 10th European Conference on Machine Learning, number 1398 in LNCS. Springer Verlag, Heidelberg, DE, 1998. [68] Drucker, H., Wu, D., Vapnik, V. N., “Support Vector Machines for Spam Categorization,” IEEE Transactions on Neural Networks, Vol. 20, No. 5, Sep. 1999. [69] Schapire, R., and Singer, Y., “A boosting-based system for text categorization,” Machine Learning, 39(2/3), pp. 135-168, 2000. [70] Carreras, X. and Marquez, L., “Boosting trees for anti-spam e-mail filtering,” In Proceedings of the 4th International Conference on Recent Advances in Natural Language Processing, 2001. [71] Nicholas, T., “Using AdaBoost and Decision Stumps to Identify Spam E-mail,” June 4, 2003, available at http://nlp.stanford.edu/courses/cs224n/2003/fp/tyronen/report.pdf [72] Wolpert, D., “Stacked Generalization,” Neural Networks, 5(2):241-260, 1992. [73] Sakkis, G., Androutsopoulos, I., Paliouras, G., Karkaletsis, V., Spyropoulos, C.D., Stamatopoulos, P., “Stacking classifiers for anti-spam filtering of E-mail,” In Proceedings of the 6th Conference on Empirical Methods in Natural Language Processing, Pittsburgh, 2001 [74] Krim, J., “A spammer speaks out: In Hill testimony, bulk e-mailer says Internet providers use same tactics,” Washington Post, p. A01., May 22, 2003. [75] Sahami, M., Dumais, S., Heckerman, D., and Horvitz, E., “A Bayesian Approach to Filtering Junk Email,” In Learning for Text Categorization – Papers from the AAAI Workshop, pp. 55–62, Madison Wisconsin. AAAI Technical Report WS-98-05, 1998. [76] DCC, http://www.rhyolite.com/anti-spam/dcc/ [77] Li, K., Pu, C., and Ahamad, M., “Resisting spam delivery by TCP damping,” In the first Conference on Email and Anti-Spam (CEAS 2004), Mountain View, CA, Jul. 2004. [78] Lakshminarayanan, K., Adkins, D., Perrig, A., and Stoica, I., “Taming IP packet flooding attacks,” The 2nd Workshop on Hot Topics in Networks (HotNets-II), Nov. 2003. [79] Loder, T., Van Alstyne, M., & Walsh, R., “An economic solution to the spam problem,” Downloaded from http://papers.ssrn.com/sol3/papers.cfm?abstract_id=488444, 2003. [80] Kraut, R. E., Sunder, S., Telang, R. and Morris, J. H., “Pricing Electronic Mail to Solve the Problem of Spam,” Jul. 2003, available at http://ssrn.com/abstract=417621 [81] Turner, D. and Havey, D., “Controlling spam through lightweight currency,” In Proceedings of the Hawaii International Conference on Computer Sciences, Honolulu, HI., 2004. [82] Dwork, C. and Naor, M., “Pricing via processing or combatting junk mail,” In Lecture Notes in Computer Science 740 (Proceedings of CRYPTO'92), pp. 139-147., 1993. [83] Hashcash, http://www.hashcash.org/ [84] Franklin, M. and Malkhi, D., “Auditable metering with lightweight security,” The Journal of Computer Security, 6(4):237--255, 1998. [85] Serjantov, A. and Lewis, S., “Puzzles in P2P systems,” The 8th CaberNet Radicals Workshop, Corsica, Oct. 2003. [86] Mankins, S.M., Sangpachatanaruk , C., Znati, T., Melhem, R., Moss, D., “Proactive server roaming for mitigating Denial of Service attacks,” In Proceedings of 1st International Conference on Information Technology Research and Education (ITRE), Newark, NJ, USA, August 10-13, 2003. [87] Juels, A. and Brainard J., “Client puzzles: a cryptographic defense against connection depletion,” In Proceedings of NDSS-1999 (Networks and Distributed Security Systems), pp. 151-164, 1999. [88] Dean, D. and Stubblefield, A., “Using client puzzles to protect TLS,” In Proceedings of the 10th USENIX Security Symposium, Aug. 2001. [89] Jacobsson, M. and Juels, A., “Proofs of Work and Bread Pudding Protocols,” In Proceedings of the IFIP TC6 and TC11 JointWorking Conference on Communications and Multimedia Security (CMS '99), Kluwer, 1999. [90] Dwork, C., Goldberg, A., and Naor, M., “On memory-bound functions for fighting spam,” In Lecture Notes in Computer Science 2729 (Proceedings of CRYPTO'03), pp. 426-444, 2003. [91] Ahn, L. von, Blum, M., Hopper, N.J., and Langford, J., “CAPTCHA: Telling humans and computers apart,” In Advances in Cryptology, Eurocrypt '03, volume 2656 of Lecture Notes in Computer Science, pp. 294-311, 2003. [92] Laurie, B. and Clayton, R., “Proof-of-Work Proves Not to Work,” The Third Annual Workshop on Economics and Information Security (WEIS04), May 2004. [93] Masood, A., Fighting Spambots with .NET and AI, http://www.15seconds.com/issue/040202.htm [94] CAPTCHA Tests, http://www.captcha.net/captchas/ [95] Mori, G. and Malik, J., “Recognizing objects in adversarial clutter - Breaking a visual CAPTCHA,” In Proceedings of the Conference on Computer Vision and Pattern Recognition, Jun. 2003 [96] Mori, G. and Malik, Breaking a visual CAPTCHA, http://www.cs.berkeley.edu/~mori/gimpy/gimpy.html [97] Ioannidis, J., “Fighting spam by encapsulating policy in E-Mail addresses,” In Proceedings of NDSS'03. San Diego, CA, 2003. [98] TMDA (Tagged Message Delivery Agent), http://tmda.net/ [99] ASK (Active Spam Killer), http://a-s-k.sourceforge.net/ [100] SFM (Spam-Free Mail), http://sfm.cs.ualberta.ca/ | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/37883 | - |
| dc.description.abstract | 隨著越來越多使用者與終端設備透過網際網路來存取伺服器所提供的服務，仍有諸多的重要議題迫切地需要檢討與提出解決方案。這些問題包括1)間諜軟體入侵所帶來的安全顧慮，2)同儕式(P2P)通訊環境的連線問題，以及3)郵件伺服器的可靠度議題。
本論文提出一系列的機制與實作來解決這些問題。首先，我們提出具狀態的威脅感知移除系統(STARS)，此系統能動態地監控系統行為，並確保已移除的惡意程式無法自行修復(自癒)。再者透過觀察間諜軟體的惡意行為所建構而成的隱藏馬可夫模型(HMM)，可用來表示資安狀態的轉移機率，並可作為評估惡意軟體入侵可能性之依據。接著，為解決同儕式通訊環境下諸多終端使用者係使用私有IP位址而影響通訊雙方的連線能見度，我們提出具延展性的埠號轉換，其時間與空間複雜度極低，卻可大幅地增強傳統網路位址轉換器(NAT)的連線能力與延展性，諸多優點包括1)降低P2P穿透的競爭情況，2)系統的可用埠號透過多工可超過65,535理論值，以及3)允許單一埠號同時提供更多的應用服務。最末，大量的垃圾郵件湧入郵件轉送代理人(MTA)造成類似阻斷服務的攻擊，不僅降低伺服器的可靠度，亦為收件人帶來諸多困擾。由於沒有單一解決方案可以有效地阻絕垃圾郵件，我們提出可抵禦垃圾郵件之代理人(SRMA)，其結合多種垃圾郵件識別機制，能有效地降低甚至消彌現有的垃圾郵件氾濫之困境。 | zh_TW |
| dc.description.abstract | Nowadays, numerous clients are connected to Internet to access the applications offered by the servers, and has encountered various problems that significantly affect their user experiences. These problems are typically 1) the security concerns for spyware infection, 2) the connectivity issues in Peer-to-Peer (P2P) communications, and 3) the dependability of mail servers as well as the productivity of mail recipients.
This thesis aims to propose a suite of mechanisms that offer better security to client system and improved availability to Internet servers. First, a Stateful Threat-Aware Removal System (STARS) is proposed and implemented that at run time monitors critical system behaviors, and ensures that removed spyware does not recover after deletion (so called self-healing). Second, a Hidden Markov Model (HMM) is trained based on visible observations of spyware behaviors. The constructed HMM represents the likelihood of transitions between security states and indicates the risk level of spyware invasion. Third, in order to resolve the visibility problem between peers that used private IPv4 addresses, a scalable port forwarding (SPF) design is proposed and implemented, which introduces negligible time and space complexity. SPF enables a legacy Network Address Translation (NAT) device to significantly improve its connectivity and scalability by 1) lessening the race condition of P2P traversals, 2) multiplexing the port numbers to exceed theoretical upper bound 65,535 and 3) allowing more servers to bind to a specific port. Lastly, bulk volume of spam mails delivering to mail transfer agents (MTA), which is similar to the effect of denial of services (DoS) attacks, dramatically reduces the dependability and efficiency of networking systems. While there is no silver bullet to deter spammers and eliminate spam mails, a spam-resistible mail agent (SRMA) that employed a multi-faceted approach to have most advantages and the least disadvantages of existing anti-spam solutions. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-13T15:49:03Z (GMT). No. of bitstreams: 1 ntu-97-D92921008-1.pdf: 950029 bytes, checksum: 17f52c005902ee97181ff6d746f64c51 (MD5) Previous issue date: 2008 | en |
| dc.description.tableofcontents | 口試委員會審定書 i
誌謝 ii 中文摘要 iii Abstract iv Chapter 1 Introduction and Overview 1 Chapter 2 A Stateful Approach towards Spyware Detection and Remediation 3 2.1 Motivation 3 2.2 Self-healing Spyware: Striving for Survivability 5 2.2.1 A Trust Information Flow Problem 6 2.2.2 ASEP hooking 8 2.2.3 Stealth Techniques 10 2.2.4 Redundancy for robustness 12 2.3 Stateful Threat-Aware Removal System (STARS) 13 2.3.1 STARS Detection and Recovery Procedure 16 2.4 Discussion 18 2.4.1 Threat-level is low 19 2.4.2 Threat-level is medium 20 2.4.3 Threat-level is high 21 2.5 Summary 24 Chapter 3 Using Hidden Markov Models for Behavior Modeling of Spyware 26 3.1 Motivation 26 3.2 Characterizing Spyware Invasion 27 3.2.1 A Doubly Embedded Stochastic Process 27 3.2.2 Estimating Risk of Spyware Invasion 30 3.2.3 Implementation 31 3.3 Modeling and Training 31 3.3.1 Security States 32 3.3.2 Observations 33 3.3.3 Other HMM Parameters 34 3.4 Discussion 35 3.4.1 Spyware set 35 3.4.2 Normal set 37 3.5 Summary 39 Chapter 4 A Scalable Port Forwarding for P2P-based Applications 41 4.1 Motivation 41 4.2 Related Works 43 4.2.1 Client-based Solutions 43 4.2.2 Gateway-based Solutions 46 4.3 A Scalable Port Forwarding for P2P Networks 48 4.3.1 Conflict Resolution for Outbound Traffic 50 4.3.2 Conflict Resolution for Inbound Traffic 52 4.4 Discussion 53 4.4.1 Time and Space Complexity 53 4.4.2 Improvement 54 4.5 Summary 56 Chapter 5 A Multi-Faceted Approach towards Spam-Resistible Mail 57 5.1 Motivation 57 5.2 Related Works 58 5.2.1 Munging 58 5.2.2 Listing 59 5.2.3 Filtering 60 5.2.4 Shaping 62 5.2.5 Pricing 63 5.2.6 Challenging 63 5.2.7 Identity-hopping (aliasing) 64 5.3 A Spam-Resistible Mail Agent (SRMA) 65 5.3.1 Architecture of SRMA 66 5.3.2 Inbound e-mail 67 5.3.3 Outbound e-mail 69 5.4 Discussion 69 5.4.1 Munging, CAPTCHA and Spampots 69 5.4.2 Effectiveness of SRMA 71 5.4.3 Performance 72 5.5 Summary 73 Chapter 6 Concluding Remarks and Future Works 74 References 76 Publication List 86 | |
| dc.language.iso | en | |
| dc.subject | 可用性 | zh_TW |
| dc.subject | 間諜軟體 | zh_TW |
| dc.subject | 垃圾郵件 | zh_TW |
| dc.subject | P2P網路 | zh_TW |
| dc.subject | 安全性 | zh_TW |
| dc.subject | Spam | en |
| dc.subject | Spyware | en |
| dc.subject | Availability | en |
| dc.subject | Security | en |
| dc.subject | P2P | en |
| dc.title | 提高系統安全性與服務可用性之機制與實作 | zh_TW |
| dc.title | Mechanisms and Implementations for Enhancing System Security and Service Availability | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 96-2 | |
| dc.description.degree | 博士 | |
| dc.contributor.oralexamcommittee | 黃彥男(Yennun Huang),陳英一(Ing-Yi Chen),袁世一,蔡一鳴(I-Ming Tsai),王國禎(Gou-Jen Wang),顏嗣鈞(Hsu-chun Yen),呂學坤(Shyue-Kung Lu) | |
| dc.subject.keyword | 間諜軟體,垃圾郵件,P2P網路,安全性,可用性, | zh_TW |
| dc.subject.keyword | Spyware,Spam,P2P,Security,Availability, | en |
| dc.relation.page | 87 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2008-06-27 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
| 顯示於系所單位： | 電機工程學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-97-1.pdf 未授權公開取用 | 927.76 kB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。