2016 International Conference on Networking Systems and Security (NSysS)最新文献_第2页

Supercrypt: a technique for quantum cryptography through simultaneously improving both security level and data rate 超级加密:一种同时提高安全级别和数据速率的量子加密技术

2016 International Conference on Networking Systems and Security (NSysS) Pub Date : 2016-02-11 DOI: 10.1109/NSysS.2016.7400693

Kazi Sinthia Kabir, Tusher Chakraborty, A. Alim, Al Islam

{"title":"Supercrypt: a technique for quantum cryptography through simultaneously improving both security level and data rate","authors":"Kazi Sinthia Kabir, Tusher Chakraborty, A. Alim, Al Islam","doi":"10.1109/NSysS.2016.7400693","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400693","url":null,"abstract":"Secured data transmission has always been a matter of great interest and several encryption techniques for secured data transmission have been devised till now in this regard. However, with rapidly developing technology, the available encryption techniques are becoming more prone to attack every day. Focusing this issue, in this paper, we propose a new technique of encryption that will enhance the security level by a significant margin with the help of quantum computing. Additionally, our proposed technique also enhances data transmission rate through exploiting the notion of Superdense Coding. Such simultaneous improvement in both security level and data transmission rate, which we achieve through our proposed technique, is a rare trait for currently available encryption technique. We name our proposed technique SuperCrypt. We elaborate implementation issues pertinent for SuperCrypt such as recycling qubits and re-establishing entanglement. We also implement SuperCrypt in a discrete-event network simulator ns-2 and evaluate the performance of SuperCrypt through analyzing the simulation results. The simulation results demonstrate significant performance improvement through SuperCrypt compared to available classical alternative. Further, we briefly present a more sophisticated and synchronized version of SuperCrypt that we plan to investigate in future.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128242258","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}

引用次数: 6

Enhancing security in specialized use of mobile IP 加强流动IP专门化使用的安全性

2016 International Conference on Networking Systems and Security (NSysS) Pub Date : 2016-02-11 DOI: 10.1109/NSysS.2016.7400695

Iftakhar Ahmad, Sinthia Kabir, Tanzila Choudhury, A. Islam

{"title":"Enhancing security in specialized use of mobile IP","authors":"Iftakhar Ahmad, Sinthia Kabir, Tanzila Choudhury, A. Islam","doi":"10.1109/NSysS.2016.7400695","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400695","url":null,"abstract":"Several security threats are present in the satellite communication system now-a-days. Specially, after incorporating Route Optimization between end hosts by informing correspondent node and home agent about mobile node's current location through binding updates in Mobile IPv6, security threats have become alarming. Vulnerability of the binding updates under several attacks is the main reason of these security threats. The attacks include sending unauthorized and unnecessary data to mobile node, redirection of traffic, denial-of-service attack, man-in-the middle attack, bombing attack, etc. The effect of these attacks is severe on various sophisticated mobile nodes such as satellite, air-crafts, naval ships, drones, etc. Several approaches have been used to prevent these attacks. However, any suitable solution to all these attacks is yet to be found. For these reason, we propose a new solution to all these attacks through incorporating a notion of run-time authentication between the sophisticated mobile nodes. Our proposed solution ensures that no unauthorized agent can manipulate and send modified data packets to the mobile nodes. Consequently, our system of run-time authentication can be used in any highly-secured network system to ensure authentic data communication.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123420158","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

Short paper: enhancing Wi-Fi security using a hybrid algorithm of blowfish and RC6 短文:利用河豚和RC6的混合算法增强Wi-Fi安全性

2016 International Conference on Networking Systems and Security (NSysS) Pub Date : 2016-02-11 DOI: 10.1109/NSysS.2016.7400706

Nusrat Jahan Oishi, Arafin Mahamud, Asaduzzaman

{"title":"Short paper: enhancing Wi-Fi security using a hybrid algorithm of blowfish and RC6","authors":"Nusrat Jahan Oishi, Arafin Mahamud, Asaduzzaman","doi":"10.1109/NSysS.2016.7400706","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400706","url":null,"abstract":"Nowadays, Wi-Fi is a very popular Technology. Faster data transfer and Security both are very important for Wi-Fi. At present, Advanced Encryption Standard (AES) is used for Wi-Fi that is more secured than other encryption algorithms but it is not so fast because of it's complex functions. On the other hand, Blowfish is a very faster encryption algorithm but it cannot apply on Wi-Fi because of it's security problems. In this paper, a hybrid algorithm of Blowfish and Rivest Cipher 6 (RC6) is proposed that solves the security problems of Blowfish and also maintains the fastness of Blowfish and makes it able to use it in place of AES. It uses two innovative criteria. One is ingenious confusion process using two random numbers \"a\" and \"w\" that removes reflectively weak key attack and Known plaintext attack of Blowfish. The other is usage of one S-Box by overlapping process that eliminates the collision key attack of Blowfish. Sub key generation process of this algorithm also removes the Brute Force attack of AES. This paper tries to give an efficient algorithm that enhances the performance of Blowfish algorithm by adding a function of RC6 with it. The adding process is trickily handed here that makes the proposed algorithm as fast as Blowfish and also secured like existing AES. The proposed algorithm takes less encryption -decryption time like Blowfish and also secured like AES. Throughput, Average time for different data lengths and attack removal process are used to measure the efficiency of this proposed algorithm.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134321587","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}

引用次数: 18

UProve2: privacy-aware, scalable, ubiquitous provenance to enhance file search UProve2:隐私意识，可扩展，无处不在的来源，以增强文件搜索

2016 International Conference on Networking Systems and Security (NSysS) Pub Date : 1900-01-01 DOI: 10.1109/NSysS.2016.7400709

Annajiat Alim Rasel, Mohammed Eunus Ali

引用次数: 3

Privacy and security problems of national health data warehouse: a convenient solution for developing countries 国家卫生数据仓库的隐私和安全问题:发展中国家的便捷解决方案

2016 International Conference on Networking Systems and Security (NSysS) Pub Date : 1900-01-01 DOI: 10.1109/NSysS.2016.7400708

S. I. Khan, A. S. M. L. Hoque

{"title":"Privacy and security problems of national health data warehouse: a convenient solution for developing countries","authors":"S. I. Khan, A. S. M. L. Hoque","doi":"10.1109/NSysS.2016.7400708","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400708","url":null,"abstract":"Healthcare providers and researchers can discover the hidden knowledge from different health repositories if integration of data is performed by data warehousing. Integration of health records requires linkage of patients' data in different heterogeneous sources. Preserving record linkage in National Health Data Warehouse, by retaining identifiable attributes, is essential for effective data mining as well. In contrast identifiable health data have high risk to patient privacy and make the health information systems security vulnerable to hackers. In this paper, we have provided a practical solution: Global Patient Identification Technique (GPIT) that can anonymize identifiable private data of the patients while maintaining record linkage in integrated health repositories to facilitate knowledge discovery process. We have used encrypted mobile number, gender and NAMEVALUE of patients to produce Global Patient Identification Key. This system is being implemented in Bangladesh to develop National Health Data Warehouse. Our approach is also suitable for the developing countries where poverty and illiteracy rates are high among mass people.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128231349","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}

引用次数: 36

Optimal allocation of 3G budget for smartphones running heterogeneous applications 为运行异构应用程序的智能手机优化分配3G预算

2016 International Conference on Networking Systems and Security (NSysS) Pub Date : 1900-01-01 DOI: 10.1109/NSysS.2016.7400698

Saidur Rahman, Anika Anzum Prima, M. Razzaque

引用次数: 1

Impact of mobile nodes for few mobility models on delay-tolerant network routing protocols 几种移动模型下移动节点对容错网络路由协议的影响

2016 International Conference on Networking Systems and Security (NSysS) Pub Date : 1900-01-01 DOI: 10.1109/NSysS.2016.7400704

S. Hossen, Muhammad Sajjadur Rahim

{"title":"Impact of mobile nodes for few mobility models on delay-tolerant network routing protocols","authors":"S. Hossen, Muhammad Sajjadur Rahim","doi":"10.1109/NSysS.2016.7400704","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400704","url":null,"abstract":"Delay-Tolerant Networks (DTNs) are sparse dynamic wireless networks, where most of the time a complete end-to-end path from the source to the destination does not exist. There are many real networks that follow this model, for example, military networks, vehicular ad-hoc networks (VANETs), wildlife tracking sensor networks, etc. In this context, conventional mobile ad-hoc routing schemes would fail, because they try to establish complete end-to-end paths, before any data sent. Therefore, performance analysis of different DTN routing mechanisms plays an important role in understanding the design of DTNs that encourages one to choose proper routing protocol for a particular scenario. This paper investigates the performance of replication-based DTN routing protocols, namely Epidemic, Probabilistic Routing Protocol using History of Encounters and Transitivity (PRoPHET), MaxProp, Resource Allocation Protocol for Intentional DTN (RAPID), Binary Spray-and-Wait (B-SNW), and Spray-and-Focus (SNF) in DTN scenario against varying number of mobile nodes for three mobility models, namely Random Walk (RW), Random Direction (RD) and Shortest Path Map Based (SPMB) movement. Performance has been evaluated and analyzed using Opportunistic Network Environment (ONE) simulator by considering three metrics: delivery probability, average latency and overhead ratio. Simulation results show that the investigated DTN routing protocols, in general, exhibit better performance in the SPMB movement model than other movement models, i.e., RW and RD, because they yield maximum message delivery probability, minimum overhead ratio (for B-SNW and SNF), and minimum average latency.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"124 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129647801","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}

引用次数: 15

Certificate revocation in vehicular Ad Hoc networks: a novel approach 车载自组织网络中的证书撤销:一种新方法

2016 International Conference on Networking Systems and Security (NSysS) Pub Date : 1900-01-01 DOI: 10.1109/NSysS.2016.7400703

Nazmul Islam

引用次数: 10

Fault tolerant optimized broadcast for wireless Ad-Hoc networks 无线Ad-Hoc网络容错优化广播

2016 International Conference on Networking Systems and Security (NSysS) Pub Date : 1900-01-01 DOI: 10.1109/NSysS.2016.7400690

Mamtaj Akter, A. Islam, Ashikur Rahman

{"title":"Fault tolerant optimized broadcast for wireless Ad-Hoc networks","authors":"Mamtaj Akter, A. Islam, Ashikur Rahman","doi":"10.1109/NSysS.2016.7400690","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400690","url":null,"abstract":"Many broadcasting protocols for ad-hoc wireless networks perform poorly in situations when network becomes unreliable or untrusted. In real environment, any node may suddenly become unavailable due to power failure or mobility, or be unable to receive or forward broadcast packets due to noise/interference. To improve the reliability of broadcasting in an environment with limited trust, a protocol dubbed as multicover dominant pruning (MDP) [2] has been proposed where all nodes cover their 2-hop neighbors multiple times. However, MDP incurs too much redundancy; the same broadcasting task can be achieved with reduced number of packet forwarding. In this paper, we propose three better fault-tolerant heuristics dubbed as multicover total dominant pruning (MTDP), multicover partial dominant pruning (MPDP) and multicover improved dominant pruning (MIDP). All these heuristics not only utilize 2-hop neighborhood information more effectively to reduce redundant transmissions but also significantly improve the reachability of nodes in an unreliable ad-hoc wireless network. Extensive simulation experiments have been conducted to evaluate the efficiency of the proposed heuristics. Performance analysis shows that the proposed heuristics outperforms the multicover dominant pruning broadcasting algorithm.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124680851","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

Enhancing the embedding payload by handling the affair of association and mapping of block pixels through prediction errors histogram 通过预测误差直方图处理块像素的关联和映射问题，增强了嵌入的有效载荷

2016 International Conference on Networking Systems and Security (NSysS) Pub Date : 1900-01-01 DOI: 10.1109/NSysS.2016.7400691

A. Kamal, M. M. Islam

{"title":"Enhancing the embedding payload by handling the affair of association and mapping of block pixels through prediction errors histogram","authors":"A. Kamal, M. M. Islam","doi":"10.1109/NSysS.2016.7400691","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400691","url":null,"abstract":"Images are intentionally distorted in many reversible data hiding schemes. This distortion is performed either by encrypting before data embedment or by applying histogram association mapping (HAM) during data concealment. The later one minimizes the processing complexity and demolishes the requirement of sharing secret keys. In the HAM, each block's pixels belong to a segment in the gray scale are associated and mapped by the message bits to another gray part. The quantity of embedded bits are determined by the range of block pixels, i.e. limit within which pixels spread out. Though, smaller valued ranges contribute much to embedding payload, the frequency of such ranges decreases in archetype images. However, a predictor, if applied on the block pixels, huddles its prediction errors together. Consequently, the range of absolute values of the prediction errors become smaller. The proposed scheme, therefore, applies HAM to prediction errors and shifts the block pixels accordingly. Experiments were conducted using three different standard image datasets to examine the enhancement in the embedding payload and to investigate the performance on different block-sizes. The investigation reveals that the average payloads in the proposed scheme is 1.5 to 2 times of the competing one in all the cases.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125295608","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}

引用次数: 12