DASC-PICom-DataCom-CyberSciTech 2017 : 2017 IEEE 15th International Conference on Dependable, Autonomic and Secure Computing ; 2017 IEEE 15th International Conference on Pervasive Intelligence and Computing ; 2017 IEEE 3rd International...最新文献
M. S. Alkatheiri, Yu Zhuang, Mikhail Korobkov, A. Sangi
{"title":"An experimental study of the state-of-the-art PUFs implemented on FPGAs","authors":"M. S. Alkatheiri, Yu Zhuang, Mikhail Korobkov, A. Sangi","doi":"10.1109/DESEC.2017.8073844","DOIUrl":"https://doi.org/10.1109/DESEC.2017.8073844","url":null,"abstract":"Authentication and cryptographic key generation mechanisms are used in a broad range of security related applications. While there have been substantial efforts among the security research community, challenges in implementation methods for authentication and cryptographic key generation still prevail. With inherent irreplicability, Physical Unclonable Functions (PUFs) provide a new solution to security challenges. However, designing a new PUF or finding an appropriate existing PUF for each new security application is not an easy task, and it requires a set of particular properties to suite particular application. Thus, a thorough experimental study of numerous PUFs can provide useful information on different properties of these PUFs. Moreover, PUF development researchers can utilize the study results to design new PUFs with enhanced properties or to overcome deficiencies of existing PUFs. This paper is an effort to implement a group of state-of-the-art PUFs on two models of FPGAs and also to carry out an experimental analysis that evaluates the implemented PUFs. Our study focused on two major classes of PUFs: path-delay-based PUFs and frequency-variation-based PUFs with three designs in each of two classes. The experimental results provide useful information for security application developers to devise innovative PUF-utilized security applications as well as PUF design researchers to design PUFs for particular applications.","PeriodicalId":92346,"journal":{"name":"DASC-PICom-DataCom-CyberSciTech 2017 : 2017 IEEE 15th International Conference on Dependable, Autonomic and Secure Computing ; 2017 IEEE 15th International Conference on Pervasive Intelligence and Computing ; 2017 IEEE 3rd International...","volume":"117 1","pages":"174-180"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89123830","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":"Security analysis of computing systems from circuit-architectural perspective","authors":"S. Taheri, Jiann-Shiun Yuan","doi":"10.1109/DESEC.2017.8073843","DOIUrl":"https://doi.org/10.1109/DESEC.2017.8073843","url":null,"abstract":"Security and energy are considered as the most important parameters for designing and building an emerging computing system. Today's attacks target different layers of the computing system in both software- and hardware-level. On the other side, introduction of new transistor and memory technologies to the integrated circuits design is beneficial, especially for low energy requirements. However, they might bring new security vulnerabilities as well. Due to these issues, development of novel testing and security checking techniques is obligatory. In this regard, we study two attacks on a computing system within the domain of emerging transistor and memory technologies. A built-in-self-test architecture for testing and security checking an emerging memory is presented. At last, a defense technique is proposed that can identify and detect any abnormal behavior shown from the integrated circuits within the computing system using their current signals.","PeriodicalId":92346,"journal":{"name":"DASC-PICom-DataCom-CyberSciTech 2017 : 2017 IEEE 15th International Conference on Dependable, Autonomic and Secure Computing ; 2017 IEEE 15th International Conference on Pervasive Intelligence and Computing ; 2017 IEEE 3rd International...","volume":"1 1","pages":"166-173"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83567097","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}
Fatimah M. Alturkistani, Saad S. Alaboodi, S. Brohi
{"title":"An analytical model for reliability evaluation of cloud service provisioning systems","authors":"Fatimah M. Alturkistani, Saad S. Alaboodi, S. Brohi","doi":"10.1109/DESEC.2017.8073821","DOIUrl":"https://doi.org/10.1109/DESEC.2017.8073821","url":null,"abstract":"With the growing popularity of cloud computing, the reliability of cloud services has become a key concern of cloud service providers and users. Several researchers have studied the problem of cloud service reliability assurance. However, the complexity of the cloud service provisioning system and the deep dependency stack of its layered architecture make it challenging to evaluate the reliability of cloud services. In this paper, we propose a novel analytical model of cloud service provisioning systems reliability. Further, we provide a detailed methodology for evaluating cloud service reliability using reliability block diagrams and probabilistic methods. The proposed model can be used by cloud providers to assure the reliability of their cloud services. The results of a case study using simulated cloud computing infrastructure verify the effectiveness of the proposed model.","PeriodicalId":92346,"journal":{"name":"DASC-PICom-DataCom-CyberSciTech 2017 : 2017 IEEE 15th International Conference on Dependable, Autonomic and Secure Computing ; 2017 IEEE 15th International Conference on Pervasive Intelligence and Computing ; 2017 IEEE 3rd International...","volume":"92 1","pages":"340-347"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79160823","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":"Wireless intrusion prevention system using dynamic random forest against wireless MAC spoofing attack","authors":"Seok-Hwan Choi, Doo-Hee Hwang, Yoon-Ho Choi","doi":"10.1109/DESEC.2017.8073804","DOIUrl":"https://doi.org/10.1109/DESEC.2017.8073804","url":null,"abstract":"With the emergency of Bring Your Own Device (BOYD) and Internet of Things (IoT) in enterprises, there has been an increase in the use of wireless networks through mobile devices and tablet computers. However, as a negative effect, such increase has also led to increased security threat in wireless networks and thus, the importance of wireless network security has increased. As a way to cope with such threat, many enterprises have introduced wireless intrusion prevention system (WIPS) solution, which consists of WIPS sensors and a centralized WIPS server. By monitoring the radio signal in wireless local area networks (LAN), WIPS solution shuts off access by an unauthorized wireless device and prevents an rogue Access Point (AP). In this paper, we propose an implementation framework for WIPS solution that ananlzes the received signal strength (RSS) values collected from multiple WIPS sensors. By overcoming the performance (including accuracy and F-measure) decrease in the wireless environment with much noise, the proposed WIPS solution shows the high performance even under the wireless environment with low signal-to-noise ratio (SNR). For this purpose, the proposed WIPS solution analyzes the RSS values collected from multiple WIPS sensors by using a dynamic random forest (DRF) algorithm. By adding trees that are the most suitable to forest, the DRF algorithm can improve the performance of the WIPS solution. From the experimental results, it is observed that the proposed WIPS solution combined with the DRF algorithm shows the good-enough performance under various SNR and attack distance.","PeriodicalId":92346,"journal":{"name":"DASC-PICom-DataCom-CyberSciTech 2017 : 2017 IEEE 15th International Conference on Dependable, Autonomic and Secure Computing ; 2017 IEEE 15th International Conference on Pervasive Intelligence and Computing ; 2017 IEEE 3rd International...","volume":"10 1","pages":"131-137"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88570620","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":"Hidden process detection using kernel functions instrumentation","authors":"Yacine Hebbal, S. Laniepce, Jean-Marc Menaud","doi":"10.1109/DESEC.2017.8073805","DOIUrl":"https://doi.org/10.1109/DESEC.2017.8073805","url":null,"abstract":"Process hiding is a common attack used by long-lived malicious processes to conceal their presence from security and administration tools. Multiple techniques based on Virtual Machine Introspection (VMI) were proposed to detect the presence of hidden running process in virtual machines. However, existing techniques are not practical for real world cloud environments as they suffer from evasion attacks or use manually provided and too OS-specific information. In this paper we present HPD, a VMI-based Hidden Process Detector that instruments guest OS kernel functions to automatically and reliably detect and terminate execution of hidden processes. We designed and implemented a prototype of HPD on KVM hypervisor. Its evaluation on multiple Linux kernels shows that from the hypervisor level, HPD detects successfully the presence of hidden running processes and safely terminate their execution.","PeriodicalId":92346,"journal":{"name":"DASC-PICom-DataCom-CyberSciTech 2017 : 2017 IEEE 15th International Conference on Dependable, Autonomic and Secure Computing ; 2017 IEEE 15th International Conference on Pervasive Intelligence and Computing ; 2017 IEEE 3rd International...","volume":"203 1","pages":"138-145"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88572810","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":"MIRAGE: Randomizing large chunk allocation via dynamic binary instrumentation","authors":"Zhenghao Hu, Yuanyuan Zhang, Hui Wang, Juanru Li, Wenbo Yang, Dawu Gu","doi":"10.1109/DESEC.2017.8073800","DOIUrl":"https://doi.org/10.1109/DESEC.2017.8073800","url":null,"abstract":"Heap security relies heavily on the randomness of chunk allocations in memory allocators to mitigate heap fengshui and heap spraying attacks, which are the most widely used techniques in modern exploits. However, randomness in large chunk allocation has been overlooked. Memory allocators directly call mmap (sometimes brk) syscall to allocate large chunks, while the Linux kernel does not provide a fine-grained randomization for mmap/brk syscall — only the base address is randomized, but the offset between every two syscalls is predictable. The less randomized large chunk will be vulnerable to heap fengshui and heap spraying attacks. In this paper, we assess the security of three most representative general-purpose memory allocators, Glibc ptmalloc, OpenBSD PHK malloc, and DieHarder, in scenario of large-chunk-based attacks, with successful heap fengshui and heap spraying attacks under Nginx. We then present MIRAGE, a transparent, portable, and memory allocator agnostic, runtime large chunk randomizer to fortify the existing memory allocators against large-chunk-based attacks. Large chunk fengshui and spraying attacks can be successfully mitigated by MIRAGE with a fine-grained randomization in mmap/brk syscall. And, MIRAGE imposes an acceptable overhead in performance.","PeriodicalId":92346,"journal":{"name":"DASC-PICom-DataCom-CyberSciTech 2017 : 2017 IEEE 15th International Conference on Dependable, Autonomic and Secure Computing ; 2017 IEEE 15th International Conference on Pervasive Intelligence and Computing ; 2017 IEEE 3rd International...","volume":"29 1","pages":"98-106"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84669182","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 S-box construction using different irreducible polynomial and constant 8-bit vector","authors":"Alamsyah, Agus Bejo, T. B. Adji","doi":"10.1109/DESEC.2017.8073857","DOIUrl":"https://doi.org/10.1109/DESEC.2017.8073857","url":null,"abstract":"S-box plays a major role in the AES algorithm. The strength of S-box depends on the design and algebraic constructions. In this paper, the construction of S-box will be built using a basic polynomial equation and the addition of a constant 8-bit vector different from the standard AES. The quality of the created S-box is evaluated by measuring several standard criteria such as nonlinearity, strict avalanche criterion (SAC), and bit independence criterion-nonlinearity (BIC-Nonlinearity). The evaluation shows that the values of nonlinearity, SAC, and BIC-Nonlinearity are 112, 0.4995, and 112 respectively. This research also found that the proposed S-box construction method outperforms other existing S-boxes construction methods.","PeriodicalId":92346,"journal":{"name":"DASC-PICom-DataCom-CyberSciTech 2017 : 2017 IEEE 15th International Conference on Dependable, Autonomic and Secure Computing ; 2017 IEEE 15th International Conference on Pervasive Intelligence and Computing ; 2017 IEEE 3rd International...","volume":"127 1","pages":"366-369"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85716863","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":"Hosting distributed databases on internet of things-scale devices","authors":"D. Richardson, Alan C. Lin, John M. Pecarina","doi":"10.1109/DESEC.2017.8073855","DOIUrl":"https://doi.org/10.1109/DESEC.2017.8073855","url":null,"abstract":"The Internet of Things (IoT) era envisions billions of interconnected devices capable of providing new interactions between the physical and digital worlds, offering new range of content and services. At the fundamental level, IoT nodes are physical devices that exist in the real world, consisting of networking, sensor, and processing components. Some application examples include mobile and pervasive computing or sensor nets, and require distributed device deployment that feed information into databases for exploitation. While the data can be centralized, there are advantages, such as system resiliency and security to adopting a decentralized architecture that pushes the computation and storage to the network edge and onto IoT devices. However, these devices tend to be much more limited in computation power than traditional racked servers. This research explores using the Cassandra distributed database on IoT-representative device specifications. Experiments conducted on both virtual machines and Raspberry Pi's to simulate IoT devices, examined latency issues with network compression, processing workloads, and various memory and node configurations in laboratory settings. We demonstrate that distributed databases are feasible on Raspberry Pi's as IoT representative devices and show findings that may help in application design.","PeriodicalId":92346,"journal":{"name":"DASC-PICom-DataCom-CyberSciTech 2017 : 2017 IEEE 15th International Conference on Dependable, Autonomic and Secure Computing ; 2017 IEEE 15th International Conference on Pervasive Intelligence and Computing ; 2017 IEEE 3rd International...","volume":"34 1","pages":"352-357"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82509696","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":"Landslide prediction with model switching","authors":"Shi-Feng Chen, Pao-Ann Hsiung","doi":"10.1109/DESEC.2017.8073846","DOIUrl":"https://doi.org/10.1109/DESEC.2017.8073846","url":null,"abstract":"Landslides could cause huge damages to properties and severe loss of lives. Landslides can be detected by analyzing the environment data collected via wireless sensor networks (WSN). However, environment data are usually complex and undergo rapid changes. Thus, if landslides can be predicted, people can leave the hazardous areas earlier. A good prediction mechanism is thus critical. Currently, a widely-used method is Artificial Neural Networks (ANNs), which give accurate predictions and exhibit high learning ability. Through training, the ANN weight coefficients can be made precise enough so that the network works similar to a human brain. However, when we have an imbalanced distribution of data, ANNs will not be able to learn the pattern of minority class, that is, the class of very few data samples. As a result, the predictions could be inaccurate. To overcome this shortcoming of ANNs, this work proposes a model switching strategy that can choose between different predictors according to environmental states. Our proposed method can improve prediction performance, and the landslide prediction system can give warnings in an average of 44 minutes prior to landslide occurrence.","PeriodicalId":92346,"journal":{"name":"DASC-PICom-DataCom-CyberSciTech 2017 : 2017 IEEE 15th International Conference on Dependable, Autonomic and Secure Computing ; 2017 IEEE 15th International Conference on Pervasive Intelligence and Computing ; 2017 IEEE 3rd International...","volume":"20 1","pages":"232-236"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81736009","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":"Fair deposits against double-spending for Bitcoin transactions","authors":"Xingjie Yu, M. Shiwen, Yingjiu Li, R. Deng","doi":"10.1109/DESEC.2017.8073796","DOIUrl":"https://doi.org/10.1109/DESEC.2017.8073796","url":null,"abstract":"In Bitcoin network, the distributed storage of multiple copies of the blockchain opens up possibilities for double spending, i.e., a payer issues two separate transactions to two different payees transferring the same coins. To detect the doublespending and penalize the malicious payer, decentralized non-equivocation contracts have been proposed. The basic idea of these contracts is that the payer locks some coins in a deposit when he initiates a transaction with the payee. If the payer double spends, a cryptographic primitive called accountable assertions can be used to reveal his Bitcoin credentials for the deposit. Thus, the malicious payer could be penalized by the loss of deposit coins. However, such decentralized non-equivocation contracts are subjected to collusion attacks where the payer colludes with the beneficiary of the deposit and transfers the Bitcoin deposit back to himself when he double spends, resulting in no penalties. On the other hand, even if the beneficiary behaves honestly, the victim payee cannot get any compensation directly from the deposit in the original design. To prevent such collusion attacks, we design fair deposits for Bitcoin transactions to defend against double-spending. The fair deposits ensure that the payer will be penalized by the loss of his deposit coins if he double spends and the victim payee's loss will be compensated. We start with proposing protocols of making a deposit for Bitcoin transactions. We then analyze the performance of deposits made for Bitcoin transactions and show how the fair deposits work efficiently in Bitcoin.","PeriodicalId":92346,"journal":{"name":"DASC-PICom-DataCom-CyberSciTech 2017 : 2017 IEEE 15th International Conference on Dependable, Autonomic and Secure Computing ; 2017 IEEE 15th International Conference on Pervasive Intelligence and Computing ; 2017 IEEE 3rd International...","volume":"20 1","pages":"44-51"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86933531","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}