2009 International Conference on Network-Based Information Systems最新文献_第5页

Security Analysis of Ultra-lightweight Cryptographic Protocol for Low-cost RFID Tags: Gossamer Protocol 低成本RFID标签的超轻量加密协议安全性分析:游丝协议

2009 International Conference on Network-Based Information Systems Pub Date : 2009-08-19 DOI: 10.1109/NBiS.2009.9

Zeeshan Bilal, A. Masood, F. Kausar

{"title":"Security Analysis of Ultra-lightweight Cryptographic Protocol for Low-cost RFID Tags: Gossamer Protocol","authors":"Zeeshan Bilal, A. Masood, F. Kausar","doi":"10.1109/NBiS.2009.9","DOIUrl":"https://doi.org/10.1109/NBiS.2009.9","url":null,"abstract":"Gossamer protocol has been recently published to achieve mutual authentication in low-cost RFID tags. This protocol is considered to fall in ultra-lightweight class as it incorporates simple and low cost operations. Most of the earlier proposals in this class were exposed soon after their publication. Common weaknesses included use of Triangular functions and improper use of logic operators. Gossamer protocol used two non-triangular functions a) ROTbits and b) MIXbits. These functions provide confusion and diffusion properties and are implemented as cheaper operations. Thus, this protocol can be used for EPCglobal Class-1 Generation-2 standard (considered as universal standard for low-cost tags). This protocol is able to overcome existing weaknesses and is considered to be more attractive for low-capability devices as compared to earlier protocols of this class. In this paper, we analyze the security features provided by Gossamer protocol. The vulnerabilities discovered during this analysis reveal that different attacks including denial of service, memory and computation exhaustive, de-synchronization, replay, attack on data integrity and IDS (index pseudonym) collision are possible. As a consequence, we propose a new mutual authentication protocol keeping in mind the constraints and making use of the existing operations without addition of any expensive one. The analysis of the proposed protocol shows that it is resistant to all the attacks possible in case of Gossamer protocol. A comparative security analysis shows that proposed protocol provides better security features with a small compromise of communication overheads. Two additional public messages are exchanged between the reader and the tag to address the vulnerabilities present in Gossamer protocol.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"65 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130223724","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}

引用次数: 51

A Selective Update Propagation Based on Degree of Data Update in Peer-to-Peer Networks 点对点网络中基于数据更新程度的选择性更新传播

2009 International Conference on Network-Based Information Systems Pub Date : 2009-08-19 DOI: 10.1109/NBiS.2009.44

Toshiki Watanabe, A. Kanzaki, T. Hara, S. Nishio

引用次数: 2

A Client-Server Architecture for Context-Aware Search Application 上下文感知搜索应用程序的客户机-服务器体系结构

2009 International Conference on Network-Based Information Systems Pub Date : 2009-08-19 DOI: 10.1109/NBiS.2009.75

Feng Gui, M. Guillen, N. Rishe, A. Barreto, J. Andrian, M. Adjouadi

