1 March 2012 in Computers and Electrical Engineering
9 October 2014 in Journal of Medical Systems
4 June 2013 in International Journal of Network Management
21 March 2020 in Mathematical Problems in Engineering
Recently, some graph-based methods have been proposed for malware detection. However, current malware is generally characterized by sophisticated behaviors, which makes graph-based malware detection extremely challenging. To address this issue, we propose a graph repartition algorithm by transforming API call graphs into fragment behaviors based on programs’ dynamic execution traces. The proposed algorithm relies on the N-order subgraph (NSG) for constructing the appropriate fragment behavior. Moreover, we improve the term frequency-inverse document frequency- (TF-IDF-) like measure and information gain (IG) to extract the crucial N-order subgraph (CNSG). This novel behavioral representation and improved extraction method can accurately represent crucial behaviors of malware. Experiments on 4,400 samples demonstrate that the proposed method achieves a high accuracy of 99.75% in malware detection and promising performance of 95.27% in malware classification.
4 March 2022 in IEEE Systems Journal
In blockchain-enabled applications, it is difficult to preserve privacy completely because of the openness of each signer’s public key. In this article, an efficient multiattribute-based signature scheme with key aggregation (M-ABS-KA) is presented that supports a flexible threshold predicate. This construction aggregates the public keys and provides a compact signature that is verified as a group, which realizes faster batch verification than confirming them individually. Furthermore, both the multisignature scale and the public key length are independent of the number of signers and attributes in this scheme. To the best of our knowledge, this M-ABS-KA scheme is the first multi-ABS protocol with an aggregated public key and fast batch verification. Based on the hardness of the computational Diffie–Hellman problem, it is formally proven that the proposal achieves unforgeability in the random oracle model and enjoys signer privacy. Additionally, the performance is evaluated in theoretical and experimental analyses with other related ABS schemes, and the results show that it is feasible and efficient in storage, bandwidth, and computational cost. Finally, as an illustrative application, we design a framework of the blockchain-enabled electronic health records assessment system based on this presented M-ABS-KA scheme.
7 August 2015 in Wireless Personal Communications