透過您的圖書館登入
IP:3.19.56.45
  • 學位論文

進階持續性威脅之偵測與攻擊情境重建

Detection of Advanced Persistent Threat and Reconstruction of its Attack Scenario using Graph Convolutional Recurrent Networks

指導教授 : 謝宏昀

摘要


進階持續性威脅的攻擊者會以特定的受害者為目標,並會在受害者的使用環境中潛伏很長一段時間,因此傳統基於簽名的入侵檢測系統無法有效地保留長期的入侵指標(Indicators of Compromise,IOC)。近年來,愈來愈多論文提出方法試圖解決進階持續性威脅的問題。大多數非監督式的作法使用事先設計好的規則偵測不同的攻擊步驟並檢測攻擊發生的時間。然而,這些方法需要事先了解攻擊的模式與行為,而且規則的制定耗費時間與人力,造成偵測系統維護上的困難。因此在本論文中,我們提出了一種基於非監督式機器學習的模型,該模型會主動學習環境中的正常行為,並且偵測異常行為與重建攻擊的情境,所以此方法無需制定與更新偵測所使用的規則。另外,一般審計系統的log檔在長期紀錄中會累積大量的資料,為了實時處理大量的log檔,我們採用MORSE論文中所使用的tag propagation來減少所需分析的資料量,並且利用fast localization的技術減少機器學習的模型複雜度。從實驗結果來看,我們模型的AUC score可以達到76,其表現與基於規則的檢測系統表現相似。除此之外,我們重建的攻擊情境可以包含67%的惡意實體,並且該情境圖也可標示出大部分攻擊者所使用的入侵技術。最後本論文所採用的tag propagation可以減少80%至90%的資料分析量,不僅可以加快分析速度、提高檢測系統的AUC score也可以為後續的資安分析人員提供更加簡潔的攻擊情境圖。

並列摘要


In advanced persistent threat (APT), attackers typically target a specific victim and lurk in the victim’s computer environment for a long time. Conventional signature-based detectors thus cannot effectively capture the long-term relation- ship among various indicators of compromise. In recent years, many methods have been proposed to solve this problem. Most unsupervised methods use carefully- crafted policies to model attack steps and detect the attack occurrence. However, these methods need prior knowledge of the attack and its behavior in advance. Policy formulation and refinement are both labor-intensive and time-consuming that increases the cost to deploy the APT detector. Therefore, in this thesis we propose a method based on unsupervised machine learning to detect APT and construct its attack scenario without requiring hand-crafted policy formulation. The proposed method automatically learns from normal behavior and detects the deviation dynamically through monitoring. To process a large number of logs in real time, we adapt the well-known tag-propagation method to reduce the size of the data. We also use the message-passing framework and a fast-localization technique to feed the data into a computer with limited memory. From experiment results, the proposed method can achieve an AUC score of 76, similar to the policy-based detector. The scenario graph thus constructed captures 67% of the malicious entities with few missing techniques that attackers use to achieve their goals. The graph reduction technique employed in this thesis can also reduce the data size by 80% to 90%, thus speeding up the analysis process, improving the overall AUC score, and yielding a more concise result for security analysts.

參考文獻


[1] “Mandiant: Exposing one of china’s cyber espionage units,” https://www.mandiant.com/resources/apt1-exposing-one-of-chinas-cyber-espionage-units, 2016-11-10.
[2] E. Hutchins, M. Cloppert, and R. Amin, “Intelligence-driven computer network defense informed by analysis of adversary campaigns and intrusion kill chains,” Leading Issues in Information Warfare Security Research, vol. 1, 01 2011.
[3] D. J. Pohly, S. McLaughlin, P. McDaniel, and K. Butler, “Hi-fi: Collecting high-fidelity whole-system provenance,” in Proceedings of the 28th Annual Computer Security Applications Conference, ser. ACSAC ’12. New York, NY, USA: Association for Computing Machinery, 2012, p. 259–268. Online Available at: https://doi.org/10.1145/2420950.2420989
[4] “Taiwan high-tech ecosystem targeted by foreign apt group: Digital skeleton key bypasses security measures,” https://medium.com/cycraft/taiwan-high-tech-ecosystem-targeted-by-foreign-apt-group-5473d2ad8730, 2019.
[5] M. N. Hossain, S. M. Milajerdi, J. Wang, B. Eshete, R. Gjomemo, R. Sekar, S. Stoller, and V. Venkatakrishnan, “SLEUTH: Real-time attack scenario reconstruction from COTS audit data,” in 26th USENIX Security Symposium (USENIX Security 17). Vancouver, BC: USENIX Association, Aug. 2017, pp. 487–504. Online Available at: https://www.usenix.org/conference/usenixsecurity17/technical-sessions/presentation/hossain

延伸閱讀