{"title":"A common key encryption algorithm using N-dimensional Hilbert curves","authors":"S. Kamata","doi":"10.1109/ISIAS.2011.6122832","DOIUrl":"https://doi.org/10.1109/ISIAS.2011.6122832","url":null,"abstract":"There are a lot of previous works on common key encryptions such as DES, AES, etc, In this paper, a new common key encryption algorithm is proposed using Hilbert curves which are a one-to-one mapping between N-dimensional (N-D) spaces and 1-D space (a line). This is based on a property having a sharp rise in the number of Hilbert curve patterns in N-D spaces. In the case of N = 2, there are only four patterns, while if N is 5, the number of the patterns is more than 1 billions. Operations of addition and multiplication are denned on a curve, based on a mapping of a point in N-D spaces to a point on a line. In order to realize a cryptosystem, the algorithm utilizes Hilbert ordered point addresses, which is expressed as the coordinates of the points in N-dimensional space.","PeriodicalId":139268,"journal":{"name":"2011 7th International Conference on Information Assurance and Security (IAS)","volume":"18 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131486393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hybrid Intelligent Decision Support System for credit risk assessment","authors":"H. Taremian, Mahdi Pakdaman Naeini","doi":"10.1109/ISIAS.2011.6122814","DOIUrl":"https://doi.org/10.1109/ISIAS.2011.6122814","url":null,"abstract":"The assessment of credit loan application is usually carried out by loan officers based on their own heuristic judgment. Thus, different officers may have different decisions for the same application. In order to improve the assessment objective, quantitative evaluation methods have been proposed. Statistical methods, Neural Networks, Genetic Algorithms, and other forecasting methods have been used for this purpose. The present paper proposes a new Hybrid Intelligent Decision Support System (HIDSS) for credit risk evaluation, based on neural networks and genetic algorithms. The major advantages of the proposed system are higher precision in credit evaluation of the high risk customers and higher sensitivity in the evaluation of higher value loans. The proposed system is applied on a real case study concerning loan risk evaluation by a leading branch of Mellat Bank (Iran). Results are compared to the result of other forecasting methods such as statistical method and neural network.","PeriodicalId":139268,"journal":{"name":"2011 7th International Conference on Information Assurance and Security (IAS)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132685000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"AES-512: 512-bit Advanced Encryption Standard algorithm design and evaluation","authors":"Abidalrahman Mohammad, Y. Jararweh, L. Tawalbeh","doi":"10.1109/ISIAS.2011.6122835","DOIUrl":"https://doi.org/10.1109/ISIAS.2011.6122835","url":null,"abstract":"This paper presents an FPGA architecture for a new version of the Advanced Encryption Standard (AES) algorithm. The efficient hardware that implements the algorithm is also proposed. The new algorithm (AES-512) uses input block size and key size of 512-bits which makes it more resistant to cryptanalysis with tolerated area increase. AES-512 will be suitable for applications with high security and throughput requirements and with less chip area constrains such as multimedia and satellite communication systems. An FPGA architectural for AES-512 was developed using VHDL, and synthesized using Virtix-6 and Virtex-7 chips. AES-512 show tremendous throughput increase of 230% when compared with the implementation of the original AES-128.","PeriodicalId":139268,"journal":{"name":"2011 7th International Conference on Information Assurance and Security (IAS)","volume":"12 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133980207","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Black hole effect mitigation method in AODV routing protocol","authors":"Z. Ahmad, K. A. Jalil, J. Manan","doi":"10.1109/ISIAS.2011.6122811","DOIUrl":"https://doi.org/10.1109/ISIAS.2011.6122811","url":null,"abstract":"Ad hoc On Demand Vector (AODV) is a reactive routing protocol in Mobile Ad hoc Network (MANET). Although the protocol has been around for quite some time, but there are still security issues which make it vulnerable to attacks such as black hole attack which subsequently affecting its performance adversely. There have been several previous works done to mitigate this problem but most of the proposed methods incur overhead to the existing protocol. Most of MANET devices are resource constraint and therefore a light solution is highly and preferably needed. For this reason, in this paper we propose a method called EAODV (Enhance AODV) based on our previous work called ERDA. Similar to ERDA it does not introduce any overhead and moreover, it does not change the existing protocol scheme. The new proposed method is able to enhance ERDA by introducing one extra parameter, which checks for control message from destination node. In simulation, EAODV has shown outstanding results as compared to ERDA besides significant improvement to the network performance as compared to the normal AODV protocol.","PeriodicalId":139268,"journal":{"name":"2011 7th International Conference on Information Assurance and Security (IAS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128545579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A DRM framework towards preventing digital piracy","authors":"Ravi Sankar Veerubhotla, A. Saxena","doi":"10.1109/ISIAS.2011.6122785","DOIUrl":"https://doi.org/10.1109/ISIAS.2011.6122785","url":null,"abstract":"Digital piracy is a major challenge faced by content publishers and software vendors today. This paper presents a Digital Rights Management (DRM) framework to secure digital content and software applications. The DRM framework uses cryptographic techniques and supports protection of digital content viz., PDF, image and audio files by enforcing user rights such as view, copy, play or print as applicable. The framework is extendable to safeguard libraries of software applications on multiple operating systems. The design offers protection to various file formats with a DRM license that can be upgraded for additional rights or be renewed to get an extended validity. The DRM framework also accommodates offline use of protected content by a one-time (initial) setup and a user license stored locally. Finally, the paper analyzes the design for DRM's crucial requirements like security, flexibility, efficiency and interoperability.","PeriodicalId":139268,"journal":{"name":"2011 7th International Conference on Information Assurance and Security (IAS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121642711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Surveying the Wireless Body Area Network in the realm of wireless communication","authors":"S. N. Ramli, R. Ahmad","doi":"10.1109/ISIAS.2011.6122845","DOIUrl":"https://doi.org/10.1109/ISIAS.2011.6122845","url":null,"abstract":"Advances in wireless communication technologies and sensors have empowered development of Wireless Body Area Network (WBAN). The wireless nature of network and variety of sensors offer numerous new, practical and innovative applications to improve health monitoring and other health care applications system. In the past few years, many researches focused on building system architecture of health monitoring to improve the technical requirement specifically designed for WBAN. However, as part of communication medium, WBAN faces with various security issues such as loss of data, authentication and access control. Less research were found in providing strong security system in WBAN. Throughout this study, we believe that WBAN can provide various applications including medical and non-medical. In this paper, we present an overview of body area network and their related issues emphasis in security problem. We also provide the differences between Wireless Body Area Network and Wireless Sensor Network (WSN) that is inadequate to apply in WBAN although some challenges faced by WBAN are in many ways similar to WSN. Finally, we highlight security challenges that still need to be addressed to make WBAN truly ubiquitous for a wide range of applications.","PeriodicalId":139268,"journal":{"name":"2011 7th International Conference on Information Assurance and Security (IAS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121663692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Erwin Hidayat, Nur A. Fajrian, A. Muda, Y. Choo, S. Ahmad
{"title":"A comparative study of feature extraction using PCA and LDA for face recognition","authors":"Erwin Hidayat, Nur A. Fajrian, A. Muda, Y. Choo, S. Ahmad","doi":"10.1109/ISIAS.2011.6122779","DOIUrl":"https://doi.org/10.1109/ISIAS.2011.6122779","url":null,"abstract":"Feature extraction is important in face recognition. This paper presents a comparative study of feature extraction using Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) for face recognition. The evaluation parameters for the study are time and accuracy of each method. The experiments were conducted using six datasets of face images with different disturbance. The results showed that LDA is much better than PCA in overall image with various disturbances. While in time taken evaluation, PCA is faster than LDA.","PeriodicalId":139268,"journal":{"name":"2011 7th International Conference on Information Assurance and Security (IAS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114438040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Dabbagh, A. Ghandour, Kassem Fawaz, W. El-Hajj, Hazem M. Hajj
{"title":"Slow port scanning detection","authors":"M. Dabbagh, A. Ghandour, Kassem Fawaz, W. El-Hajj, Hazem M. Hajj","doi":"10.1109/ISIAS.2011.6122824","DOIUrl":"https://doi.org/10.1109/ISIAS.2011.6122824","url":null,"abstract":"Port scanning is the most popular reconnaissance technique attackers use to discover services they can break into. Port scanning detection has received a lot of attention by researchers. However a slow port scan attack can deceive most of the existing Intrusion Detection Systems (IDS). In this paper, we present a new, simple, and efficient method for detecting slow port scans. Our proposed method is mainly composed of two phases: (1) a feature collection phase that analyzes network traffic and extracts the features needed to classify a certain IP as malicious or not. (2) A classification phase that divides the IPs, based on the collected features, into three groups: normal IPs, suspicious IPs and scanner IPs. The IPs our approach classify as suspicious are kept for the next (K) time windows for further examination to decide whether they represent scanners or legitimate users. Hence, this approach is different than the traditional approach used by IDSs that classifies IPs as either legitimate or scanners, and thus producing a high number of false positives and false negatives. A small Local Area Network was put together to test our proposed method. The experiments show the effectiveness of our proposed method in correctly identifying malicious scanners when both normal and slow port scan were performed using the three most common TCP port scanning techniques. Moreover, our method detects malicious scanners that are otherwise not detected using well known IDSs such as Snort.","PeriodicalId":139268,"journal":{"name":"2011 7th International Conference on Information Assurance and Security (IAS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131097501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient iris recognition system based on dual boundary detection using robust variable learning rate Multilayer Feed Forward neural network","authors":"Mohtashim Baqar, Sohaib Azhar, Zeeshan Iqbal, Irfan Shakeel, Laeeq Ahmed, M. Moinuddin","doi":"10.1109/ISIAS.2011.6122841","DOIUrl":"https://doi.org/10.1109/ISIAS.2011.6122841","url":null,"abstract":"This paper presents a novel approach towards iris recognition based on dual boundary (Pupil-Iris & Sclera-Iris) detection and then using a modified Multilayer Feed Forward neural network (MFNN) to perform an efficient automatic classification. The novelty of the work resides in the fact that the proposed method features the localization of the dual iris boundaries to be used as feature vector for classification. The process of information extraction starts by preprocessing the eye-image to remove specular highlight and then locating the pupil of the eye by using edge detection. The centroid of the detected pupil is chosen as the reference point for extracting the boundary points. The boundary points are recorded using radius vector functions approach. The proposed feature vector is obtained by concatenating the contour points of the Pupil-Iris boundary and the Sclera-Iris boundary which will yield a unique pattern named as Iris signature. The proposed method is translational and scale invariant. The classification is performed using the MFNN via a modified version of back-propagation algorithm which uses a time varying learning rate. The proposed system has been tested on moderate no of pictures taken from MMU iris database in the presence of additive noise for different values of signal-to-noise ratio (SNR). Experimental result for percentage recognition shows that the proposed method outperforms the single boundary method.","PeriodicalId":139268,"journal":{"name":"2011 7th International Conference on Information Assurance and Security (IAS)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132452891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multifactor graphical passwords: An assessment of end-user performance","authors":"M. Z. Jali, S. Furnell, P. Dowland","doi":"10.1109/ISIAS.2011.6122786","DOIUrl":"https://doi.org/10.1109/ISIAS.2011.6122786","url":null,"abstract":"This paper reports on the usability study carried out to assess the feasibility of combining two graphical password methods for better security. The methods involved clicking on the image (i.e. click-based) and selecting a series of images (i.e. choice-based). A graphical password prototype was developed (Enhanced Graphical Authentication System) and tested by thirty participants, who were randomly chosen from the authors' university. Two evaluations were made; namely user performance of the combined method and the feasibility of authentication strategies towards the introduced method itself. From both evaluations, it is found that positive results have been obtained, which suggest that these methods could be combined together effectively without giving impediment to users. However, there are issues relating to predictability as a consequence of insecure user behaviour.","PeriodicalId":139268,"journal":{"name":"2011 7th International Conference on Information Assurance and Security (IAS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133322029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}