2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing最新文献

Computational Security Evaluation of Light-Weight Block Cipher Against Integral Attack by GPGPU 轻量级分组密码抗GPGPU积分攻击的计算安全性评估

2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing Pub Date : 2015-11-03 DOI: 10.1109/CSCloud.2015.14

Haruhisa Kosuge, Hidema Tanaka, Keisuke Iwai, T. Kurokawa

{"title":"Computational Security Evaluation of Light-Weight Block Cipher Against Integral Attack by GPGPU","authors":"Haruhisa Kosuge, Hidema Tanaka, Keisuke Iwai, T. Kurokawa","doi":"10.1109/CSCloud.2015.14","DOIUrl":"https://doi.org/10.1109/CSCloud.2015.14","url":null,"abstract":"Integral distinguisher is the main factor of integral attack. In the conventional search strategy of integral distinguisher (ID), there are two steps. In the first step, first order ID is obtained. In the second step, first order ID is extended by increasing the order. We find it is problematic to apply the conventional strategy for Feistel ciphers whose number of sub blocks N is large such as TWINE and LBlock (N = 16). To solve the problem, we propose new search strategy which has large search scope and feasibility in realistic computational condition. By the reduction of the computational complexity, it is reduced from O((nN)×(2mn)) to O(N×2mn). And for the acceleration of the experiment, we use GPGPU (general-purpose computing on graphics processing units) platform. By using GPGPU platform, we can test substantially higher order ID than existing CPU platform. We execute computer experiment to discover the precise fifteenth order ID of TWINE and LBlock by proposal strategy. As a result, we find new fifteenth order ID which has 8 balanced sub blocks (32-bit) after 15-round encryption both in TWINE and LBlock. These results are the most precise evaluatiPon of TWINE and LBlock.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127177270","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}

引用次数: 2

Energy Optimization of Air-Based Information Network with Guaranteed Security Protection 具有安全保障的空基信息网络能量优化

2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing Pub Date : 2015-11-03 DOI: 10.1109/CSCloud.2015.90

Xiao Liu, Meikang Qiu, Xiaodong Wang, Weiran Liu, Kaiquan Cai

引用次数: 4

Detection of Malware and Kernel-Level Rootkits in Cloud Computing Environments 云计算环境下的恶意软件和内核级rootkit检测

2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing Pub Date : 2015-11-03 DOI: 10.1109/CSCloud.2015.54

Thu Yein Win, H. Tianfield, Q. Mair

引用次数: 13

Forward Secure On-device Encryption Scheme Withstanding Cold Boot Attack 防冷启动攻击的正向安全设备上加密方案

2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing Pub Date : 2015-11-03 DOI: 10.1109/CSCloud.2015.43

S. Vivek, Rajkumar Ramasamy

引用次数: 3

Maintainable Mobile Model Using Pre-Cache Technology for High Performance Android System 基于预缓存技术的高性能Android系统可维护移动模型

2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing Pub Date : 2015-11-03 DOI: 10.1109/CSCloud.2015.76

Hui Zhao, Meikang Qiu, Keke Gai, Jie Li, Xin He

引用次数: 9

Improved Differential Characteristic Searching Methods 改进的差分特征搜索方法

2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing Pub Date : 2015-11-03 DOI: 10.1109/CSCloud.2015.42

Jiageng Chen, A. Miyaji, Chunhua Su, J. Teh

{"title":"Improved Differential Characteristic Searching Methods","authors":"Jiageng Chen, A. Miyaji, Chunhua Su, J. Teh","doi":"10.1109/CSCloud.2015.42","DOIUrl":"https://doi.org/10.1109/CSCloud.2015.42","url":null,"abstract":"The success probability of differential and linear cryptanalysis against block ciphers heavily depend on finding differential or linear paths with high statistical bias compared with uniform random distribution. For large number of rounds, it is not a trivial task to find such differential or linear paths. Matsui first investigated this problem and proposed a solution based on a branch and bound algorithm in 1994. Since then, the research on finding good concrete differential or linear path did not receive much attention. In this paper, we revisit the differential attack against several S-Box based block ciphers by carefully studying the differential characteristics. Inspired by Matsui's algorithm, we provide an improved solution with the aid of several searching strategies, which enable us to find by far the best differential characteristics for the two investigated ciphers (LBlock, TWINE) efficiently. Furthermore, we provide another way to evaluate the security of ciphers against differential attack by comparing the strength of the ciphers from differential characteristic's point of view, and we also investigate the accuracy when using the active S-Box to evaluate the security margin against differential attack, which is the common method adapted when new ciphers are designed.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124136204","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}

引用次数: 9

Class-Chord: Efficient Messages to Classes of Nodes in Chord Class-Chord:向Chord中节点类发送的有效消息

2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing Pub Date : 2015-11-03 DOI: 10.1109/CSCloud.2015.17

D. Fleck, Fengwei Zhang, Sharath Hiremagalore, Stephen Reese, Liam McGhee

{"title":"Class-Chord: Efficient Messages to Classes of Nodes in Chord","authors":"D. Fleck, Fengwei Zhang, Sharath Hiremagalore, Stephen Reese, Liam McGhee","doi":"10.1109/CSCloud.2015.17","DOIUrl":"https://doi.org/10.1109/CSCloud.2015.17","url":null,"abstract":"Security Information Event Management (SIEM) systems are used to monitor large networks for malware infestations, DDoS attacks, and many other types of network intrusions. Typical SIEMs are centrally managed with information flowing in from across the enterprise. In this architecture, as the enterprise grows, the SIEM must also scale proportionally. In our research we are working to create a Peer-to-Peer distributed SIEM system to leverage the power of all the devices in the network for monitoring. The system scales naturally, as the enterprise grows, more devices come into the peer-to-peer network (P2P). The added devices increase the SIEM's processing power and storage ability. A P2P SIEM will drastically reduce upfront hardware costs and provide an increased processing power for advanced analytics. In this paper, we present Class-Chord which is a P2P network fabric designed to support a P2P SIEM. We have modified the well known Chord DHT to support efficient 1-n messaging that is required to enable SIEM administrators to query subsets of the network rather than flooding queries to all nodes. Class-Chord uses a modified Chord ID and a new message type that enables administrators to send messages to network subsets using complex class matching specifiers. We analyze theoretical models for the system and present experimental results from a live system deployed across 300 physical nodes. The results attest that Class-Chord is more efficient than traditional communication mechanisms used in SIEM systems.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133987773","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}

引用次数: 0

Improved Ant Colony Algorithm for Finding the Maximum Clique in Social Network 基于改进蚁群算法的社交网络最大团块求解

2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing Pub Date : 2015-11-03 DOI: 10.1109/CSCloud.2015.31

Suqi Zhang, Yongfeng Dong, Jun Yin, Jingjin Guo

引用次数: 0

Search Engine: A Hidden Power for Virus Propagation in Community Networks 搜索引擎:病毒在社区网络中传播的一种隐藏力量

2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing Pub Date : 2015-11-03 DOI: 10.1109/CSCloud.2015.83

Jia Yang, Cai Fu, Deliang Xu, Lansheng Han, Xiao-Yang Liu

{"title":"Search Engine: A Hidden Power for Virus Propagation in Community Networks","authors":"Jia Yang, Cai Fu, Deliang Xu, Lansheng Han, Xiao-Yang Liu","doi":"10.1109/CSCloud.2015.83","DOIUrl":"https://doi.org/10.1109/CSCloud.2015.83","url":null,"abstract":"The propagation methods of viruses are diverse and studying the virus propagation is a hot topic. There appears a new way that the search engine quickly spreads network viruses, and many researches overlook its impact of propagation and few researches set a model to quantifiabely analyze how the search engine spread viruses. Based on community networks, this paper designs a specific model how the search engine spreads viruses. Moreover, this paper quantifiabely calculate the virus propagation velocity and the propagation effect. First, by analyzing the propagation process of viruses under the search engine condition, we design a positive feedback model to analyze how the search engine and the community network influence the propagation process of viruses. Second, we define relationship functions of propagation factors and calculate the rate of infected nodes while establishing mathematical propagation formulas for two situations. One situation is with the search engine, and another is without the search engine. Third, we design the experiment to verify the model analysis. Compared with two situations, we show that viruses have a much quicker propagation velocity, and the growth rate of infected rate is larger under the search engine condition. When the immune vaccine replaces the virus, this paper is also applicable.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115332183","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}

引用次数: 4

Access Control for Multi-tenancy in Cloud-Based Health Information Systems 基于云的健康信息系统中多租户的访问控制

2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing Pub Date : 2015-11-03 DOI: 10.1109/CSCloud.2015.95

Mohd Anwar, Ashiq Imran

引用次数: 11