{"title":"A Client-Server Architecture for Context-Aware Search Application","authors":"Feng Gui, M. Guillen, N. Rishe, A. Barreto, J. Andrian, M. Adjouadi","doi":"10.1109/NBiS.2009.75","DOIUrl":"https://doi.org/10.1109/NBiS.2009.75","url":null,"abstract":"This paper develops a client-side context-aware search application which is built on the context-aware infrastructure. A context-aware architecture is designed to collect the mobile user’s context information, derive mobile user’s current context, distribute user context among context-aware applications, and support the context-aware applications. The context acquisition is centralized at the context server to ensure the reusability of context information among mobile devices, while context reasoning remains at the application level. Algorithms are proposed to consider the user context profiles. By promoting feedback on the dynamics of the system, prior user selection is now saved for further analysis expediting a subsequent search. A software-based proxy is set up at the client side which includes the context reasoning component. Implementation of such a proxy supports that the context applications are able to derive the user context profiles. To meet the practical demands required of a testing environment, a software simulation using Yahoo search API is provided as a means to evaluate the effectiveness of the design approach in a realistic way. The integration of user context into Yahoo search engines proves how context-aware searches can meet user demands for tailored services and products in and around the user’s environment.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132280350","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}

引用次数: 13

Enhancing Simulation Mode Operation of ospfd 增强ospfd的仿真模式操作

2009 International Conference on Network-Based Information Systems Pub Date : 2009-08-19 DOI: 10.1109/NBiS.2009.72

Weigao Xie, Balaji Polepalli, M. Goyal, S. Hosseini

{"title":"Enhancing Simulation Mode Operation of ospfd","authors":"Weigao Xie, Balaji Polepalli, M. Goyal, S. Hosseini","doi":"10.1109/NBiS.2009.72","DOIUrl":"https://doi.org/10.1109/NBiS.2009.72","url":null,"abstract":"In this paper, we describe our modifications to ospfd, a popular open-source implementation of OSPF routing protocol. The ospfd software can also be run in simulation mode, where processes, representing individual routers, communicate with each other over UDP sockets. Even though ospfd provides a fine-granularity implementation of OSPF protocol, its simulation mode operation leaves a lot to be desired. The main weakness of ospfd’s simulation mode operation is its lack of distinction between the real time and simulated time. The simulated time is represented in terms of ticks and increases at the same rate as the real time, i.e. the duration of an individual tick is fixed (e.g. 50ms). Consequently, the amount of work done by a router process in a given tick depends on how long this process has access to CPU during this tick. In our modifications, we introduced separation between the real time and simulated time by assigning specific (simulated) time durations with individual protocol tasks such as routing calculations and processing of OSPF packets (Hello, LSUpdate etc.). In modified ospfd, a tick gets over only when all router processes have completed the work they are supposed to do during the current tick. Additionally, we introduced several other modifications such as event based advancement of simulated time, script-based specification of topology change events and allowing router processes to run on multiple machines.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132291761","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}

引用次数: 1

A Survey of Internet Mobility 互联网移动性调查

2009 International Conference on Network-Based Information Systems Pub Date : 2009-08-19 DOI: 10.1109/NBiS.2009.94

Ping Zhang, A. Durresi, L. Barolli

引用次数: 18

Evaluation of Purpose Mark Releasing Protocol for Purpose-based Marking (PM) Protocol 目的标记发布协议对基于目的的标记(PM)协议的评价

2009 International Conference on Network-Based Information Systems Pub Date : 2009-08-19 DOI: 10.1109/NBiS.2009.58

T. Enokido, M. Takizawa

引用次数: 0

Applied System of the Social Life Log for Ecological Lifestyle in the Home 家庭生态生活方式社会生活日志应用系统

2009 International Conference on Network-Based Information Systems Pub Date : 2009-08-19 DOI: 10.1109/NBiS.2009.74

M. Yamagiwa, M. Uehara, Makoto Murakami

引用次数: 6

Timeliness and QoS Aware Packet Scheduling for Next Generation Networks 下一代网络的时效性和QoS感知分组调度

2009 International Conference on Network-Based Information Systems Pub Date : 2009-08-19 DOI: 10.1109/NBiS.2009.64

Y. Lien, Yung-Chuan Wun

{"title":"Timeliness and QoS Aware Packet Scheduling for Next Generation Networks","authors":"Y. Lien, Yung-Chuan Wun","doi":"10.1109/NBiS.2009.64","DOIUrl":"https://doi.org/10.1109/NBiS.2009.64","url":null,"abstract":"Running time sensitive multimedia services such as Voice-over-IP (VoIP) and Video-on-Demand (VoD) on All-IP Networks may have lower quality, i.e. Quality of Service (QoS), than its counterpart on conventional circuit-switched networks. We could enhance overall QoS without investing more resources if routers could forward packets based on their timeliness and QoS class giving important late packets proper precedence. This paper proposes a charge-based optimization model for packet scheduling aiming to maximize overall QoS satisfaction factor. We also developed a simple and effective scheduling policy based on this concept for the environments where each packet has a predefined hop-by-hop traveling schedule. Routers are assumed in three different queue architectures: ideal single preemptive queue and practical multiple FIFO queue with and without a priority queue. To forward a packet, a router first assigns an adequate profit function to the packet based on its timeliness and QoS class as well as the loading status of the succeeding routers along its traveling path, and then inserts the packet into an appropriate position in the output queues. The performance of this approach is evaluated by simulation using NS-2 network simulator. Simulation results show that, under heavy load, our approach can outperform easily the Simulated Priority Queue that differentiates QoS class only.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129880895","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}

引用次数: 8

Event Coverage in Sparse Mobile Sensor Networks 稀疏移动传感器网络中的事件覆盖

2009 International Conference on Network-Based Information Systems Pub Date : 2009-08-19 DOI: 10.1109/NBiS.2009.71

Mark E. Snyder, S. Chellappan

引用次数: 2

Challenges in the Development of Mobile Applications in Industrial Field Service 工业现场服务中移动应用发展的挑战

2009 International Conference on Network-Based Information Systems Pub Date : 2009-08-19 DOI: 10.1109/NBiS.2009.51

M. Aleksy, Bernd Stieger

引用次数: 16