2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)最新文献_第6页

Application of HAZOP to the Design of Cyber Security Experiments HAZOP在网络安全实验设计中的应用

2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2016-03-23 DOI: 10.1109/AINA.2016.115

Masood Mansoori, I. Welch, Kim-Kwang Raymond Choo, R. Maxion

引用次数: 5

Soft Fall Detection Using Machine Learning in Wearable Devices 在可穿戴设备中使用机器学习的软跌倒检测

2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2016-03-23 DOI: 10.1109/AINA.2016.124

D. Genoud, Vincent Cuendet, Julien Torrent

引用次数: 19

Intersection Automata Based Model for Android Application Collusion 基于交集自动机的Android应用程序合流模型

2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2016-03-23 DOI: 10.1109/AINA.2016.92

S. Bhandari, V. Laxmi, A. Zemmari, M. Gaur

{"title":"Intersection Automata Based Model for Android Application Collusion","authors":"S. Bhandari, V. Laxmi, A. Zemmari, M. Gaur","doi":"10.1109/AINA.2016.92","DOIUrl":"https://doi.org/10.1109/AINA.2016.92","url":null,"abstract":"Android applications need to access and share user's sensitive data. To maintain user's privacy and related data security, it is essential to protect this data. Android security framework enforces permission protected model but it has been shown that applications can bypass this security model. Attacks based on such unauthorized privileges are known as Inter-Component Communication (ICC) Collusion Attacks. In this paper, we propose, a novel automaton framework that allows effective detection of intent based collusion. Our detection framework operates at the component-level. To evaluate our proposal, we developed 14 applications and took 4 applications from Google Play Store. We took all possible combinations from the set of 21 applications. We tested our approach on 210 pairs of applications derived from the set of 21 applications. Time and space complexity of our proposed approach is O(n) where n is the number of components in all the applications under analysis. The experimental results demonstrate that our technique is scalable to application sizing and more efficient as compared to other state of the art approaches.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"313 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123124871","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}

引用次数: 14

Tightly-Secure Identity-Based Structured Aggregate Signature Scheme under the Computational Diffie-Hellman Assumption 计算Diffie-Hellman假设下基于身份的严格安全结构化聚合签名方案

2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2016-03-23 DOI: 10.1109/AINA.2016.99

Tomoya Iwasaki, Naoto Yanai, Masaki Inamura, Keiichi Iwamura

