Pub Date : 2013-08-01DOI: 10.1109/ISCISC.2013.6767332
Roza Afarin, S. Mozaffari
The aim of this paper is image encryption using Genetic algorithm (GA). The proposed encryption method consists of two phases. In substitution phase, pixels locations are altered to reduce correlation among adjacent pixels. Then, pixels values are changed in the modification phase to encrypt the input image. Both phases are performed by GA with binary chromosomes. For substitution phase, these binary patterns are generated by Local Binary Pattern (LBP) operator while for modification phase binary chromosomes are obtained by Bit Plane Slicing (BPS). Initial population in GA includes rows and columns of the input image. Instead of subjective selection of parents from this initial population, a random generator with predefined key is utilized. Because it is necessary to decrypt the coded image and reconstruct the initial input image. Fitness function is defined as average of transition from 0 to 1 and 1 to 0 in LBP image and histogram uniformity in substitution and modification phases, respectively. Randomness of the encrypted image is measured by entropy, correlation coefficients and histogram analysis. Experimental results show that the proposed method is fast enough and can be used effectively for image encryption.
{"title":"Image encryption using genetic algorithm and binary patterns","authors":"Roza Afarin, S. Mozaffari","doi":"10.1109/ISCISC.2013.6767332","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767332","url":null,"abstract":"The aim of this paper is image encryption using Genetic algorithm (GA). The proposed encryption method consists of two phases. In substitution phase, pixels locations are altered to reduce correlation among adjacent pixels. Then, pixels values are changed in the modification phase to encrypt the input image. Both phases are performed by GA with binary chromosomes. For substitution phase, these binary patterns are generated by Local Binary Pattern (LBP) operator while for modification phase binary chromosomes are obtained by Bit Plane Slicing (BPS). Initial population in GA includes rows and columns of the input image. Instead of subjective selection of parents from this initial population, a random generator with predefined key is utilized. Because it is necessary to decrypt the coded image and reconstruct the initial input image. Fitness function is defined as average of transition from 0 to 1 and 1 to 0 in LBP image and histogram uniformity in substitution and modification phases, respectively. Randomness of the encrypted image is measured by entropy, correlation coefficients and histogram analysis. Experimental results show that the proposed method is fast enough and can be used effectively for image encryption.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":"49 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130258206","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}
Pub Date : 2013-08-01DOI: 10.1109/ISCISC.2013.6767354
Hamid Bagheriand Saeed Mozaffari
This paper presents a robust version of reversible data hiding method in encrypted images previously proposed by Zhang [8] and Wien [9]. In the original method, the image is partitioned into non-overlapping blocks, each divided into two neighbor sets. In these sets, one bit is embedded by flipping three LSBs of predefined pixels. The data extraction can be done by examining the block smoothness of neighboring blocks. However, this method is very sensitive to noise and attacks. Because noise and malicious activity usually alter adjacent blocks in the same manner. So, neighboring blocks do not have the same smoothness anymore. In this paper we propose a new method to select non-neighbor sets to decrease the effects of noise and therefore reduce bit error rate in encrypted image. These non-neighbor sets are selected by finding the most similar pairs as performed in the encoding phase of fractal image compression. Experimental results show that the proposed method outperforms previous approaches in the case of Gaussian noise contamination and results lower bit error rate.
{"title":"Robust reversible data hiding in encrypted image: Using fractal coding approach","authors":"Hamid Bagheriand Saeed Mozaffari","doi":"10.1109/ISCISC.2013.6767354","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767354","url":null,"abstract":"This paper presents a robust version of reversible data hiding method in encrypted images previously proposed by Zhang [8] and Wien [9]. In the original method, the image is partitioned into non-overlapping blocks, each divided into two neighbor sets. In these sets, one bit is embedded by flipping three LSBs of predefined pixels. The data extraction can be done by examining the block smoothness of neighboring blocks. However, this method is very sensitive to noise and attacks. Because noise and malicious activity usually alter adjacent blocks in the same manner. So, neighboring blocks do not have the same smoothness anymore. In this paper we propose a new method to select non-neighbor sets to decrease the effects of noise and therefore reduce bit error rate in encrypted image. These non-neighbor sets are selected by finding the most similar pairs as performed in the encoding phase of fractal image compression. Experimental results show that the proposed method outperforms previous approaches in the case of Gaussian noise contamination and results lower bit error rate.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131008176","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}
Pub Date : 2013-08-01DOI: 10.1109/ISCISC.2013.6767341
Z. Salek, F. M. Madani, R. Azmi
Nowadays Information security is an important issue in Information Technology world. The computer viruses, worms, hackers, crackers, electronic eavesdropping and electronic fraud, intrusions are some of the problems that Computer Security experts are facing. The Intrusion Detection System is a common and widely used approach in a well formed network security policy. Information systems must be monitored and audited for potential attacks; but the challenge in this process is analyzing heavy loads of event logs and network traffic. Also to be able to recognize new kinds of threads that tack place in network every day in a timely and efficient manner. In this paper we considered Differential Evolution algorithm for training neural network for the intrusion detection system. We used KDD dataset for our experiments that is derived from the standard KDD CUP" Intrusion Dataset. We also provided the comparative results of the differential evolution with the state of the art classification algorithm like RBF, Probabilistic Neural network (PNN) and Multilayer Perceptron (MLP) neural network. We reduced the dimension/features of the KDD datasets using PCA. The results of our study showed higher accuracy in intrusion detection.
{"title":"Intrusion detection using neuarl networks trained by differential evaluation algorithm","authors":"Z. Salek, F. M. Madani, R. Azmi","doi":"10.1109/ISCISC.2013.6767341","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767341","url":null,"abstract":"Nowadays Information security is an important issue in Information Technology world. The computer viruses, worms, hackers, crackers, electronic eavesdropping and electronic fraud, intrusions are some of the problems that Computer Security experts are facing. The Intrusion Detection System is a common and widely used approach in a well formed network security policy. Information systems must be monitored and audited for potential attacks; but the challenge in this process is analyzing heavy loads of event logs and network traffic. Also to be able to recognize new kinds of threads that tack place in network every day in a timely and efficient manner. In this paper we considered Differential Evolution algorithm for training neural network for the intrusion detection system. We used KDD dataset for our experiments that is derived from the standard KDD CUP\" Intrusion Dataset. We also provided the comparative results of the differential evolution with the state of the art classification algorithm like RBF, Probabilistic Neural network (PNN) and Multilayer Perceptron (MLP) neural network. We reduced the dimension/features of the KDD datasets using PCA. The results of our study showed higher accuracy in intrusion detection.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131103890","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}
Pub Date : 2013-08-01DOI: 10.1109/ISCISC.2013.6767322
H. Nasiraee, J. B. Mohasefi
Three party key establishment schemes are assumed impractical for traditional Wireless Sensor Networks (WSNs), due to unavailability of trusted third party and limitation of communication radio range in sensor nodes. However, with the advent of Internet-Enabled Sensor Network (IESN), which can provide trusted party by the internet, the future of three party techniques as key establishment scheme for IESN looks bright. In this paper we show vulnerability of existing three party schemes against DoS attacks. Then we propose a hierarchical practical three party scheme, which provides DoS resistance along with low communication cost, reliability, independence of prior deployment knowledge and support of node mobility, i.e. establishing secure channel with a node, which is not met before.
{"title":"A novel three party key establishment scheme in the context of Internet-of-Things","authors":"H. Nasiraee, J. B. Mohasefi","doi":"10.1109/ISCISC.2013.6767322","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767322","url":null,"abstract":"Three party key establishment schemes are assumed impractical for traditional Wireless Sensor Networks (WSNs), due to unavailability of trusted third party and limitation of communication radio range in sensor nodes. However, with the advent of Internet-Enabled Sensor Network (IESN), which can provide trusted party by the internet, the future of three party techniques as key establishment scheme for IESN looks bright. In this paper we show vulnerability of existing three party schemes against DoS attacks. Then we propose a hierarchical practical three party scheme, which provides DoS resistance along with low communication cost, reliability, independence of prior deployment knowledge and support of node mobility, i.e. establishing secure channel with a node, which is not met before.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125125747","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}
Pub Date : 2013-08-01DOI: 10.1109/ISCISC.2013.6767326
Z. Lashkaripour, A. G. Bafghi
In SQLIA, attacker injects an input in the query in order to change the structure of the query intended by the programmer and therefore, gain access to the data in the underlying database. Due to the significance of the stored data, web application's security against SQLIA is vital. In this paper we propose a tool that is capable of reporting the transformations needed to reinforce the security of a Java-based web application and its database against SQLIAs. This tool which is based on static analysis and runtime validation uses our new technique for detection and prevention of SQLIAs. In our technique user inputs in SQL queries are removed and some information is gathered in order to make the detection easier and faster at runtime. According to these information the tool reports the transformations needed and the location of the transformations in source code and therefore after applying the transformations the result would be a reinforced web application against SQLIAs.
{"title":"A security analysis tool for web application reinforcement against SQL injection attacks (SQLIAs)","authors":"Z. Lashkaripour, A. G. Bafghi","doi":"10.1109/ISCISC.2013.6767326","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767326","url":null,"abstract":"In SQLIA, attacker injects an input in the query in order to change the structure of the query intended by the programmer and therefore, gain access to the data in the underlying database. Due to the significance of the stored data, web application's security against SQLIA is vital. In this paper we propose a tool that is capable of reporting the transformations needed to reinforce the security of a Java-based web application and its database against SQLIAs. This tool which is based on static analysis and runtime validation uses our new technique for detection and prevention of SQLIAs. In our technique user inputs in SQL queries are removed and some information is gathered in order to make the detection easier and faster at runtime. According to these information the tool reports the transformations needed and the location of the transformations in source code and therefore after applying the transformations the result would be a reinforced web application against SQLIAs.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123249106","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}
Pub Date : 2013-08-01DOI: 10.1109/ISCISC.2013.6767330
F. Pahlavani, A. Pourmohammad
In this paper, a new Additive-White-Noise robust audio watermarking method based on using block set interpolation technique is proposed. This method is based on combination of block set interpolation technique and two-set patchwork method. This method is Additive-White-Noise robustness than the audio watermarking methods which are based on only the interpolation techniques. It also increases the embedding capacity and improves other important features in comparison with the conventional two-set methods. The time domain simulation results confirm this claim and show low computational complexity.
{"title":"A block set interpolation technique based Additive-White-Noise robust audio watermarking method","authors":"F. Pahlavani, A. Pourmohammad","doi":"10.1109/ISCISC.2013.6767330","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767330","url":null,"abstract":"In this paper, a new Additive-White-Noise robust audio watermarking method based on using block set interpolation technique is proposed. This method is based on combination of block set interpolation technique and two-set patchwork method. This method is Additive-White-Noise robustness than the audio watermarking methods which are based on only the interpolation techniques. It also increases the embedding capacity and improves other important features in comparison with the conventional two-set methods. The time domain simulation results confirm this claim and show low computational complexity.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132317798","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}
Pub Date : 2013-07-26DOI: 10.1109/ISCISC.2013.6767351
Reza Hooshmand, Masoumeh Koochak Shooshtari, M. Aref
This paper proposes an efficient secret key cryptosystem based on polar codes over Binary Erasure Channel. We introduce a method, for the first time to our knowledge, to hide the generator matrix of the polar codes from an attacker. In fact, our main goal is to achieve secure and reliable communication using finite-length polar codes. The proposed cryptosystem has a significant security advantage against chosen plaintext attacks in comparison with the Rao-Nam cryptosystem. Also, the key length is decreased after applying a new compression algorithm. Moreover, this scheme benefits from high code rate and proper error performance for reliable communication.
{"title":"Secret key cryptosystem based on polar codes over Binary Erasure Channel","authors":"Reza Hooshmand, Masoumeh Koochak Shooshtari, M. Aref","doi":"10.1109/ISCISC.2013.6767351","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767351","url":null,"abstract":"This paper proposes an efficient secret key cryptosystem based on polar codes over Binary Erasure Channel. We introduce a method, for the first time to our knowledge, to hide the generator matrix of the polar codes from an attacker. In fact, our main goal is to achieve secure and reliable communication using finite-length polar codes. The proposed cryptosystem has a significant security advantage against chosen plaintext attacks in comparison with the Rao-Nam cryptosystem. Also, the key length is decreased after applying a new compression algorithm. Moreover, this scheme benefits from high code rate and proper error performance for reliable communication.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115232592","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：