2017 4th International Conference on Networking, Systems and Security (NSysS)最新文献

{"title":"RLB: Randomized load balanced packet forwarding strategy in name based data networking","authors":"Md. Abdullah Al Fuad, Md. Safiullah Sarker Sabuj, M. Z. Hasan, Mahmuda Naznin","doi":"10.1109/NSYSS2.2017.8267798","DOIUrl":"https://doi.org/10.1109/NSYSS2.2017.8267798","url":null,"abstract":"Named Data Networking or NDN provides a new generation networking system where routing does not depend on traditional IP address. Rather network nodes route packets based on the given name or the nature of the content. It is very challenging to find the load balanced routing in Named Data Networking system where multiple producers generate different name packets for multiple consumers. We propose randomized load balanced routing algorithm (RLB) for selecting a server or producer to satisfy the clients interest by producing packets to the corresponding client in the client cluster. We do simulation study using NS3-ndnSIM designed for performance analysis and find that our method is justified.","PeriodicalId":144799,"journal":{"name":"2017 4th International Conference on Networking, Systems and Security (NSysS)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124273236","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":"A DNA cryptographic technique based on dynamic DNA encoding and asymmetric cryptosystem","authors":"Md. Rafiul Biswas, K. R. Alam, A. Akber, Y. Morimoto","doi":"10.1109/NSYSS2.2017.8267782","DOIUrl":"https://doi.org/10.1109/NSYSS2.2017.8267782","url":null,"abstract":"This paper proposes a new DNA cryptographic technique based on dynamic DNA encoding and asymmetric cryptosystem to increase the level of secrecy of data. The key idea is: to split the plaintext into fixed sized chunks, to encrypt each chunk using asymmetric cryptosystem and finally to merge the ciphertext of each chunk using dynamic DNA encoding. To generate chunks, characters of the plaintext are transformed into their equivalent ASCII values and split it into finite values. Now to encrypt each chunk, asymmetric cryptosystem is applied and the ciphertext is transformed into its equivalent binary value. Then this binary value is converted into DNA bases. Finally to merge each chunk, sufficient random strings are generated. Here to settle the required number of random strings, dynamic DNA encoding is exploited which is generated using Fibonacci series. Thus the use of finite chunks, asymmetric cryptosystem, random strings and dynamic DNA encoding increases the level of security of data. To evaluate the encryption-decryption time requirement, an empirical analysis is performed employing RSA, ElGamal and Paillier cryptosystems. The proposed technique is suitable for any use of cryptography.","PeriodicalId":144799,"journal":{"name":"2017 4th International Conference on Networking, Systems and Security (NSysS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126056797","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 exploratory analysis of security on data transmission on relevant software engineering discussion sites","authors":"S. Jahan, Mehjabin Rahman, Anindya Iqbal, Tishna Sabrina","doi":"10.1109/NSYSS2.2017.8267784","DOIUrl":"https://doi.org/10.1109/NSYSS2.2017.8267784","url":null,"abstract":"The Question and Answer (Q&A) sites are very popular nowadays for discussion on technological issues. Among the most prominent topics of these sites, posts related to security are widely visited. Security discussions may be classified broadly into two categories: application and infrastructure security. In this research, we studied several community Q&A sites to analyze the characteristics of requirements and difficulties to implement security in data transmission, one of the most dominant topics of infrastructure security. To the best of our knowledge, this is the first study of this kind. Our findings are expected to make it easier for the interested people to acquire knowledge about recent threats and security issues of data transmission in a methodical way and also to understand the trends of relevant technologies. We found that Transport Layer Security (TLS) is the most discussed technique over the years and Cross-Site Scripting (XSS) attack is the primary concern for the developers.","PeriodicalId":144799,"journal":{"name":"2017 4th International Conference on Networking, Systems and Security (NSysS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125515652","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":"Authentication of k nearest neighbor queries in the presence of obstacles","authors":"Sharifa Tahmida Kaniz, Jibon Naher, T. Hashem","doi":"10.1109/NSYSS2.2017.8267783","DOIUrl":"https://doi.org/10.1109/NSYSS2.2017.8267783","url":null,"abstract":"Recently, the widespread usage of smart phones and emergence of location based services (LBSs) have raised the necessity of data outsourcing paradigm. In this paradigm, a service provider (SP) offers services on the behalf of data owner (DO). However, the third party service provider may not be trustworthy. It may return incomplete or corrupted answers for personal benefits. Therefore, there must be a way to authenticate the answers returned by the SP. In this paper, we introduce an approach to authenticate an important class of LBSs, kNN queries in the obstructed space. A k nearest neighbor (kNN) query in the obstructed space enables a pedestrian to know k points of interest (POIs) such as restaurants or pharmacies that have k smallest distances from her current location considering the obstacles (e.g., buildings, lakes). Though authentication techniques of kNN queries exist for the Euclidean space and road networks, no work has been done to authenticate kNN queries in the obstructed space. We perform experiments using real datasets to show the effectiveness of our approach.","PeriodicalId":144799,"journal":{"name":"2017 4th International Conference on Networking, Systems and Security (NSysS)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115306136","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":"Polygot: An approach towards reliable translation by name identification and memory optimization using semantic analysis","authors":"Md. Adnanul Islam, A. Islam, Md. Saidul Hoque Anik","doi":"10.1109/NSYSS2.2017.8267795","DOIUrl":"https://doi.org/10.1109/NSYSS2.2017.8267795","url":null,"abstract":"We present a study of improving the efficiency, complexity and performance of language translation process by a translator. The goal of this research is to develop an efficient translation system for any language by optimizing the memory consumption and also identifying the names as nouns efficiently. Although a number of researches can be found on natural language processing in different areas, those were performed keeping English as the only target language mostly. However, a good number of languages remain nearly unexplored in the research fields yet. This study basically focuses on Bengali Language as an example of the unexplored languages. Some noticeable studies on Bengali language are on Bangla keyboard layout design, English to Bangla translator, etc. so far. However, very few researches have been done to translate Bengali text to English till now. To develop an efficient translation system is very complex and expensive as it requires huge amount of time and resources. In all the languages, there are many words having multiple meanings and multiple forms and also some sentences having multiple grammatical structures to express the same meaning. Besides, the names of people may not be easily identified due to the vast diversity of names and also the tags (prefix/ suffix) attached to emphasize names. Therefore, it remains a great challenge to recognize a sentence of a particular language with accurate semantic analysis. However it is very important to have a generalised translation system which can compute various possible outputs in reasonable time and space. In this paper we focus on the correct interpretation of the names as nouns in a sentence and also the optimization of space requirement using semantic analysis.","PeriodicalId":144799,"journal":{"name":"2017 4th International Conference on Networking, Systems and Security (NSysS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126287057","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":"Service-Hub: A better approach for developing the system of online marketing for daily services","authors":"Ananya Bhattacharjee, Tahrina Tasnim, Md. Sadiqur Rahman Sohel, Amit Chakraborty, M. A. A. Maruf, S. Dutta, A. Ishmam, Tarik Reza Toha, A. Islam","doi":"10.1109/NSYSS2.2017.8267801","DOIUrl":"https://doi.org/10.1109/NSYSS2.2017.8267801","url":null,"abstract":"Management of information of different types of household service provider is often difficult for a service receiver due to communication gap between provider and receiver. As a result, not only service receivers face an unexpected trouble but also service providers fail to get their jobs according to their skills. A generic platform providing two way communication between service provider and service receiver can eliminate the exhausting efforts of searching the suitable service provider and also ensures the intended job for the service provider. A feedback based rating system can improve the skills of any service provider and service receiver can eventually get better service.","PeriodicalId":144799,"journal":{"name":"2017 4th International Conference on Networking, Systems and Security (NSysS)","volume":"299 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131972181","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":"A dynamic searchable encryption scheme for secure cloud server operation reserving multi-keyword ranked search","authors":"Tasnim Kabir, Muhammad Abdullah Adnan","doi":"10.1109/NSYSS2.2017.8267793","DOIUrl":"https://doi.org/10.1109/NSYSS2.2017.8267793","url":null,"abstract":"Cloud computing is becoming more and more popular day by day due to its maintenance, multitenancy and performance. Data owners are motivated to outsource their data to the cloud servers for resource pooling and productivity where multiple users can work on the same data concurrently. These servers offer great convenience and reduced cost for the computation, storage and management of data. But concerns can persist for loss of control over certain sensitive information. The complexity of security is largely intensified when data is distributed over a greater number of devices and data is shared among unrelated users. So these sensitive data should be encrypted for solving these security issues that many consumers cannot afford to tackle. In this paper, we present a dynamic searchable encryption scheme whose update operation can be completed by cloud server while reserving the ability to support multi-keyword ranked search. We have designed a scheme where dynamic operations on data like insert, update and delete are performed by cloud server without decrypting the data. Thus this scheme not only ensures dynamic operations on data but also provides a secure technique by performing those tasks without decryption. The state-of-the-art methods let the data users retrieve the data, re-encrypt it under the new policy and then send it again to the cloud. But our proposed method saves this high computational overhead by reducing the burden of performing dynamic operation by the data owners. The secure and widely used TF × IDF model is used along with kNN algorithm for construction of the index and generation of the query. We have used a tree-based index structure, so our proposed scheme can achieve a sub-linear search time. We have conducted experiments on Amazon EC2 cloud server with three datasets by updating a file, appending a file and deleting a file from the document collection and compared our result with the state-of-the-art method. Results show that our scheme has an average running time of 42ms which is 75% less than the existing method.","PeriodicalId":144799,"journal":{"name":"2017 4th International Conference on Networking, Systems and Security (NSysS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132237887","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}