{"title":"Tightly-Secure Identity-Based Structured Aggregate Signature Scheme under the Computational Diffie-Hellman Assumption","authors":"Tomoya Iwasaki, Naoto Yanai, Masaki Inamura, Keiichi Iwamura","doi":"10.1109/AINA.2016.99","DOIUrl":"https://doi.org/10.1109/AINA.2016.99","url":null,"abstract":"An aggregate signature scheme is a primitive whereby each signer signs an individual document and combines them to compress data size. We propose an aggregate signature scheme which is an extension in two standpoints of structured signatures and ID-based signatures, i.e., we construct an identity-based structured aggregate signature scheme. The proposed scheme is expected to be used with consumer-generated media services. We prove the security of the proposed scheme with tight reduction under the computational Diffie-Hellman (CDH) assumption in the random oracle model. Tight reduction means that the cost of a reduction algorithm is independent of an adversary's capability, i.e., security is not downgraded by the adversary's capability. To the best of our knowledge, no structured signature scheme with tight reduction has been proposed to date because it contains complicated structures that make the reduction inefficient. Note that the security of our scheme captures the switching attack (CCS 2007, Boldyreva et al.) and the re-ordering attack (ISPEC 2007, Shao), which break several famous schemes.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117048473","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}

引用次数: 7

Distributed Cooperative Reasoning in Ambient Environment 环境下的分布式协同推理

2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2016-03-23 DOI: 10.1109/AINA.2016.52

Amina Jarraya, Khedija Arour, A. Borgi, A. Bouzeghoub

引用次数: 1

A Scalability Metric for Control Planes in Software Defined Networks (SDNs) 软件定义网络(sdn)中控制平面的可扩展性度量

2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2016-03-23 DOI: 10.1109/AINA.2016.112

Murat Karakus, A. Durresi

{"title":"A Scalability Metric for Control Planes in Software Defined Networks (SDNs)","authors":"Murat Karakus, A. Durresi","doi":"10.1109/AINA.2016.112","DOIUrl":"https://doi.org/10.1109/AINA.2016.112","url":null,"abstract":"Software Defined Networking (SDN) architecture promises to mitigate limitations of traditional networking architectures in order to satisfy today's complex networking needs. However, as all new networking architectures, SDN also presents several inevitable technical challenges to be addressed by researchers. Control plane scalability is one of the crucial issues deserving more attention from both academia and industry in SDN as well. There are many existing solutions proposing a way to alleviate the control plane scalability in SDN. However, one prominent common ground they share is that they measure the control plane scalability performance in terms of typical network QoS parameters such as throughput and latency. Although these metrics may be a good performance indicators for quality of service measurement in mid-term and long-term, they may not reflect real scalability performance of control planes in SDN environments. However, a metric for scalability of control plane in SDN can provide network administrators some insights while they construct their SDN networks. In this paper, we firstly explore the roots of control plane scalability problem in SDN as well as proposed existing solutions. We then propose a metric in order to evaluate the control plane scalability in SDN. We give mathematical models of the proposed metric over different control plane designs. Further, we compare the performance of these control plane designs by extensive experiments.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122875858","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}

引用次数: 22

Leveraging Co-authorship and Biographical Information for Author Ambiguity Resolution in DBLP 利用共同作者身份和传记信息解决DBLP中的作者歧义

2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2016-03-23 DOI: 10.1109/AINA.2016.61

Hussein Hazimeh, Iman Youness, J. Makki, Hassan Noureddine, J. Tscherrig, E. Mugellini, Omar Abou Khaled

{"title":"Leveraging Co-authorship and Biographical Information for Author Ambiguity Resolution in DBLP","authors":"Hussein Hazimeh, Iman Youness, J. Makki, Hassan Noureddine, J. Tscherrig, E. Mugellini, Omar Abou Khaled","doi":"10.1109/AINA.2016.61","DOIUrl":"https://doi.org/10.1109/AINA.2016.61","url":null,"abstract":"Many authors can share the same name and this constitutes a serious problem that affects the relevancy of retrieval results and constitutes our motivation of finding such approach to cover this issue at the author names entity level. Solving such a problem may return with positive gain at the level of document retrieval, web search and the quality of data. This entity resolution task can be tackled as an unsupervised problem, where there are set of features that can be employed for the resolution job, or as supervised problem to compute the similarities among two citations and then classify if they are the same or not. Recent approaches usually utilize features such as: co-author, venue, topic similarity, affiliations and title of publications to deal with author ambiguity. In this paper, three attributes are used to treat this problem sequentially. The co-authorship firstly which is a well-known attribute, and then the topic and affiliation extracted from biographies, which can be found inside the publication, and this is our novelty frame in this paper.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124199411","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}

引用次数: 3

An Openstack Based Accounting and Billing Service for Future Internet Applications 面向未来互联网应用的基于Openstack的计费服务

2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2016-03-23 DOI: 10.1109/AINA.2016.66

O. Omosebi, Stelios Sotiriadis, N. Bessis

{"title":"An Openstack Based Accounting and Billing Service for Future Internet Applications","authors":"O. Omosebi, Stelios Sotiriadis, N. Bessis","doi":"10.1109/AINA.2016.66","DOIUrl":"https://doi.org/10.1109/AINA.2016.66","url":null,"abstract":"In latest years, there is a corresponding growth for cloud computing services, especially for those that can be offered as modular components in order to construct Future Internet (FI) applications. In addition, the emergence of inter-clouds as the mean to achieve utilization of various services available from different providers highlights new research directions. Following the business benefits of the cloud services into more advanced and modular systems the requirements for effective accounting and billing with regards to the service usage and the accurate billing of consumers of services becomes challenging. This work focuses on cloud platforms, their platform segregations and services, and presents an accounting and billing service that can be used to rate, charge and bill consumers of within a cloud or an inter-cloud platforms. The solution is developed based on FIWARE platform, which promotes the usage of Cloud Computing in Europe by designing general purpose cloud services namely as Generic Enablers (GEs). Here we design and implement an Accounting and Billing GE that is built upon OpenStack platforms and hosted as an easily to deploy and use cloud service.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124310801","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

Experimental Results of a Raspberry Pi and OLSR Based Wireless Content Centric Network Testbed Considering OpenWRT OS 考虑OpenWRT操作系统的树莓派和OLSR无线内容中心网络试验台的实验结果

2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2016-03-23 DOI: 10.1109/AINA.2016.153

Admir Barolli, Tetsuya Oda, L. Barolli, M. Takizawa

引用次数: 9

A Precision Operation Optimization for Detection-Based Sensor Networks 基于检测的传感器网络的精确运行优化

2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA) Pub Date : 2016-03-23 DOI: 10.1109/AINA.2016.30

F. Lin, Chiu-Han Hsiao, Y. Wen

{"title":"A Precision Operation Optimization for Detection-Based Sensor Networks","authors":"F. Lin, Chiu-Han Hsiao, Y. Wen","doi":"10.1109/AINA.2016.30","DOIUrl":"https://doi.org/10.1109/AINA.2016.30","url":null,"abstract":"Wireless Sensor Networks (WSNs), which are connected by sensor nodes with wireless communication techniques, are used to collect, process, and transmit the various types of environmental data, such as temperature, fire and smoke detectors, CO gas, humidity, pressure, and video-based data. The network lifetime is limited due to sensors are equipped with batteries. The measurement uncertainties and detection faults lead higher power consumption by retransmissions due to event detection error. These two factors influence with each other. In this study, there are two indicators are introduced for detection errors, false positive (FP) and false negative (FN) to evaluate a detection-based sensor network. For operation perspectives, three models are addressed to near-optimize the network lifetime and detection errors. Linear-and non-linear mathematical planning problems are formulated as (1) to minimize event FP rate subject to FN constraints, (2) to minimize the network energy consumption subject to detection accuracy requirements, turning sensor ON/OFF decisions, the required number of voting nodes, and given FP/FN constraints, and (3) to extend from the previous model as a planning problem for various types of sensor nodes deployed with diverse FP/FN characteristics and costs. An integer programming (IP) tool, LINGO, is adopted to solve the problems with computational experiments on several situations. The experimental results show that the objectives can be achieved, lots of useful hints or configurations can be applied for system implementations to improve system performance efficiently and effectively.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129666830","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