Jin-Oh Jeon, Su-Bong Ryu, Tae-Min Chang, Ho-Yong Choi, Min-Sup Kang
In this paper, we first propose a cryptographic authentication protocol which meets the privacy protection for tag bearers, and then a digital Codec for RFID tag is designed based on the protocol. The protocol which uses cryptographic hash algorithm is based on a three-way challenge response authentication scheme. In addition, we will show how the three different types of protocol frame formats are formed by extending the ISO/IEC 18000-3 standard[3] for implementing the proposed authentication protocol in RFID system environment. The system has been described in Verilog HDL and also synthesized using Synopsys Design Compiler with Hynix 0.25 mum standard-cell library. From implementation results, we found that the proposed scheme is well suite to implement robust RFID system against active attacks such as the man-in-the-middle attack.
{"title":"Digital Codec Design for RFID Tag Based on Cryptographic Authentication Protocol","authors":"Jin-Oh Jeon, Su-Bong Ryu, Tae-Min Chang, Ho-Yong Choi, Min-Sup Kang","doi":"10.1109/FGCN.2007.105","DOIUrl":"https://doi.org/10.1109/FGCN.2007.105","url":null,"abstract":"In this paper, we first propose a cryptographic authentication protocol which meets the privacy protection for tag bearers, and then a digital Codec for RFID tag is designed based on the protocol. The protocol which uses cryptographic hash algorithm is based on a three-way challenge response authentication scheme. In addition, we will show how the three different types of protocol frame formats are formed by extending the ISO/IEC 18000-3 standard[3] for implementing the proposed authentication protocol in RFID system environment. The system has been described in Verilog HDL and also synthesized using Synopsys Design Compiler with Hynix 0.25 mum standard-cell library. From implementation results, we found that the proposed scheme is well suite to implement robust RFID system against active attacks such as the man-in-the-middle attack.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130530555","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}
As home network service is popularized, the kind of smart device is rising up and home appliances are becoming intelligent. Device authentication process is necessary that we safely use these devices and construct secure home network environment. In this paper, we proposed home device authentication framework and home device certificate profile. And also we describe home device registration process and home device certificate issuing process. Our home device certificate profile is based on the internet X.509 version 3 certificate. And our device authentication framework adheres to basic concept of general PKI.
{"title":"Home Device Authentication Method Based on PKI","authors":"Yun-kyung Lee, Deok-Gyu Lee, J. Han","doi":"10.1109/FGCN.2007.143","DOIUrl":"https://doi.org/10.1109/FGCN.2007.143","url":null,"abstract":"As home network service is popularized, the kind of smart device is rising up and home appliances are becoming intelligent. Device authentication process is necessary that we safely use these devices and construct secure home network environment. In this paper, we proposed home device authentication framework and home device certificate profile. And also we describe home device registration process and home device certificate issuing process. Our home device certificate profile is based on the internet X.509 version 3 certificate. And our device authentication framework adheres to basic concept of general PKI.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130621408","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}
A practical problem that has been more and more acknowledged is how to measure similarities of data objects. With high interconnectivity to heterogeneous information sources, the primary issue in many applications such as retrieval, interoperability, etc, is focused on determining which data is relevant. Many methods for measuring have been investigated. We propose a complementary approach, based on context information to enhance "understanding" of object-to-object associations, which measures similarities of data objects that are an abstraction from real world. In our method, confidence level on similarities can be greatly improved by "observing" data objects from multi-perspectives. It is also demonstrated by our experiments that this approach is effective as compared to other computation approaches.
{"title":"Research on a Model of Context-driven Similarities Computation between Data Objects","authors":"Haixue Liu, Zhao Lv, Junzhong Gu","doi":"10.1109/FGCN.2007.192","DOIUrl":"https://doi.org/10.1109/FGCN.2007.192","url":null,"abstract":"A practical problem that has been more and more acknowledged is how to measure similarities of data objects. With high interconnectivity to heterogeneous information sources, the primary issue in many applications such as retrieval, interoperability, etc, is focused on determining which data is relevant. Many methods for measuring have been investigated. We propose a complementary approach, based on context information to enhance \"understanding\" of object-to-object associations, which measures similarities of data objects that are an abstraction from real world. In our method, confidence level on similarities can be greatly improved by \"observing\" data objects from multi-perspectives. It is also demonstrated by our experiments that this approach is effective as compared to other computation approaches.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124030106","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}
This article is concerned with efficiency and reliability issues related to level set-based segmentation methods. Geometric active contour methods show some desirable characteristics: flexibility in the topological changes of contours, capability of detecting interior boundaries, and a low sensitivity to noise. However, they tend to detect undesired boundaries when applied to general images. In order to overcome the drawback, we introduce the method of background subtraction (MBS), which transforms a general image to an essentially binary image and therefore conventional segmentation methods can detect desired edges more effectively. An effective initialization technique for the level set function and a hybridization of information from both the intensity and statistical properties (distributions) are also introduced to improve efficiency and reliability of level set-based segmentation methods. The resulting algorithm has proved to locate the desired edges in 2-4 iterations, for various images.
{"title":"Novel Numerical Methods for Efficient and Reliable Segmentation","authors":"Hongseok Choi, Seongjai Kim","doi":"10.1109/FGCN.2007.171","DOIUrl":"https://doi.org/10.1109/FGCN.2007.171","url":null,"abstract":"This article is concerned with efficiency and reliability issues related to level set-based segmentation methods. Geometric active contour methods show some desirable characteristics: flexibility in the topological changes of contours, capability of detecting interior boundaries, and a low sensitivity to noise. However, they tend to detect undesired boundaries when applied to general images. In order to overcome the drawback, we introduce the method of background subtraction (MBS), which transforms a general image to an essentially binary image and therefore conventional segmentation methods can detect desired edges more effectively. An effective initialization technique for the level set function and a hybridization of information from both the intensity and statistical properties (distributions) are also introduced to improve efficiency and reliability of level set-based segmentation methods. The resulting algorithm has proved to locate the desired edges in 2-4 iterations, for various images.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"54 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120913866","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}
A black hole attack is a severe attack that can be easily employed against routing in mobile ad hoc networks. A black hole is a malicious node that falsely replies for any route requests without having active route to specified destination and drops all the receiving packets. If these malicious nodes work together as a group then the damage will be very serious. This type of attack is called cooperative black hole attack. In S. Ramaswamy et al. (2003), we proposed a solution to identifying and preventing the cooperative black hole attack. Our solution discovers the secure route between source and destination by identifying and isolating cooperative black hole nodes. In this paper, via simulation, we evaluate the proposed solution and compare it with other existing solutions in terms of throughput, packet loss percentage, average end-to-end delay and route request overhead. The experiments show that (1) the AODV greatly suffers from cooperative black holes in terms of throughput and packet losses, and (2) our solution proposed in S. Ramaswamy et al. (2003) presents good performance in terms of better throughput rate and minimum packet loss percentage over other solutions, and (3) our solution can accurately prevent the cooperative black hole attacks. The example findings are: (1) the proposed scheme presents 5 - 8% more communication overhead of route request; and (2) The secure route discovery delay slightly increases the packet loss percentage.
黑洞攻击是一种很容易被用来攻击移动自组织网络中的路由的严重攻击。黑洞是一种恶意节点，它在没有指定目的地的活动路由的情况下，错误地响应任何路由请求，并丢弃所有接收到的数据包。如果这些恶意节点组成一个小组一起工作，那么破坏将是非常严重的。这种类型的攻击被称为合作黑洞攻击。S. Ramaswamy et al.(2003)提出了一种识别和防止协同黑洞攻击的解决方案。该方案通过识别和隔离合作黑洞节点，发现源和目的之间的安全路由。在本文中，通过仿真，我们评估了所提出的解决方案，并将其与其他现有解决方案在吞吐量，丢包率，平均端到端延迟和路由请求开销方面进行了比较。实验表明:(1)AODV在吞吐量和丢包方面受到合作黑洞的严重影响;(2)S. Ramaswamy et al.(2003)提出的解决方案在吞吐量和丢包率方面比其他解决方案表现出较好的性能;(3)我们的解决方案可以准确地防止合作黑洞攻击。实例结果表明:(1)该方案路由请求的通信开销增加5 ~ 8%;(2)安全路由发现延迟会略微增加丢包率。
{"title":"Preventing Cooperative Black Hole Attacks in Mobile Ad Hoc Networks: Simulation Implementation and Evaluation","authors":"H. Weerasinghe, Huirong Fu","doi":"10.1109/FGCN.2007.184","DOIUrl":"https://doi.org/10.1109/FGCN.2007.184","url":null,"abstract":"A black hole attack is a severe attack that can be easily employed against routing in mobile ad hoc networks. A black hole is a malicious node that falsely replies for any route requests without having active route to specified destination and drops all the receiving packets. If these malicious nodes work together as a group then the damage will be very serious. This type of attack is called cooperative black hole attack. In S. Ramaswamy et al. (2003), we proposed a solution to identifying and preventing the cooperative black hole attack. Our solution discovers the secure route between source and destination by identifying and isolating cooperative black hole nodes. In this paper, via simulation, we evaluate the proposed solution and compare it with other existing solutions in terms of throughput, packet loss percentage, average end-to-end delay and route request overhead. The experiments show that (1) the AODV greatly suffers from cooperative black holes in terms of throughput and packet losses, and (2) our solution proposed in S. Ramaswamy et al. (2003) presents good performance in terms of better throughput rate and minimum packet loss percentage over other solutions, and (3) our solution can accurately prevent the cooperative black hole attacks. The example findings are: (1) the proposed scheme presents 5 - 8% more communication overhead of route request; and (2) The secure route discovery delay slightly increases the packet loss percentage.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116320458","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}
RFID (Radio Frequency Identification) system is contactless automatic identification system used by small and low-cost RFID tag. An RFID tag can be stuck on or incorporated into a product, animal, or person and identify tag information by using radio frequency. RFID system will be able to replace barcode system for many merits. But the most important problem of RFID system is that unauthorized readers can access to tag information, which should be possible to produce privacy problem. Presently many researches about RFID tag authentication for solving privacy problem are going on, but these researches have many difficulties for limited hardware resource. In this paper, we analyzed RFID tag authentication protocols using secret value of many proposed. And we also dealt with many problems in the protocols and propose the future research for problem solving.
RFID (Radio Frequency Identification)系统是采用小型低成本RFID标签的非接触式自动识别系统。RFID标签可以贴在产品、动物或人身上，并通过射频识别标签信息。RFID系统将以其诸多优点取代条形码系统。但RFID系统最重要的问题是未经授权的读取器可以访问标签信息，这应该可能产生隐私问题。目前，针对RFID标签隐私问题的认证研究有很多，但由于硬件资源有限，这些研究存在很多困难。本文分析了目前提出的几种使用秘密值的RFID标签认证协议。并对协议中存在的问题进行了分析，提出了今后的研究方向。
{"title":"An Analysis of RFID Tag Authentication Protocols Using Secret Value","authors":"Jung-Sik Cho, Sang-Soo Yeo, Sung Kwon Kim","doi":"10.1109/FGCN.2007.55","DOIUrl":"https://doi.org/10.1109/FGCN.2007.55","url":null,"abstract":"RFID (Radio Frequency Identification) system is contactless automatic identification system used by small and low-cost RFID tag. An RFID tag can be stuck on or incorporated into a product, animal, or person and identify tag information by using radio frequency. RFID system will be able to replace barcode system for many merits. But the most important problem of RFID system is that unauthorized readers can access to tag information, which should be possible to produce privacy problem. Presently many researches about RFID tag authentication for solving privacy problem are going on, but these researches have many difficulties for limited hardware resource. In this paper, we analyzed RFID tag authentication protocols using secret value of many proposed. And we also dealt with many problems in the protocols and propose the future research for problem solving.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116358979","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}
In this paper, an ordered Hybrid ARQ(HARQ) scheme for LDPC-coded OFDM system is presented , in which the important bits with large degrees have high retransmission priorities and are mapped to the sub-carriers with better CQI levers in OFDM system. The new scheme considers the degree distribution property of LDPC codes and improved the system performance by providing the important bits with more protection. The performance of the new scheme has been investigated by the Gaussian Approximation (GA). The analysis and simulation results prove that the new scheme is practical because it has better performance with low system complexity.
{"title":"An Ordered HARQ Scheme for LDPC-Coded OFDM System","authors":"Xuehua Li, Zhensong Li, Yiqing Cao, Dacheng Yang","doi":"10.1109/FGCN.2007.67","DOIUrl":"https://doi.org/10.1109/FGCN.2007.67","url":null,"abstract":"In this paper, an ordered Hybrid ARQ(HARQ) scheme for LDPC-coded OFDM system is presented , in which the important bits with large degrees have high retransmission priorities and are mapped to the sub-carriers with better CQI levers in OFDM system. The new scheme considers the degree distribution property of LDPC codes and improved the system performance by providing the important bits with more protection. The performance of the new scheme has been investigated by the Gaussian Approximation (GA). The analysis and simulation results prove that the new scheme is practical because it has better performance with low system complexity.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114723233","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}
TCP (Transmission Control Protocol) is one of the protocols which are widely used from the Internet environments. Through the flow control of TCP, it could be increased efficiency for the loss and a retransmission of data and the flow control become accomplished though window technique which puts the limit of size. By the flow control, TCP divided in various versions. In this paper, it is analyzed the simulation result which applies the error model over wireless network in the Newreno which is an improved model of the representative Tahoe, Reno.
TCP (Transmission Control Protocol，传输控制协议)是Internet环境中广泛使用的协议之一。通过TCP的流量控制，可以提高数据丢失和重传的效率，并通过限制大小的窗口技术来实现流量控制。根据流量控制，TCP分为不同的版本。本文分析了将误差模型应用于具有代表性的美国里诺市塔霍市的改进模型——纽里诺市无线网络的仿真结果。
{"title":"Performance Analysis of TCP over Wireless Network Using Error Model","authors":"Yu-Doo Kim, Il-Young Moon, Heau-Jo Kang","doi":"10.1109/FGCN.2007.180","DOIUrl":"https://doi.org/10.1109/FGCN.2007.180","url":null,"abstract":"TCP (Transmission Control Protocol) is one of the protocols which are widely used from the Internet environments. Through the flow control of TCP, it could be increased efficiency for the loss and a retransmission of data and the flow control become accomplished though window technique which puts the limit of size. By the flow control, TCP divided in various versions. In this paper, it is analyzed the simulation result which applies the error model over wireless network in the Newreno which is an improved model of the representative Tahoe, Reno.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121441339","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}
When the digital forensic investigator looks into the suspicious organization including the company, it is important to obtain the data which has the overview of information of the organization. Since system structure of computer and network about the organization is complicated, the investigator who does not know its structure has a difficulty to detect the database system which has the data. In particular, if the organization intentionally builds the covert database system in order to hide data, then the investigator would have a more difficulty. In this paper, we describe structures of the covert database system for hiding fraud information in the organization. Next, we show techniques and propose our tool for detecting the covert database system. And then we suggest scenarios about investigation procedure using our tool.
{"title":"Discovering Methodology and Scenario to Detect Covert Database System","authors":"G. Lee, Seokhee Lee, E. Tsomko, Sangjin Lee","doi":"10.1109/FGCN.2007.106","DOIUrl":"https://doi.org/10.1109/FGCN.2007.106","url":null,"abstract":"When the digital forensic investigator looks into the suspicious organization including the company, it is important to obtain the data which has the overview of information of the organization. Since system structure of computer and network about the organization is complicated, the investigator who does not know its structure has a difficulty to detect the database system which has the data. In particular, if the organization intentionally builds the covert database system in order to hide data, then the investigator would have a more difficulty. In this paper, we describe structures of the covert database system for hiding fraud information in the organization. Next, we show techniques and propose our tool for detecting the covert database system. And then we suggest scenarios about investigation procedure using our tool.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"1 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113933072","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}
In this paper, we propose an object localization method for home environments. This method utilizes RFID equipments, a mobile robot and some ceiling cameras. The RFID system estimates a rough position of each object. The autonomous robot with RFID antennas explores the environment so as to detect other objects on the floor. Each object that is attached an RFID tag, is then recognized by utilizing its feature information stored in this tag. Finally, the precise localization of each object is achieved by the ceiling cameras with particle filters. The accuracy and the robustness of the proposed method are verified through an experiment.
{"title":"RFID Based Object Localization System Using Ceiling Cameras with Particle Filter","authors":"Prachya Kamol, S. Nikolaidis, R. Ueda, T. Arai","doi":"10.1109/FGCN.2007.194","DOIUrl":"https://doi.org/10.1109/FGCN.2007.194","url":null,"abstract":"In this paper, we propose an object localization method for home environments. This method utilizes RFID equipments, a mobile robot and some ceiling cameras. The RFID system estimates a rough position of each object. The autonomous robot with RFID antennas explores the environment so as to detect other objects on the floor. Each object that is attached an RFID tag, is then recognized by utilizing its feature information stored in this tag. Finally, the precise localization of each object is achieved by the ceiling cameras with particle filters. The accuracy and the robustness of the proposed method are verified through an experiment.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"368 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132806488","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
扫码关注我们
求助内容：
应助结果提醒方式：