In this paper, the Security Petri Net model is adopted to formally prove security protocol in the field of wireless sensor networks. As a result of this analysis, a man-in-the-middle-attack has been found and an improved version of the protocol is proposed. And the results show that the Security Petri Net model is a simple and efficient method to prove the security of of security protocol.
{"title":"Formal Proof of the Security Protocol in Wireless Sensor Network Based on the Petri Net","authors":"Yingjiu Guo, Xuemei Liu, Xiufeng Shao","doi":"10.1109/CIS.2013.146","DOIUrl":"https://doi.org/10.1109/CIS.2013.146","url":null,"abstract":"In this paper, the Security Petri Net model is adopted to formally prove security protocol in the field of wireless sensor networks. As a result of this analysis, a man-in-the-middle-attack has been found and an improved version of the protocol is proposed. And the results show that the Security Petri Net model is a simple and efficient method to prove the security of of security protocol.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134430120","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}
SIFT is one of the most robust and widely used image matching algorithms based on local features. But the key-points descriptor of SIFT algorithm have 128 dimensions. Aiming to the problem of its high dimension and complexity, a novel image matching algorithm is proposed. The descriptors of SIFT key-points are constructed by the rotation invariant LTP, city-block distance is also employed to reduce calculation of key-points matching. The experiment is achieved through different lighting, blur changes and rotation of images, the results show that this method can reduce the processing time and raise image matching efficiency.
{"title":"An Image Matching Algorithm Based on SIFT and Improved LTP","authors":"Yi-Ming Liu, Lifang Chen, Yuan Liu, Hao-Tian Wu","doi":"10.1109/CIS.2013.98","DOIUrl":"https://doi.org/10.1109/CIS.2013.98","url":null,"abstract":"SIFT is one of the most robust and widely used image matching algorithms based on local features. But the key-points descriptor of SIFT algorithm have 128 dimensions. Aiming to the problem of its high dimension and complexity, a novel image matching algorithm is proposed. The descriptors of SIFT key-points are constructed by the rotation invariant LTP, city-block distance is also employed to reduce calculation of key-points matching. The experiment is achieved through different lighting, blur changes and rotation of images, the results show that this method can reduce the processing time and raise image matching efficiency.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134071085","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}
Novel differential flip-flops using neuron-MOS transistors are presented, including single edge-triggered flipflop and double edge-triggered flip-flop. In the new differential flip-flops, a pair of n-channel multiple-input neuron-MOS pull down logic networks is used to replace the nMOS logic tree in the conventional differential flip-flops. The construction of the circuits has been simplified by employing the multiple-input neuron-MOS transistors. HSPICE simulations using TSMC 0.35μm 2-ploy 4-metal CMOS technology have verified the effectiveness of the proposed design scheme. The simulated results of propagation delay and power dissipation are also given.
{"title":"Differential Edge-Triggered Flip-Flops Using Neuron-MOS Transistors","authors":"G. Hang, Xiaohui Hu, Hongli Zhu, X. You","doi":"10.1109/CIS.2013.73","DOIUrl":"https://doi.org/10.1109/CIS.2013.73","url":null,"abstract":"Novel differential flip-flops using neuron-MOS transistors are presented, including single edge-triggered flipflop and double edge-triggered flip-flop. In the new differential flip-flops, a pair of n-channel multiple-input neuron-MOS pull down logic networks is used to replace the nMOS logic tree in the conventional differential flip-flops. The construction of the circuits has been simplified by employing the multiple-input neuron-MOS transistors. HSPICE simulations using TSMC 0.35μm 2-ploy 4-metal CMOS technology have verified the effectiveness of the proposed design scheme. The simulated results of propagation delay and power dissipation are also given.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133444437","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}
Though an important task in natural language processing, discourse relation recognition has not until recently received as much attention as it deserves, maybe due to its complexity. In Chinese, discourse relations are mostly implicit, making the task even harder. There are more explicit discourse relations in English than Chinese. In this paper, we propose a new approach to Chinese discourse relation recognition, which utilizes English-Chinese alignment corpus to discover implicit Chinese discourse relations. Results show our method achieves 60% accuracy in argument detection and 40% accuracy in discourse relation recognition.
{"title":"Chinese Discourse Relation Recognition Using Parallel Corpus","authors":"Yifeng Xu, Yunfang Wu","doi":"10.1109/CIS.2013.96","DOIUrl":"https://doi.org/10.1109/CIS.2013.96","url":null,"abstract":"Though an important task in natural language processing, discourse relation recognition has not until recently received as much attention as it deserves, maybe due to its complexity. In Chinese, discourse relations are mostly implicit, making the task even harder. There are more explicit discourse relations in English than Chinese. In this paper, we propose a new approach to Chinese discourse relation recognition, which utilizes English-Chinese alignment corpus to discover implicit Chinese discourse relations. Results show our method achieves 60% accuracy in argument detection and 40% accuracy in discourse relation recognition.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125180581","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}
Qian Wang, Liji Wu, Xiangmin Zhang, Xiangyu Li, Jun Guo
As bank IC cards with chips are widely used nowadays, the security of them becomes increasingly important. Fault attack, which aims to inject fault into the chip during the calculation, is a serious threat to the information security of the chip. Thus considerable countermeasures are involved to meet the overall requirements and facilitate the intended application for bank IC cards. In this paper, countermeasures against fault attacks for 3DES (Triple Data Encryption Algorithm) which is one of the widely used block ciphers in the bank IC cards are designed and implemented. Those countermeasures in our paper are based on the symmetry structure of DES block and we try to dig the efficiency in it. The basic countermeasure reduces the time latency from 100% to 1/n × 100% for n round block cipher. On the basis of this, an optimized countermeasure lowers the redundancy rate from 1/4 to 1/16. Another optimization reduces the area cost of duplication than the second method, which has the same latency. The countermeasures are designed for the 3DES algorithm in RTL level, implemented and verified in FPGA board. The fault attack platform successfully injected clock glitch into the DES engine and demonstrated the validity of the countermeasure. Over 1000 3DES calculations are tested and the successful detection rate is 100%.
随着芯片银行IC卡的广泛应用，其安全性变得越来越重要。故障攻击的目的是在计算过程中向芯片注入故障，是对芯片信息安全的严重威胁。因此，需要采取相当多的对策来满足总体要求并促进银行IC卡的预期应用。本文设计并实现了针对银行IC卡中应用最广泛的分组密码之一3DES (Triple Data Encryption Algorithm)的故障攻击对策。本文的对策都是基于DES块的对称结构，并试图挖掘其效率。基本对策将n轮分组密码的时间延迟从100%降低到1/n × 100%。在此基础上，优化对策将冗余率从1/4降低到1/16。另一种优化比第二种方法减少了重复的面积成本，后者具有相同的延迟。针对RTL级的3DES算法设计了相应的对策，并在FPGA板上进行了实现和验证。故障攻击平台成功地将时钟故障注入到DES引擎中，验证了对策的有效性。测试了1000多个3DES计算，成功检出率为100%。
{"title":"Efficient Countermeasures against Fault Attacks for 3DES Crypto Engine in Bank IC Card","authors":"Qian Wang, Liji Wu, Xiangmin Zhang, Xiangyu Li, Jun Guo","doi":"10.1109/CIS.2013.159","DOIUrl":"https://doi.org/10.1109/CIS.2013.159","url":null,"abstract":"As bank IC cards with chips are widely used nowadays, the security of them becomes increasingly important. Fault attack, which aims to inject fault into the chip during the calculation, is a serious threat to the information security of the chip. Thus considerable countermeasures are involved to meet the overall requirements and facilitate the intended application for bank IC cards. In this paper, countermeasures against fault attacks for 3DES (Triple Data Encryption Algorithm) which is one of the widely used block ciphers in the bank IC cards are designed and implemented. Those countermeasures in our paper are based on the symmetry structure of DES block and we try to dig the efficiency in it. The basic countermeasure reduces the time latency from 100% to 1/n × 100% for n round block cipher. On the basis of this, an optimized countermeasure lowers the redundancy rate from 1/4 to 1/16. Another optimization reduces the area cost of duplication than the second method, which has the same latency. The countermeasures are designed for the 3DES algorithm in RTL level, implemented and verified in FPGA board. The fault attack platform successfully injected clock glitch into the DES engine and demonstrated the validity of the countermeasure. Over 1000 3DES calculations are tested and the successful detection rate is 100%.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129449031","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}
Jiachen Liu, Jianfeng Song, Qiguang Miao, Ying Cao
Nowadays, machine learning based methods are among the most popular ones for malware detection. However, most of the previous works use a single type of features, dynamic or static, and take them to build a binary classification model. These methods have limited ability to depict characteristic malware behaviors and suffer from insufficiently sampled benign samples and extremely imbalanced training dataset. In this paper, we present FENOC, an ensemble one-class learning framework for malware detection. FENOC uses hybrid features from multiple semantic layers to ensure comprehensive insights of analyzed programs, and constructs detection model via CosTOC (Cost-sensitive Twin One-class Classifier), a novel one-class learning algorithm, which uses a pair of one-class classifiers to describe malware class and benign program class respectively. CosTOC is more flexible and robust when handling malware detection problems, which is imbalanced and need low false positive rate. Meanwhile, a random subspace ensemble method is used to enhance the generalization ability of CosTOC. Experimental results show that to detect unknown malware, FENOC has a higher detection rate and a lower false positive rate, especially in the situations that training datasets are imbalanced.
{"title":"FENOC: An Ensemble One-Class Learning Framework for Malware Detection","authors":"Jiachen Liu, Jianfeng Song, Qiguang Miao, Ying Cao","doi":"10.1109/CIS.2013.116","DOIUrl":"https://doi.org/10.1109/CIS.2013.116","url":null,"abstract":"Nowadays, machine learning based methods are among the most popular ones for malware detection. However, most of the previous works use a single type of features, dynamic or static, and take them to build a binary classification model. These methods have limited ability to depict characteristic malware behaviors and suffer from insufficiently sampled benign samples and extremely imbalanced training dataset. In this paper, we present FENOC, an ensemble one-class learning framework for malware detection. FENOC uses hybrid features from multiple semantic layers to ensure comprehensive insights of analyzed programs, and constructs detection model via CosTOC (Cost-sensitive Twin One-class Classifier), a novel one-class learning algorithm, which uses a pair of one-class classifiers to describe malware class and benign program class respectively. CosTOC is more flexible and robust when handling malware detection problems, which is imbalanced and need low false positive rate. Meanwhile, a random subspace ensemble method is used to enhance the generalization ability of CosTOC. Experimental results show that to detect unknown malware, FENOC has a higher detection rate and a lower false positive rate, especially in the situations that training datasets are imbalanced.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"60 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121007164","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}
An improved constraint handling technique based on a comparison mechanism is presented, and then it is combined with selection operator in differential evolution to fulfill constraint handling and selection simultaneously. A differential evolution with two mutation strategies based on this new constraint handling technique is developed to solve the linear bilevel programming problems. The simulation results show that the proposed algorithm can find global optimal solutions with less computation burden.
{"title":"A Differential Evolution with Two Mutation Strategies for Linear Bilevel Programming Problems","authors":"Hong Li, Li Zhang","doi":"10.1109/CIS.2013.19","DOIUrl":"https://doi.org/10.1109/CIS.2013.19","url":null,"abstract":"An improved constraint handling technique based on a comparison mechanism is presented, and then it is combined with selection operator in differential evolution to fulfill constraint handling and selection simultaneously. A differential evolution with two mutation strategies based on this new constraint handling technique is developed to solve the linear bilevel programming problems. The simulation results show that the proposed algorithm can find global optimal solutions with less computation burden.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121596881","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}
Chong Fu, Wenjun Li, Zhao-yu Meng, Tao Wang, Pei-Xuan Li
Chaos-based image encryption techniques have recently been extensively studied due to their superior properties in efficiency. However, many of the proposed schemes suffer from known/chosen plaintext attacks as the key stream used in diffusion stage is usually solely determined by the key. This paper suggests a chaos-based symmetric image cipher with a plaintext-related key stream generation mechanism. In the diffusion stage, the state variables of Lorenz system are selected according to the plain pixel. As a result, the quantified key stream is related to both the key and the plain image, which makes known/chosen plaintext attack practically infeasible. Moreover, compared with 1D chaotic maps that commonly employed in existing ciphers, the Lorenz system has more complicated dynamical property and number of state variables, which further enhance the security of the cryptosystem. Thorough security tests are carried out with detailed analysis, demonstrating the high security of the new scheme.
{"title":"A Symmetric Image Encryption Scheme Using Chaotic Baker Map and Lorenz System","authors":"Chong Fu, Wenjun Li, Zhao-yu Meng, Tao Wang, Pei-Xuan Li","doi":"10.1109/CIS.2013.158","DOIUrl":"https://doi.org/10.1109/CIS.2013.158","url":null,"abstract":"Chaos-based image encryption techniques have recently been extensively studied due to their superior properties in efficiency. However, many of the proposed schemes suffer from known/chosen plaintext attacks as the key stream used in diffusion stage is usually solely determined by the key. This paper suggests a chaos-based symmetric image cipher with a plaintext-related key stream generation mechanism. In the diffusion stage, the state variables of Lorenz system are selected according to the plain pixel. As a result, the quantified key stream is related to both the key and the plain image, which makes known/chosen plaintext attack practically infeasible. Moreover, compared with 1D chaotic maps that commonly employed in existing ciphers, the Lorenz system has more complicated dynamical property and number of state variables, which further enhance the security of the cryptosystem. Thorough security tests are carried out with detailed analysis, demonstrating the high security of the new scheme.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"47 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117311204","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}
This paper deals with a class of interval linear bilevel programming problems, in which some or all of the leader's and follower's objective function coefficients are specified in terms of intervals. The focus of solving this class of problems is on determining the optimal value range when different coefficients of objectives are taken in intervals given. In order to obtain the best and the worst optimal solutions to this class of problems, an efficient genetic algorithm is developed. Firstly, the objective coefficients of the lower level are encoded as individuals using real coding scheme, and the relative intervals are taken as the search space of the genetic algorithm. Secondly, for each encoded individual, a simplified interval linear bilevel program is obtained, in which interval coefficients are simply in the upper level objective function. Finally, the simplified problem is further divided into two linear bilevel programs without interval coefficients and solved by using the optimality theory of linear programming. The optimal values are taken as fitness values, by which the best and the worst optimal solutions can be obtained. In order to illustrate the efficiency of the proposed algorithm, two examples are solved and the results show that the algorithm is feasible and robust.
{"title":"An Efficient Genetic Algorithm for Interval Linear Bilevel Programming Problems","authors":"Hecheng Li, Lei Fang","doi":"10.1109/CIS.2013.16","DOIUrl":"https://doi.org/10.1109/CIS.2013.16","url":null,"abstract":"This paper deals with a class of interval linear bilevel programming problems, in which some or all of the leader's and follower's objective function coefficients are specified in terms of intervals. The focus of solving this class of problems is on determining the optimal value range when different coefficients of objectives are taken in intervals given. In order to obtain the best and the worst optimal solutions to this class of problems, an efficient genetic algorithm is developed. Firstly, the objective coefficients of the lower level are encoded as individuals using real coding scheme, and the relative intervals are taken as the search space of the genetic algorithm. Secondly, for each encoded individual, a simplified interval linear bilevel program is obtained, in which interval coefficients are simply in the upper level objective function. Finally, the simplified problem is further divided into two linear bilevel programs without interval coefficients and solved by using the optimality theory of linear programming. The optimal values are taken as fitness values, by which the best and the worst optimal solutions can be obtained. In order to illustrate the efficiency of the proposed algorithm, two examples are solved and the results show that the algorithm is feasible and robust.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127059119","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}
Pseudo random numbers are important in various applications. Pseudo random number generators (PRNGs) have been used widely to provide ideal pseudo random number generating sources. Recently the researches on chaos-based PRNGs have also attracted much attention. Based on Li-York's chaotic map criteria, this paper introduces a novel piecewise linear chaotic map (PLCM). Combining the PLCM with the logistic map designs a chaotic PRNG (CPRNG). Using the FIPS 140-2 test suit tests the randomness of two 1000 key streams consisting of 20000 bits and 220 bits, respectively. The results show that for the 1000 key streams consisting of 20000 bits, the statistical properties of the randomness of the sequences generated via the CPRNG and an m-sequence PRNG do not have significant differences. As applications, image encryption examples via the CPRNG and the m-Sequence based PRNG are given.
{"title":"Study on Pseudorandomness of Some Pseudorandom Number Generators with Application","authors":"L. Min, Kexin Hu, Lijiao Zhang, Yuqun Zhang","doi":"10.1109/CIS.2013.126","DOIUrl":"https://doi.org/10.1109/CIS.2013.126","url":null,"abstract":"Pseudo random numbers are important in various applications. Pseudo random number generators (PRNGs) have been used widely to provide ideal pseudo random number generating sources. Recently the researches on chaos-based PRNGs have also attracted much attention. Based on Li-York's chaotic map criteria, this paper introduces a novel piecewise linear chaotic map (PLCM). Combining the PLCM with the logistic map designs a chaotic PRNG (CPRNG). Using the FIPS 140-2 test suit tests the randomness of two 1000 key streams consisting of 20000 bits and 220 bits, respectively. The results show that for the 1000 key streams consisting of 20000 bits, the statistical properties of the randomness of the sequences generated via the CPRNG and an m-sequence PRNG do not have significant differences. As applications, image encryption examples via the CPRNG and the m-Sequence based PRNG are given.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"14 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113998856","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
扫码关注我们
求助内容：
应助结果提醒方式：