Mark Stamp
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Mark Stamp has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
Richard M. Low
9 shared publications- Thomas H. Austin
San Jose State University
4 shared publications Thomas H. Austin
2 shared publicationsAmrapali Dhavare
1 shared publicationAnnie H. Toderici
San Jose State University
1 shared publicationAnusha Damodaran
1 shared publication
Latest Publications
- Open Access
A Comparison of Static, Dynamic, and Hybrid Analysis for Malware Detection
In this research, we compare malware detection techniques based on static, dynamic, and hybrid analysis. Specifically, we train Hidden Markov Models (HMMs ) on both static and dynamic feature sets and compare the resulting detection rates over a substantial number of malware families. We also consider hybrid cases, where dynamic analysis is used in the training phase, with static techniques used in the detection phase, and vice versa. In our experiments, a fully dynamic approach generally yields the best detection rates. We discuss the implications of this research for malware detection based on hybrid techniques.
Open AccessA Comparison of Static, Dynamic, and Hybrid Analysis for Malware Detection
In this research, we compare malware detection techniques based on static, dynamic, and hybrid analysis. Specifically, we train Hidden Markov Models (HMMs ) on both static and dynamic feature sets and compare the resulting detection rates over a substantial number of malware families. We also consider hybrid cases, where dynamic analysis is used in the training phase, with static techniques used in the detection phase, and vice versa. In our experiments, a fully dynamic approach generally yields the best detection rates. We discuss the implications of this research for malware detection based on hybrid techniques.
- Open Access
Malware Detection Using Dynamic Birthmarks
In this paper, we explore the effectiveness of dynamic analysis techniques for identifying malware, using Hidden Markov Models (HMMs) and Profile Hidden Markov Models (PHMMs), both trained on sequences of API calls. We contrast our results to static analysis using HMMs trained on sequences of opcodes, and show that dynamic analysis achieves significantly stronger results in many cases. Furthermore, in contrasting our two dynamic analysis techniques, we find that using PHMMs consistently outperforms our analysis based on HMMs.
Open AccessMalware Detection Using Dynamic Birthmarks
In this paper, we explore the effectiveness of dynamic analysis techniques for identifying malware, using Hidden Markov Models (HMMs) and Profile Hidden Markov Models (PHMMs), both trained on sequences of API calls. We contrast our results to static analysis using HMMs trained on sequences of opcodes, and show that dynamic analysis achieves significantly stronger results in many cases. Furthermore, in contrasting our two dynamic analysis techniques, we find that using PHMMs consistently outperforms our analysis based on HMMs.
- 11 September 2014
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 11 (2) , 89-102
Hunting for metamorphic JavaScript malware
- 11 September 2014
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 11 (2) , 89-102
Hunting for metamorphic JavaScript malware
- 7 September 2014
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 10 (4) , 273-297
Automating NFC message sending for good and evil
- 7 September 2014
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 10 (4) , 273-297
Automating NFC message sending for good and evil
- 24 July 2014
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 11 (4) , 203-216
Singular value decomposition and metamorphic detection
- 24 July 2014
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 11 (4) , 203-216
Singular value decomposition and metamorphic detection
- 23 May 2014
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 11 (2) , 59-73
Hidden Markov models for malware classification
- 23 May 2014
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 11 (2) , 59-73
Hidden Markov models for malware classification
- 4 May 2014
- Published by Taylor & Francis in Information Security Journal: A Global Perspective
- Vol. 23 (3) , 68-85
Hunting for Pirated Software Using Metamorphic Analysis
In this article, we consider the problem of detecting software that has been pirated and modified. We analyze a variety of detection techniques that have been previously studied in the context of malware detection. For each technique, we empirically determine the detection rate as a function of the degree of modification of the original code. We show that the code must by substantially modified before we fail to reliably distinguish it, and we show that our results offer a significant improvement over previous related work. Our approach can be applied retroactively to existing software and does not require access to the source code, and hence it is both practical and effective.
- 4 May 2014
- Published by Taylor & Francis in Information Security Journal: A Global Perspective
- Vol. 23 (3) , 68-85
Hunting for Pirated Software Using Metamorphic Analysis
In this article, we consider the problem of detecting software that has been pirated and modified. We analyze a variety of detection techniques that have been previously studied in the context of malware detection. For each technique, we empirically determine the detection rate as a function of the degree of modification of the original code. We show that the code must by substantially modified before we fail to reliably distinguish it, and we show that our results offer a significant improvement over previous related work. Our approach can be applied retroactively to existing software and does not require access to the source code, and hence it is both practical and effective.
- 3 April 2014
- Published by Taylor & Francis in Cryptologia
- Vol. 38 (2) , 116-132
Cryptanalysis of Typex
Rotor cipher machines played a large role in World War II: Germany used Enigma; America created Sigaba; Britain developed Typex. The breaking of Enigma by Polish and (later) British cryptanalysts had an enormous impact on the war. However, despite being based on the commercial version of the Enigma, there is no documented successful attack on Typex during its time in service. This article covers the Typex machine. Researchers consider the development of Typex, discuss how Typex works, and present and analyze two cryptanalytic attacks on the cipher. The first attack assumes the rotor wirings are known and uses Turing's crib attack—originally developed for Enigma—to recover the settings of the stepping rotors. The second attack assumes that the rotor wirings are unknown. This ciphertext-only attack uses a hill-climb to determine the wirings of the stepping rotors. Finally, researchers briefly consider an attack developed by Polish cryptanalysts to recover the Enigma rotor wirings, and they argue that Typex was significantly more resistant to this particular attack.
- 3 April 2014
- Published by Taylor & Francis in Cryptologia
- Vol. 38 (2) , 116-132
Cryptanalysis of Typex
Rotor cipher machines played a large role in World War II: Germany used Enigma; America created Sigaba; Britain developed Typex. The breaking of Enigma by Polish and (later) British cryptanalysts had an enormous impact on the war. However, despite being based on the commercial version of the Enigma, there is no documented successful attack on Typex during its time in service. This article covers the Typex machine. Researchers consider the development of Typex, discuss how Typex works, and present and analyze two cryptanalytic attacks on the cipher. The first attack assumes the rotor wirings are known and uses Turing's crib attack—originally developed for Enigma—to recover the settings of the stepping rotors. The second attack assumes that the rotor wirings are unknown. This ciphertext-only attack uses a hill-climb to determine the wirings of the stepping rotors. Finally, researchers briefly consider an attack developed by Polish cryptanalysts to recover the Enigma rotor wirings, and they argue that Typex was significantly more resistant to this particular attack.
- 30 November 2013
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 10 (3) , 177-187
Metamorphic code generation from LLVM bytecode
- 30 November 2013
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 10 (3) , 177-187
Metamorphic code generation from LLVM bytecode
- 15 October 2013
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 10 (1) , 53-65
Eigenvalue analysis for metamorphic detection
- 15 October 2013
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 10 (1) , 53-65
Eigenvalue analysis for metamorphic detection