Access the full text.
Sign up today, get DeepDyve free for 14 days.
TCG Specification Architecture Overview Specification Revision 1 . 4 [ EB / OL ] . [ 2010 - 0310 ]
D. Wagner, Drew Dean (2001)
Intrusion detection via static analysisProceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001
Jonathon Giffin, S. Jha, B. Miller (2002)
Detecting Manipulated Remote Call Streams
Li Wen (2009)
Context Sensitive Host-Based IDS Using Hybrid AutomatonJournal of Software
R. Gopalakrishna, E. Spafford, J. Vitek (2005)
Efficient intrusion detection using automaton inlining2005 IEEE Symposium on Security and Privacy (S&P'05)
Zhang Huanguo, Luo Jie, J. Gang, Z. Zhiqiang, Yu Fajiang, Yan Fei (2006)
Development of trusted computing researchWuhan University Journal of Natural Sciences, 11
H. Feng, Jonathon Giffin, Yong Huang, S. Jha, Wenke Lee, B. Miller (2004)
Formalizing sensitivity in static analysis for intrusion detectionIEEE Symposium on Security and Privacy, 2004. Proceedings. 2004
Scott Rotondo (2011)
Trusted Computing Group
Jonathon Giffin, D. Dagon, S. Jha, Wenke Lee, B. Miller (2005)
Environment-Sensitive Intrusion Detection
Wen Li, Yingxia Dai, Yifeng Lian, Ping Feng (2009)
Context Sensitive Host-Based IDS Using Hybrid Automaton: Context Sensitive Host-Based IDS Using Hybrid AutomatonJournal of Software, 20
Changxiang Shen, Huanguo Zhang, D. Feng, Z. Cao, Jiwu Huang (2007)
Survey of information securityScience in China Series F: Information Sciences, 50
D. Boneh (2002)
Proceedings of the 11th USENIX Security Symposium
Zhi-min Gao, S. Wang (2010)
Survey of Information Security Risk Assessment2010 International Conference on Electrical and Control Engineering
Trusted computing research and development [ J ]
Current trusted computing platform only verifies application’s static Hash value, it could not prevent application from being dynamic attacked. This paper gives one static analysis-based behavior model building method for trusted computing dynamic verification, including control flow graph (CFG) building, finite state automata (FSA) constructing, ɛ run cycle removing, ɛ transition removing, deterministic finite state (DFA) constructing, trivial FSA removing, and global push down automata (PDA) constructing. According to experiment, this model built is a reduced model for dynamic verification and covers all possible paths, because it is based on binary file static analysis.
Wuhan University Journal of Natural Sciences – Springer Journals
Published: Jun 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.