MINING PATTERNS OF SEQUENTIAL MALICIOUS APIS TO DETECT MALWARE

MINING PATTERNS OF SEQUENTIAL MALICIOUS APIS TO DETECT MALWARE

Abdurrahman Pektaş1, Elif Nurdan Pektaş2 and Tankut Acarman1

1Department of Computer Engineering, Galatasaray University, İstanbul, Turkey

2Siemens Turkey, Yakack Caddesi No: 111, 34870 Kartal, Istanbul, Turkey

ABSTRACT

In the era of information technology and connected world, detecting malware has been a major security concern for individuals, companies and even for states. The New generation of malware samples upgraded with advanced protection mechanism such as packing, and obfuscation frustrate anti-virus solutions. API call analysis is used to identify suspicious malicious behavior thanks to its description capability of a software functionality. In this paper, we propose an effective and efficient malware detection method that uses sequential pattern mining algorithm to discover representative and discriminative API call patterns. Then, we apply three machine learning algorithms to classify malware samples. Based on the experimental results, the proposed method assures favorable results with 0.999 F-measure on a dataset including 8152 malware samples belonging to 16 families and 523 benign samples.

KEYWORDS

Android, Malware, Frequent Sequence Mining, Behavioural Pattern, API Calls, Dynamic Analysis

Original Source Link : http://aircconline.com/ijnsa/V10N4/10418ijnsa01.pdf

http://airccse.org/journal/jnsa18_current.html

Current Issue

July 2018, Volume 10, Number 4

Mining Patterns of Sequential Malicious APIs to Detect Malware
Abdurrahman Pektas1, Elif Nurdan Pektas2 and Tankut Acarman1, 1Galatasaray University, Turkey and 2Siemens - Turkey, Turkey
http://aircconline.com/ijnsa/V10N4/10418ijnsa01.pdf

A Method for Encrypting and Decrypting Wave Files
Mohamad M. Al-laham, Mohamad a. Mai'iteh, Hasan Rashaideh and Ziad Al-Qadi, Al-Balqa Applied University, Jordan
http://aircconline.com/ijnsa/V10N4/10418ijnsa02.pdf

http://airccse.org/journal/jnsa18_current.html

A (2, N) VISUAL CRYPTOGRAPHIC TECHNIQUE FOR BANKING APPLICATIONS

A (2, N) VISUAL CRYPTOGRAPHIC TECHNIQUE FOR BANKING APPLICATIONS

Jayanta Kumar Pal1, J. K. Mandal2 and Kousik Dasgupta3

1Department of Computer Science and Engineering, Kalyani Government Engineering College, Kalyani-741235, West Bengal, India

2 Department of Computer Science and Engineering, University of Kalyani,Kalyani-741235, West Bengal, India

3 Department of Computer Science and Engineering, Kalyani Government Engineering College, Kalyani-741235, West Bengal, India

ABSTRACT

In this paper a novel (2, n) visual cryptographic scheme has been proposed which may be useful in banking operations in the “either or survivor” mode where n is the number of generated shares, from which n-1 is the number of account holders in an account and one share should be kept to the bank authority. In this technique one account holder should stack his/her share with the share of the bank authority and the secret image for user authentication will be revealed. In this technique two consecutive pixels are taken as the one time input for the share generation process. This technique generates shares with less space overhead compared to existing techniques and may provide better security. It is also easy to implement like other techniques of visual cryptography.

KEYWORDS

(2, n) Visual cryptography, Share 

Original Source Link : http://airccse.org/journal/nsa/1010ijnsa10.pdf

http://airccse.org/journal/jnsa10_current.html

EFFICIENT AND SECURE DYNAMIC ID-BASED REMOTE USER AUTHENTICATION SCHEME WITH SESSION KEY AGREEMENT FOR MULTI-SERVER ENVIRONMENT

Rafael Martínez-Peláez1, 2, Francisco Rico-Novella1, Cristina Satizábal3 and Jacek Pomykała4 
1Telematic Engineering Department, Technical University of Catalonia 
2Licenciatura en Informatica, Universidad de la Sierra Sur
3Division de Estudios de Postgrado, Universidad de la Sierra Sur
4Faculty of Mathematics, Informatics and Mechanics, Warsaw University

ABSTRACT

In 2007, Liao-Wang proposed a dynamic ID-based remote user authentication scheme for multi-server environment using smart cards. However, Hsiang-Shih demonstrated that Liao-Wang’s scheme has security flaws. Moreover, Hsiang-Shih proposed an improvement scheme which resolves the securityflaws of Liao-Wang scheme. In this paper, we propose an enhanced remote user authentication scheme  which maintains the merits of Hsiang-Shih’s scheme. Performance evaluation demonstrated the efficiency of the proposed scheme over related works. Security analysis proved that the proposed scheme is secure against known attacks.

KEYWORDS

Low-cost Cryptography, Multi-server, Mutual Authentication, Secure Communication, Smart-card

Original Source Link : http://airccse.org/journal/nsa/1010ijnsa09.pdf
http://airccse.org/journal/jnsa10_current.html

A DISTRIBUTED TRUST MANAGEMENT FRAMEWORK FOR DETECTING MALICIOUS PACKET DROPPING NODES IN A MOBILE AD HOC NETWORK

