Paul Black
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Paul Black has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Iqbal Gondal
Internet Commerce Security Laboratory (ICSL), Federation University, Ballarat 3353, Australia
4 shared publications Iqbal Gondal
ICSL, Federation University
2 shared publications- Joarder Kamruzzaman
Federation University Australia
2 shared publications - Paul Watters
Department of Security Studies and Criminology, Macquarie University, Sydney, NSW 2109, Australia
2 shared publications Peter Vamplew
SEIT, Federation University
2 shared publications- A. S. M. Kayes
Department of Computer Science and Information Technology, La Trobe University, Melbourne, VIC, Australia
1 shared publication
Latest Publications
- 24 November 2022
- Published by Springer Nature
- p. 15-27
Spam Email Categorization with NLP and Using Federated Deep Learning
- 24 November 2022
- Published by Springer Nature
- p. 15-27
Spam Email Categorization with NLP and Using Federated Deep Learning
- Open Access
- 8 July 2021
- Published by MDPI AG in Electronics
- Vol. 10 (14) , 1628
Malware Variant Identification Using Incremental Clustering
Dynamic analysis and pattern matching techniques are widely used in industry, and they provide a straightforward method for the identification of malware samples. Yara is a pattern matching technique that can use sandbox memory dumps for the identification of malware families. However, pattern matching techniques fail silently due to minor code variations, leading to unidentified malware samples. This paper presents a two-layered Malware Variant Identification using Incremental Clustering (MVIIC) process and proposes clustering of unidentified malware samples to enable the identification of malware variants and new malware families. The novel incremental clustering algorithm is used in the identification of new malware variants from the unidentified malware samples. This research shows that clustering can provide a higher level of performance than Yara rules, and that clustering is resistant to small changes introduced by malware variants. This paper proposes a hybrid approach, using Yara scanning to eliminate known malware, followed by clustering, acting in concert, to allow the identification of new malware variants. score and V-Measure clustering metrics are used to evaluate our results.- 8 July 2021
- Published by MDPI AG in Electronics
- Vol. 10 (14) , 1628
Open AccessMalware Variant Identification Using Incremental Clustering
Dynamic analysis and pattern matching techniques are widely used in industry, and they provide a straightforward method for the identification of malware samples. Yara is a pattern matching technique that can use sandbox memory dumps for the identification of malware families. However, pattern matching techniques fail silently due to minor code variations, leading to unidentified malware samples. This paper presents a two-layered Malware Variant Identification using Incremental Clustering (MVIIC) process and proposes clustering of unidentified malware samples to enable the identification of malware variants and new malware families. The novel incremental clustering algorithm is used in the identification of new malware variants from the unidentified malware samples. This research shows that clustering can provide a higher level of performance than Yara rules, and that clustering is resistant to small changes introduced by malware variants. This paper proposes a hybrid approach, using Yara scanning to eliminate known malware, followed by clustering, acting in concert, to allow the identification of new malware variants. score and V-Measure clustering metrics are used to evaluate our results. - Open Access
- 7 June 2021
- Published by MDPI AG in Electronics
- Vol. 10 (11) , 1356
Cross-Compiler Bipartite Vulnerability Search
Open-source libraries are widely used in software development, and the functions from these libraries may contain security vulnerabilities that can provide gateways for attackers. This paper provides a function similarity technique to identify vulnerable functions in compiled programs and proposes a new technique called Cross-Compiler Bipartite Vulnerability Search (CCBVS). CCBVS uses a novel training process, and bipartite matching to filter SVM model false positives to improve the quality of similar function identification. This research uses debug symbols in programs compiled from open-source software products to generate the ground truth. This automatic extraction of ground truth allows experimentation with a wide range of programs. The results presented in the paper show that an SVM model trained on a wide variety of programs compiled for Windows and Linux, x86 and Intel 64 architectures can be used to predict function similarity and that the use of bipartite matching substantially improves the function similarity matching performance.
- 7 June 2021
- Published by MDPI AG in Electronics
- Vol. 10 (11) , 1356
Open AccessCross-Compiler Bipartite Vulnerability Search
Open-source libraries are widely used in software development, and the functions from these libraries may contain security vulnerabilities that can provide gateways for attackers. This paper provides a function similarity technique to identify vulnerable functions in compiled programs and proposes a new technique called Cross-Compiler Bipartite Vulnerability Search (CCBVS). CCBVS uses a novel training process, and bipartite matching to filter SVM model false positives to improve the quality of similar function identification. This research uses debug symbols in programs compiled from open-source software products to generate the ground truth. This automatic extraction of ground truth allows experimentation with a wide range of programs. The results presented in the paper show that an SVM model trained on a wide variety of programs compiled for Windows and Linux, x86 and Intel 64 architectures can be used to predict function similarity and that the use of bipartite matching substantially improves the function similarity matching performance.
- 20 November 2020
- Published by Springer Nature
- p. 177-188
API Based Discrimination of Ransomware and Benign Cryptographic Programs
- 20 November 2020
- Published by Springer Nature
- p. 177-188
API Based Discrimination of Ransomware and Benign Cryptographic Programs
- Open Access
- 17 July 2020
- Published by MDPI AG in Electronics
- Vol. 9 (7) , 1163
Function Similarity Using Family Context
Finding changed and similar functions between a pair of binaries is an important problem in malware attribution and for the identification of new malware capabilities. This paper presents a new technique called Function Similarity using Family Context (FSFC) for this problem. FSFC trains a Support Vector Machine (SVM) model using pairs of similar functions from two program variants. This method improves upon previous research called Cross Version Contextual Function Similarity (CVCFS) e epresenting a function using features extracted not just from the function itself, but also, from other functions with which it has a caller and callee relationship. We present the results of an initial experiment that shows that the use of additional features from the context of a function significantly decreases the false positive rate, obviating the need for a separate pass for cleaning false positives. The more surprising and unexpected finding is that the SVM model produced by FSFC can abstract function similarity features from one pair of program variants to find similar functions in an unrelated pair of program variants. If validated by a larger study, this new property leads to the possibility of creating generic similar function classifiers that can be packaged and distributed in reverse engineering tools such as IDA Pro and Ghidra.
- 17 July 2020
- Published by MDPI AG in Electronics
- Vol. 9 (7) , 1163
Open AccessFunction Similarity Using Family Context
Finding changed and similar functions between a pair of binaries is an important problem in malware attribution and for the identification of new malware capabilities. This paper presents a new technique called Function Similarity using Family Context (FSFC) for this problem. FSFC trains a Support Vector Machine (SVM) model using pairs of similar functions from two program variants. This method improves upon previous research called Cross Version Contextual Function Similarity (CVCFS) e epresenting a function using features extracted not just from the function itself, but also, from other functions with which it has a caller and callee relationship. We present the results of an initial experiment that shows that the use of additional features from the context of a function significantly decreases the false positive rate, obviating the need for a separate pass for cleaning false positives. The more surprising and unexpected finding is that the SVM model produced by FSFC can abstract function similarity features from one pair of program variants to find similar functions in an unrelated pair of program variants. If validated by a larger study, this new property leads to the possibility of creating generic similar function classifiers that can be packaged and distributed in reverse engineering tools such as IDA Pro and Ghidra.
- 1 June 1996
- Published by SAGE Publications in Human Factors: The Journal of the Human Factors and Ergonomics Society
- Vol. 38 (2) , 250-261
Research with Patriot Air Defense Officers: Examining Information Order Effects
- 1 June 1996
- Published by SAGE Publications in Human Factors: The Journal of the Human Factors and Ergonomics Society
- Vol. 38 (2) , 250-261
Research with Patriot Air Defense Officers: Examining Information Order Effects