Pub Date : 2018-02-01DOI: 10.1109/NTMS.2018.8328751
Adnan Imeri, D. Khadraoui
This paper aims at showing a conceptual approach for security and traceability of shared information in the process of transportation of dangerous goods. Concerning the transport of dangerous goods, the process generates particular information, which is necessary to share with the stakeholders involved in this process. This information is considered sensitive, because it may contain the timestamp of movement of goods, information related to the goods, contractual business details, etc., and unauthorized parties should not access them. At any level, the process should remain transparent between stakeholders', with immutable properties on data sharing and the whole process should be auditable. We examine a general procedure for contractual issues for transportation of dangerous goods between stakeholders and its conceptual implementation by blockchain based on smart contracts.
{"title":"The Security and Traceability of Shared Information in the Process of Transportation of Dangerous Goods","authors":"Adnan Imeri, D. Khadraoui","doi":"10.1109/NTMS.2018.8328751","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328751","url":null,"abstract":"This paper aims at showing a conceptual approach for security and traceability of shared information in the process of transportation of dangerous goods. Concerning the transport of dangerous goods, the process generates particular information, which is necessary to share with the stakeholders involved in this process. This information is considered sensitive, because it may contain the timestamp of movement of goods, information related to the goods, contractual business details, etc., and unauthorized parties should not access them. At any level, the process should remain transparent between stakeholders', with immutable properties on data sharing and the whole process should be auditable. We examine a general procedure for contractual issues for transportation of dangerous goods between stakeholders and its conceptual implementation by blockchain based on smart contracts.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130310251","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328671
Bouchaib Assila, A. Kobbane, M. Elkoutbi
In this paper, we exploit the Fog Computing features and the caching capabilities to improve low-latency and throughput transmission for 5G Internet of things (IoT) Devices. We set in a challenge on the radio capabilities of the Small Cell Networks (SCNs), to provide radio transmission rate, and the fog computing, to manage distributed networking, computing and storage resources. The IoT devices, as a content requester will take advantage of emerging caching techniques to accomplish the on-demand low-latency services that require a large amount of computing resources and a high throughput. To overcome the increasing number of IoT devices and the limited computing resources in fog computing to allocate devices, we propose a many-to-one matching game between the sets of devices and the set of fogs. To solve this game, we exploit the deferred acceptance algorithm that enables the players to self-organize into a stable matching and a reasonable number of algorithm iterations. The goal of the proposed game theory approach is to optimize the fog computing resources to satisfy the increasing IoT devices requests. Simulation results has demonstrated that our proposed matching strategy coupled to caching capabilities on distributed fog computing significantly outperforms the traditional caching strategies in terms of the cache hit ratio, average latency and back-haul traffic load.
{"title":"A Many-To-One Matching Game Approach to Achieve Low-Latency Exploiting Fogs and Caching","authors":"Bouchaib Assila, A. Kobbane, M. Elkoutbi","doi":"10.1109/NTMS.2018.8328671","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328671","url":null,"abstract":"In this paper, we exploit the Fog Computing features and the caching capabilities to improve low-latency and throughput transmission for 5G Internet of things (IoT) Devices. We set in a challenge on the radio capabilities of the Small Cell Networks (SCNs), to provide radio transmission rate, and the fog computing, to manage distributed networking, computing and storage resources. The IoT devices, as a content requester will take advantage of emerging caching techniques to accomplish the on-demand low-latency services that require a large amount of computing resources and a high throughput. To overcome the increasing number of IoT devices and the limited computing resources in fog computing to allocate devices, we propose a many-to-one matching game between the sets of devices and the set of fogs. To solve this game, we exploit the deferred acceptance algorithm that enables the players to self-organize into a stable matching and a reasonable number of algorithm iterations. The goal of the proposed game theory approach is to optimize the fog computing resources to satisfy the increasing IoT devices requests. Simulation results has demonstrated that our proposed matching strategy coupled to caching capabilities on distributed fog computing significantly outperforms the traditional caching strategies in terms of the cache hit ratio, average latency and back-haul traffic load.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131099765","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328709
Daniel Fraunholz, Daniel Krohmer, Frederic Pohl, H. Schotten
Information security is a fast-changing domain. Traditional security mechanisms such as firewalls and access control are circumvented regularly. The amount of significant security incidents grows each year. Deception systems are a perfect match to support perimeter-based technologies in intrusion detection, data breach identification and data leakage prevention. In this work, a framework is proposed generating, deploying, monitoring and maintaining honeytokens on a host system. The framework is easily extendable and flexible in its use. The authors also describe a prototype implementation for four different types of tokens and thereby address typical issues when operating honeytokens.
{"title":"On the Detection and Handling of Security Incidents and Perimeter Breaches - A Modular and Flexible Honeytoken based Framework","authors":"Daniel Fraunholz, Daniel Krohmer, Frederic Pohl, H. Schotten","doi":"10.1109/NTMS.2018.8328709","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328709","url":null,"abstract":"Information security is a fast-changing domain. Traditional security mechanisms such as firewalls and access control are circumvented regularly. The amount of significant security incidents grows each year. Deception systems are a perfect match to support perimeter-based technologies in intrusion detection, data breach identification and data leakage prevention. In this work, a framework is proposed generating, deploying, monitoring and maintaining honeytokens on a host system. The framework is easily extendable and flexible in its use. The authors also describe a prototype implementation for four different types of tokens and thereby address typical issues when operating honeytokens.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132383477","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328748
Áine MacDermott, T. Baker, Q. Shi
Challenges for IoT-based forensic investigations include the increasing amount of objects of forensic interest, relevance of identified and collected devices, blurry network boundaries, and edgeless networks. As we look ahead to a world of expanding ubiquitous computing, the challenge of forensic processes such as data acquisition (logical and physical) and extraction and analysis of data grows in this space. Containing an IoT breach is increasingly challenging - evidence is no longer restricted to a PC or mobile device, but can be found in vehicles, RFID cards, and smart devices. Through the combination of cloud-native forensics with client-side forensics (forensics for companion devices), we can study and develop the connection to support practical digital investigations and tackle emerging challenges in digital forensics. With the IoT bringing investigative complexity, this enhances challenges for the Internet of Anything (IoA) era. IoA brings anything and everything "online" in a connectedness that generates an explosion of connected devices, from fridges, cars and drones, to smart swarms, smart grids and intelligent buildings. Research to identify methods for performing IoT-based digital forensic analysis is essential. The long-term goal is the development of digital forensic standards that can be used as part of overall IoT and IoA security and aid IoT-based investigations.
{"title":"Iot Forensics: Challenges for the Ioa Era","authors":"Áine MacDermott, T. Baker, Q. Shi","doi":"10.1109/NTMS.2018.8328748","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328748","url":null,"abstract":"Challenges for IoT-based forensic investigations include the increasing amount of objects of forensic interest, relevance of identified and collected devices, blurry network boundaries, and edgeless networks. As we look ahead to a world of expanding ubiquitous computing, the challenge of forensic processes such as data acquisition (logical and physical) and extraction and analysis of data grows in this space. Containing an IoT breach is increasingly challenging - evidence is no longer restricted to a PC or mobile device, but can be found in vehicles, RFID cards, and smart devices. Through the combination of cloud-native forensics with client-side forensics (forensics for companion devices), we can study and develop the connection to support practical digital investigations and tackle emerging challenges in digital forensics. With the IoT bringing investigative complexity, this enhances challenges for the Internet of Anything (IoA) era. IoA brings anything and everything \"online\" in a connectedness that generates an explosion of connected devices, from fridges, cars and drones, to smart swarms, smart grids and intelligent buildings. Research to identify methods for performing IoT-based digital forensic analysis is essential. The long-term goal is the development of digital forensic standards that can be used as part of overall IoT and IoA security and aid IoT-based investigations.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134243117","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328690
Johan Garcia
Hashing is used in a wide variety of security contexts. Hashes of parts of files, fragment hashes, can be used to detect remains of deleted files in cluster slack, to detect illicit files being sent over a network, to perform approximate file matching, or to quickly scan large storage devices using sector sampling. In this work we examine the fragment hash uniqueness and hash duplication characteristics of five different data sets with a focus on JPEG images and compressed file archives. We consider both block and rolling hashes and evaluate sizes of the hashed fragments ranging from 16 to 4096 bytes. During an initial hash generation phase hash metadata is created for each data set, which in total becomes several several billion hashes. During the scan phase each other data set is scanned and hashes checked for potential matches in the hash metadata. Three aspects of fragment hashes are examined: 1) the rate of duplicate hashes within each data set, 2) the rate of hash misattribution where a fragment hash from the scanned data set matches a fragment in the hash metadata although the actual file is not present in the scan set, 3) to what extent it is possible to detect fragments from files in a hashed set when those files have been compressed and embedded in a zip archive. The results obtained are useful as input to dimensioning and evaluation procedures for several application areas of fragment hashing.
{"title":"Duplications and Misattributions of File Fragment Hashes in Image and Compressed Files","authors":"Johan Garcia","doi":"10.1109/NTMS.2018.8328690","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328690","url":null,"abstract":"Hashing is used in a wide variety of security contexts. Hashes of parts of files, fragment hashes, can be used to detect remains of deleted files in cluster slack, to detect illicit files being sent over a network, to perform approximate file matching, or to quickly scan large storage devices using sector sampling. In this work we examine the fragment hash uniqueness and hash duplication characteristics of five different data sets with a focus on JPEG images and compressed file archives. We consider both block and rolling hashes and evaluate sizes of the hashed fragments ranging from 16 to 4096 bytes. During an initial hash generation phase hash metadata is created for each data set, which in total becomes several several billion hashes. During the scan phase each other data set is scanned and hashes checked for potential matches in the hash metadata. Three aspects of fragment hashes are examined: 1) the rate of duplicate hashes within each data set, 2) the rate of hash misattribution where a fragment hash from the scanned data set matches a fragment in the hash metadata although the actual file is not present in the scan set, 3) to what extent it is possible to detect fragments from files in a hashed set when those files have been compressed and embedded in a zip archive. The results obtained are useful as input to dimensioning and evaluation procedures for several application areas of fragment hashing.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130579720","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328686
Amjad Alsirhani, S. Sampalli, P. Bodorik
Cloud computing is a model of configurable computing resources such as servers, networks, storages, applications, and services that are available from anywhere at any time. In addition, cloud computing is managed by experts from different computer science fields to provide high reliability, availability, mobility, security, and scalability. Of course, security against all form of attacks, including DDoS attack, must be provided. Numerous DDoS attacks have been launched against different organizations in the last decade and numerous approaches have been proposed and tried to detect and prevent DDoS attacks by utilizing classification algorithms. In this research, we propose a DDoS detection system that benefits from cloud computing resources. Our proposed system consists of three concepts: classification algorithms, parallelism computing, and a fuzzy logic system. Classification algorithms are used in our system to classify and predict DDoS attacks on traffic packets. The parallelism concept is used to efficiently accelerate the execution of the utilized classification algorithms. The fuzzy logic is used to choose which of the classification algorithms is to be used next. We evaluated the classification algorithm and the parallel processing of the DDoS detection by configuring a test-bed that consists of one master and three slaves. We validated the fuzzy logic system by using the MATLAB statistical tool.
{"title":"DDoS Attack Detection System: Utilizing Classification Algorithms with Apache Spark","authors":"Amjad Alsirhani, S. Sampalli, P. Bodorik","doi":"10.1109/NTMS.2018.8328686","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328686","url":null,"abstract":"Cloud computing is a model of configurable computing resources such as servers, networks, storages, applications, and services that are available from anywhere at any time. In addition, cloud computing is managed by experts from different computer science fields to provide high reliability, availability, mobility, security, and scalability. Of course, security against all form of attacks, including DDoS attack, must be provided. Numerous DDoS attacks have been launched against different organizations in the last decade and numerous approaches have been proposed and tried to detect and prevent DDoS attacks by utilizing classification algorithms. In this research, we propose a DDoS detection system that benefits from cloud computing resources. Our proposed system consists of three concepts: classification algorithms, parallelism computing, and a fuzzy logic system. Classification algorithms are used in our system to classify and predict DDoS attacks on traffic packets. The parallelism concept is used to efficiently accelerate the execution of the utilized classification algorithms. The fuzzy logic is used to choose which of the classification algorithms is to be used next. We evaluated the classification algorithm and the parallel processing of the DDoS detection by configuring a test-bed that consists of one master and three slaves. We validated the fuzzy logic system by using the MATLAB statistical tool.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116068961","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328745
Tatsuya Sato, Yosuke Himura
Enterprises have paid attention to blockchain (BC), recently permissioned BC characterized with smart-contract, where busi-ness transactions among inter-authorized companies (forming consortium) can automatically be executed based on distributed consensus protocol over user-defined business logics pre-built with program codes. A single BC system will be built across mul-tiple management domains having different operational policies, e.g., datacenter of each organization; this will trigger a problem that its system operations (e.g., backup) will become time-consuming and costly due to the difficulty in unifying and/or adjusting operational policy, schedule, etc. Toward solving the problem, we propose an operations execution method for BC systems; a primary idea is to define operations as smart-contract so that unified and synchronized cross-organizational operations can be executed effectively by using BC-native features. We de-sign the proposed method as hybrid architecture including in-BC consensus establishment and out-BC event-based instruction execution, in order to be adaptable to the recent heterogeneous BC architecture. Performance evaluation using a prototype with Hyperledger Fabric v1.0 shows that the proposed method can start executing operations within 5 seconds. Furthermore, cost evaluation using model-based estimation shows that the total yearly cost of monthly operations on a 5-organizational BC sys-tem could be reduced by 61 percent compared to a conventional manual method.
{"title":"Smart-Contract Based System Operations for Permissioned Blockchain","authors":"Tatsuya Sato, Yosuke Himura","doi":"10.1109/NTMS.2018.8328745","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328745","url":null,"abstract":"Enterprises have paid attention to blockchain (BC), recently permissioned BC characterized with smart-contract, where busi-ness transactions among inter-authorized companies (forming consortium) can automatically be executed based on distributed consensus protocol over user-defined business logics pre-built with program codes. A single BC system will be built across mul-tiple management domains having different operational policies, e.g., datacenter of each organization; this will trigger a problem that its system operations (e.g., backup) will become time-consuming and costly due to the difficulty in unifying and/or adjusting operational policy, schedule, etc. Toward solving the problem, we propose an operations execution method for BC systems; a primary idea is to define operations as smart-contract so that unified and synchronized cross-organizational operations can be executed effectively by using BC-native features. We de-sign the proposed method as hybrid architecture including in-BC consensus establishment and out-BC event-based instruction execution, in order to be adaptable to the recent heterogeneous BC architecture. Performance evaluation using a prototype with Hyperledger Fabric v1.0 shows that the proposed method can start executing operations within 5 seconds. Furthermore, cost evaluation using model-based estimation shows that the total yearly cost of monthly operations on a 5-organizational BC sys-tem could be reduced by 61 percent compared to a conventional manual method.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116108982","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328708
J. Hamie, Ali Hamieh, Joumana A. Younis, Moussa Ammar, A. Ahmad-Kassem, A. Skaiky, A. Hamie, A. Nasser, H. Abdallah
Wireless Body Area Networks (WBANs) have been subject to important research efforts for the past years. They are indeed expected to fulfil the needs of a variety of emerging human centric applications at very low cost and ultra-low power (e.g. healthcare, wellness, security, sports, gaming). Even more recently these networks have been considered for radiolocation purposes (i.e. out of transmitted signals on and around the body). This new localization add-on is rather based on the estimation of the separating distance between the WBANs devices, based on radio technologies such as Narrow-Band (N-B) and/or even Impulse Radio-Ultra Wideband (IR-UWB). In this context we present herein a theoretical modeling of WBANs ranging errors based on IR-UWB Time Of Arrival (TOA) estimation. This model consists in applying a Cramer Rao Lower Bound (CRLB) expression for discussions, after extracting realistic Channel Impulse Response (CIR) out of recent UWB multipath channel measurement campaign. The CRLB of any unbiased TOA estimator is computed in the [3.1, 5.1]GHz and [3.75, 4.25]GHz bands. The latter frequency band is compliant with the channel 2 of the IEEE 802.15.4a standard, as well as with one mandatory band imposed by the IEEE 802.15.6 standardization group.
{"title":"On the Cramer-Rao Lower Bounds of Ranging Based on IR-UWB TOA Estimation in Wirelessbody Area Networks","authors":"J. Hamie, Ali Hamieh, Joumana A. Younis, Moussa Ammar, A. Ahmad-Kassem, A. Skaiky, A. Hamie, A. Nasser, H. Abdallah","doi":"10.1109/NTMS.2018.8328708","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328708","url":null,"abstract":"Wireless Body Area Networks (WBANs) have been subject to important research efforts for the past years. They are indeed expected to fulfil the needs of a variety of emerging human centric applications at very low cost and ultra-low power (e.g. healthcare, wellness, security, sports, gaming). Even more recently these networks have been considered for radiolocation purposes (i.e. out of transmitted signals on and around the body). This new localization add-on is rather based on the estimation of the separating distance between the WBANs devices, based on radio technologies such as Narrow-Band (N-B) and/or even Impulse Radio-Ultra Wideband (IR-UWB). In this context we present herein a theoretical modeling of WBANs ranging errors based on IR-UWB Time Of Arrival (TOA) estimation. This model consists in applying a Cramer Rao Lower Bound (CRLB) expression for discussions, after extracting realistic Channel Impulse Response (CIR) out of recent UWB multipath channel measurement campaign. The CRLB of any unbiased TOA estimator is computed in the [3.1, 5.1]GHz and [3.75, 4.25]GHz bands. The latter frequency band is compliant with the channel 2 of the IEEE 802.15.4a standard, as well as with one mandatory band imposed by the IEEE 802.15.6 standardization group.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116643491","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328750
Saeed Ibrahim, Nawwaf Al Harmi, Ebrahim Al Naqbi, Farkhund Iqbal, D. Mouheb, O. Alfandi
In the current age of digitalization, the increasing rate of cybercrimes has become a great matter to the public and private sectors. To mitigate these issues, governments and companies began a journey of building technological solutions and training individuals in the digital forensic field. This has sprouted a growth of digital forensic tools, sold by vendors to detect and analyze cybercrimes, and report the findings to the forensic investigator. However, most of these tools are quite expensive to a point where medium and small size businesses would struggle to afford them. To overcome this issue, we propose, in this paper, an easy to use and inexpensive solution based on a miniature pocket size computer, namely Raspberry Pi, running an image of Kali Linux on the mini SD card. This Raspberry Pi is configured to conduct acquisition of various storage media via physical and remote (network) access.
{"title":"Remote Data Acquisition Using Raspberry Pi3","authors":"Saeed Ibrahim, Nawwaf Al Harmi, Ebrahim Al Naqbi, Farkhund Iqbal, D. Mouheb, O. Alfandi","doi":"10.1109/NTMS.2018.8328750","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328750","url":null,"abstract":"In the current age of digitalization, the increasing rate of cybercrimes has become a great matter to the public and private sectors. To mitigate these issues, governments and companies began a journey of building technological solutions and training individuals in the digital forensic field. This has sprouted a growth of digital forensic tools, sold by vendors to detect and analyze cybercrimes, and report the findings to the forensic investigator. However, most of these tools are quite expensive to a point where medium and small size businesses would struggle to afford them. To overcome this issue, we propose, in this paper, an easy to use and inexpensive solution based on a miniature pocket size computer, namely Raspberry Pi, running an image of Kali Linux on the mini SD card. This Raspberry Pi is configured to conduct acquisition of various storage media via physical and remote (network) access.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124978201","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 : 2018-02-01DOI: 10.1109/NTMS.2018.8328679
R. B. Fraj, V. Beroulle, N. Fourty, A. Meddeb
Radio frequency identification (RFID) has become an enabling and a promising technology for the proliferation of the Internet of Things (IoT) and its implementation. An RFID system front-end is composed of many tags that are identified by one or more readers. The significant issue in RFID system is how to limit the anti-collisions that occur between readers and tags when identifying and reading tags data. A Dynamic Framed Slotted ALOHA (DFSA) mechanism for UHF RFID passive tags was proposed by the EPC Global Class-1 Generation-2 standard (EPC C1 Gen2). In this mechanism the 'Q- algorithm' is used to dynamically update the size of the frame based on the number of unidentified tags. Many researchers have evaluated the Q-Algorithm and proposed many enhancements to ameliorate it and to have better read performances. However, a design of an anti-collision scheme plays a major role in determining a protocol performance. In order to measure a protocol performance, a variety of factors could be used. In this paper we have compared two recent enhancements of the Q-Algorithm with the original one used by the EPC C1 Gen2 standard. We have implemented protocols in NS2 simulator and conduct the comparison based on three factors which are system efficiency, collision ratio and the marginal identification cost. Not only the strengths and weaknesses of the protocols measured were shown by the results, but also the importance of evaluating all relevant performance factors was highlighted especially when comparing anti-collision protocols.
{"title":"An Evaluation of UHF RFID Anti-Collision Protocols with NS2","authors":"R. B. Fraj, V. Beroulle, N. Fourty, A. Meddeb","doi":"10.1109/NTMS.2018.8328679","DOIUrl":"https://doi.org/10.1109/NTMS.2018.8328679","url":null,"abstract":"Radio frequency identification (RFID) has become an enabling and a promising technology for the proliferation of the Internet of Things (IoT) and its implementation. An RFID system front-end is composed of many tags that are identified by one or more readers. The significant issue in RFID system is how to limit the anti-collisions that occur between readers and tags when identifying and reading tags data. A Dynamic Framed Slotted ALOHA (DFSA) mechanism for UHF RFID passive tags was proposed by the EPC Global Class-1 Generation-2 standard (EPC C1 Gen2). In this mechanism the 'Q- algorithm' is used to dynamically update the size of the frame based on the number of unidentified tags. Many researchers have evaluated the Q-Algorithm and proposed many enhancements to ameliorate it and to have better read performances. However, a design of an anti-collision scheme plays a major role in determining a protocol performance. In order to measure a protocol performance, a variety of factors could be used. In this paper we have compared two recent enhancements of the Q-Algorithm with the original one used by the EPC C1 Gen2 standard. We have implemented protocols in NS2 simulator and conduct the comparison based on three factors which are system efficiency, collision ratio and the marginal identification cost. Not only the strengths and weaknesses of the protocols measured were shown by the results, but also the importance of evaluating all relevant performance factors was highlighted especially when comparing anti-collision protocols.","PeriodicalId":140704,"journal":{"name":"2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)","volume":"265 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129194300","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
扫码关注我们
求助内容：
应助结果提醒方式：