{"title":"A challenge-response authentication for RFID using Enhanced-Trivium","authors":"Siye Wang, Shiyong Zhang, Lifeng Liu, Gongliang Chen","doi":"10.1109/SSIC.2016.7571800","DOIUrl":"https://doi.org/10.1109/SSIC.2016.7571800","url":null,"abstract":"RFID (Radio frequency identification) technology which uses radio waves to identify objects has been applied widely. The security and privacy of the system is increasingly concerned. In this paper, we design a Trivium-like cipher algorithm without compromising the security and consuming less resource, which is called Enhanced-Trivium. We illustrate a Challenge-Response authentication protocol using Enhanced-Trivium as cryptographic primitive. The proposed protocol satisfies the requirements regarding low power consumption and low die-size and it is also resistant to various attacks.","PeriodicalId":349527,"journal":{"name":"2016 International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"21 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114105739","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":"Securing tactical service oriented architectures","authors":"V. Gkioulos, S. Wolthusen","doi":"10.1109/SSIC.2016.7571813","DOIUrl":"https://doi.org/10.1109/SSIC.2016.7571813","url":null,"abstract":"Service Oriented Architectures have been increasingly evaluated and applied within military networks. However, existing implementations tend to overlook the constraints of the tactical environment, generating unsuitable requirements of network resources. The ongoing TACTICS project aims to study these constraints and propose solutions suitably adjusted to the tactical ecosystem. Under this scope, the implementation of security architectures presents significant challenges and limitations. In this article we analyse the constraints of tactical SoA over the entire mission life cycle and derive a set of fine granularity security requirements, such that a security policy mechanism may optimally adjust to dynamic network conditions. Furthermore, we present the requisite characteristics of the developed security mechanisms, which are crucial for the real-time computation of policy decisions based on current situational knowledge.","PeriodicalId":349527,"journal":{"name":"2016 International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114726441","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":"Improved task partition based fault-tolerant rate-monotonic scheduling algorithm","authors":"Pengze Guo, Zhi Xue","doi":"10.1109/SSIC.2016.7571812","DOIUrl":"https://doi.org/10.1109/SSIC.2016.7571812","url":null,"abstract":"Real-time fault-tolerant scheduling algorithms aim to reduce hardware redundancy for hard real-time systems. In this paper, improved algorithms TPFTRMS and TPFTRMG for preemptively scheduling periodic tasks with primary/backup fault-tolerant scheme are presented. The algorithms use the task partition, backup overlapping and backup deallocation techniques. Task partition makes the algorithm less sophisticated and more efficient. Backup overlapping reduces the redundancy introduced by active backup and makes the computing resources fully utilized. Backup deallocation releases resources once the computation is over and thus reduces the system overhead. Different scheduling strategies are adopted in different scenarios, which makes the algorithms more adaptive. Simulation results show that compared with previous algorithms, the new schemes need less processors and lower time complexity.","PeriodicalId":349527,"journal":{"name":"2016 International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128658945","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":"Secure range query based on privacy-preserving function in two-tiered sensor networks","authors":"Peng Chen, Weini Zeng, Yong Zhu, Yingyan Gu","doi":"10.1109/SSIC.2016.7571805","DOIUrl":"https://doi.org/10.1109/SSIC.2016.7571805","url":null,"abstract":"To prevent attackers from gaining privacy information from both sensory data and sink issued queries, a secure scheme named SQPF was proposed, which allows the sink to detect compromised misbehaved storage nodes. By a privacy preserving technique based on data hidden, the sensory data and queries are encoded while the storage node can correctly process encoded queries over encoded data. By a novel verification chain technique, the sink is allowed to verify the integrity of the returned data items. Analyses show SQPF is able to preserve privacy more efficiently while consuming less communication overhead.","PeriodicalId":349527,"journal":{"name":"2016 International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131948496","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":"Evaluation of RAIN RFID authentication schemes","authors":"A. Khalid, E. Conchon, F. Peyrard","doi":"10.1109/SSIC.2016.7571807","DOIUrl":"https://doi.org/10.1109/SSIC.2016.7571807","url":null,"abstract":"In this paper, we present different authentication schemes of Radio Frequency Identification (RFID) Generation 2 version 2 (Gen2V2) in UHF mode. We model the anti-collision management and evaluate it by simulation with OMNeT++. We evaluate the overall performance of RFID Gen2v2 network in terms of measurement of collisions and association time. We present four main cryptographic suites of the Gen2V2 standard, namely XOR, AES128, PRESENT80 and CryptoGPS. After their modelling and simulation, the obtained results allow us to put forward the necessary time for each authentication algorithms. The objective of this work is to show the impact of the cryptographic suites used to ensure the authentication of connected objects in the Internet of Things.","PeriodicalId":349527,"journal":{"name":"2016 International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130716116","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":"Clustering methods comparison: Application to source based detection of botclouds","authors":"Badis Hammi, Mohamed-Cherif Rahal, R. Khatoun","doi":"10.1109/SSIC.2016.7571810","DOIUrl":"https://doi.org/10.1109/SSIC.2016.7571810","url":null,"abstract":"Recently, cloud computing has conquered IT markets and majority of institutions use its services at different scales. As any IT technology, cloud computing suffers from security issues and numerous studies were - and in progress - given in order to overcome them. However, most of the latter focus on data, users and infrastructure security from external attacks, and very few ones focus on the issue of using the cloud's infrastructure as an attack tool or support. To address the issue of botnets hosted in the cloud, we realized an experimental campaign where we implemented a botnet on a virtualized infrastructure and realized numerous attacks. The collected data was exploited in order to study and compare the effectiveness of clustering methods in the detection of DDoS attacks generated by botnets in the cloud.","PeriodicalId":349527,"journal":{"name":"2016 International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130611867","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}
Andrei F. Klein, Mihai Stefanescu, A. Saied, Kurt Swakhoven
{"title":"The performance impact of encryption in an asynchronous cloud environment","authors":"Andrei F. Klein, Mihai Stefanescu, A. Saied, Kurt Swakhoven","doi":"10.1109/SSIC.2016.7571802","DOIUrl":"https://doi.org/10.1109/SSIC.2016.7571802","url":null,"abstract":"The main objective of this paper is to determine the impact of securely connecting and communicating with a specific implementation of a message broker called ActiveMQ. ActiveMQ is “an open sourced implementation of JMS 1.1” [1]. Using the same tools on the same hardware, the same scenarios are tested with and without encryption in order to determine what kind of performance impact encrypting the traffic has. The final results can be used as a reference point for deciding if the extra encryption layer is worth any potential performance penalty based on where both endpoints, the ActiveMQ cluster and the client, are located and the business requirements of the projects involved.","PeriodicalId":349527,"journal":{"name":"2016 International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"59 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132602589","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":"Cube attack on reduced-round Enhanced-Bivium","authors":"Shiyong Zhang, Gongliang Chen, Jianhua Li","doi":"10.1109/SSIC.2016.7571808","DOIUrl":"https://doi.org/10.1109/SSIC.2016.7571808","url":null,"abstract":"Trivium is a notable light-weight synchronous stream cipher submitted to the European eSTREAM project in April 2005. Enhanced-Bivium is a reduced version of Trivium which is suitable for RFID system. In this paper, the security of Enhanced-Bivium is concerned under cube attack, which is one of the best known attack on the reduced round Trivium proposed by Dinur and Shamir at EUROCRYPT 09. Trivium with 576 initialization rounds can be recovered in 211. We show that it is difficult to search the cubes of Enhanced-Bivium with the same rounds and after 464 rounds the attack complexity is reduced to 255. Therefore, comparing with Trivium, Enhanced-Bivium has a better performance under cube attack.","PeriodicalId":349527,"journal":{"name":"2016 International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115548426","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":"Cooperation behavior of vehicles in an evolutionary game for information dissemination","authors":"Jun Zhang, H. Labiod, Mengying Ren, Hengchuan Tan","doi":"10.1109/SSIC.2016.7571811","DOIUrl":"https://doi.org/10.1109/SSIC.2016.7571811","url":null,"abstract":"In this paper, we study the cooperation behavior of vehicles in a VANET (vehicle ad hoc network) for information dissemination. Any vehicle is only allowed to adopt one of two strategies at the same time: cooperation (forwarding) or defection (dropping), and may change its strategy periodically. We consider the scenario that the incentive for cooperation of any vehicle is controlled according to evolutionary game theory, so that any node only learns its new strategy from its neighbors. Through simulations, we illustrate that, how different parameters, such as node degree, information dissemination amount, information dissemination scheme, channel accessing probability, affect the incentive to be a cooperator for each vehicle in the network.","PeriodicalId":349527,"journal":{"name":"2016 International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"82 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114330531","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":"An approach based on the clustering coefficient for the community detection in social networks","authors":"Khawla Asmi, D. Lotfi, M. El Marraki","doi":"10.1109/SSIC.2016.7571803","DOIUrl":"https://doi.org/10.1109/SSIC.2016.7571803","url":null,"abstract":"The community detection in a social network has been become a key issue to discover the most important organizations in networks. Thenceforth, various approaches are proposed to resolve this inference problem. However, the applicability of these existing methods is trapped by their computational cost. In this paper, we propose a promising approach based on the clustering coefficient and the common neighbors similarity to detect the communities, then, we give the mathematical proof of the used technique. The experiments show the efficiency of our proposed method comparing to the CNM and the WalkTrap methods. Moreover, its computational run-time has a linear complexity.","PeriodicalId":349527,"journal":{"name":"2016 International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133220596","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}