A DISTRIBUTED TRUST MANAGEMENT FRAMEWORK FOR DETECTING MALICIOUS PACKET DROPPING NODES IN A MOBILE AD HOC NETWORK

Jaydip Sen

Innovation Lab, Tata Consultancy Services Ltd.,

Bengal Intelligent Park, Salt Lake Electronic Complex, Kolkata India

ABSTRACT

In a multi-hop mobile ad hoc network (MANET) mobile nodes communicate with each other forming a cooperative radio network. Security remains a major challenge for these networks due to their features of open medium, dynamically changing topologies, reliance on cooperative algorithms, absence of centralized monitoring points, and lack of any clear lines of defense. Most of the currently existingsecurity algorithms designed for these networks are insecure, in efficient, and have low detection accuracy for nodes’ misbehaviour. In this paper, a new approach has been proposed to bring out the complementary relationship between key distribution and misbehaviour detection for developing an integrated security solution for MANETs. The redundancy of routing inform ation in ad hoc networks is utilized to develop a highly reliable protocol that works even in presence of transient network partitioning and Byzantine failure of nodes. The proposed mechanism is fully co-operative, and thus it is more robust as the vulnerabilities of the election algorithms used for choosing the subset of nodes for cooperation are absent. Simulation results show the effectiveness of the proposed protocol. 

KEYWORDS

Mobile ad hoc network (MANET), Trust, Reputation, Controlled flooding, Malicious packet dropping,Node misbehaviour. 

Original Source Link : http://airccse.org/journal/nsa/1010ijnsa08.pdf

http://airccse.org/journal/jnsa10_current.html

EFFECT OF HASH FUNCTION ON PERFORMANCE OF LOW POWER WAKE UP RECEIVER FOR WIRELESS SENSOR NETWORK

EFFECT OF HASH FUNCTION ON PERFORMANCE OF LOW POWER WAKE UP RECEIVER FOR WIRELESS SENSOR NETWORK

Vikas Kumar1 and Rajender Kumar2 

Member IEEE Electronics & Communication Engineering Department, NIT kurukshetra

ABSTRACT

Next generation network will consist of different types of wireless networks like WSN, Wi-Fi, WiMAX, UMTS, LTE and etc. Wireless Sensor Network (WSN) finds unique and special application as compared to the said networks because sensors are deployed in a very secret, awkward and hostile environment like battle field etc. Various wireless sensor nodes are interconnected and form a Wireless Sensor Network. Sensor nodes once deployed in a region, can’t be repaired thus the power system deployed in the nodes becomes a major key issue i.e. how long its battery life can be utilised. Another major issue of WSN is to have a more secured network which is a function of hash keys. Increase usage of hash key means enhanced security but at the cost of power and area. Sensor systems must utilize the minimal possible energy while operating over secured and wide range of operating scenarios. In this paper, we have proposed a novel ID matching mechanism that uses a Bloom filter to realize wake-up wireless communication. Paper uses hash function for uniquely recognizing particular sensor- node- cluster among all clusters. Paper also shows the effect of number of hash functions on performance of wireless sensor node. The design and implementation of a wireless wake-up receiver module simulation reveals that proposed model consume 724nW dynamic power and with bloom filter, the proposed model consumes dynamic power 85% less than the consumption cited in “Takiguchi” model[1]. Dynamic power is further reduced by 10% when parallel processing is implemented. Finally paper provides a novel approach to save the dynamic power and subsequently increases the battery life of wireless sensor node and network as a whole.

KEYWORDS

Wireless sensor network (WSN), Low power, VLSI, Wake up receiver, Bloom filter 

Original Source Link : http://airccse.org/journal/nsa/1010ijnsa07.pdf

http://airccse.org/journal/jnsa10_current.html

Security in Wireless Sensor Networks: Key Management Module in SOOAWSN

Security in Wireless Sensor Networks: Key Management Module in SOOAWSN 

Mohammed A. Abuhelaleh and Khaled M. Elleithy

School of Engineering University Of Bridgeport, Bridgeport, USA

ABSTRACT

Due to high restrictions in wireless sensor networks, where the resources are limited, clustering protocols for routing organization have been proposed in much research for increasing system throughput, decreasing system delay and saving energy. Even these algorithms have proposed some levels of security, but because of their dynamic nature of communication, most of their security solutions are not suitable. In this paper we focus on how to achieve the highest possible level of security by applying new keymanagement technique that can be used during wireless sensor networks communications. For our  proposal to be more effective and applicable to a large number of wireless sensor networks applications, we work on a special kind of architecture that have been proposed to cluster hierarchy of wireless sensor networks and we pick one of the most interesting protocols that have been proposed for this kind of architecture, which is LEACH. This proposal is a module of a complete solution that we are developing to cover all the aspects of wireless sensor networks communication which is labeled Secure Object Oriented Architecture for Wireless Sensor Networks (SOOAWSN) .

KEYWORDS

LEACH (Low Energy Adaptive Clustering Hierarchy), Sensor Networks, Network Performance, Routing, Sec-LEACH (Secure LEACH), Network security, Random KD (Key Distribution), MultiGeneration Keys. 

Original Soure Link : http://airccse.org/journal/nsa/1010ijnsa06.pdf

http://airccse.org/journal/jnsa10_current.html