41825214
XKMS-Based Key Management for Open LBS in Web Services Environment
As the killer application of the wireless internet, the LBS (Location-based Services) has reconsidered technology about location determination technology, LBS middleware server for various application, and diverse contents processing technology. For this kind of LBS, the role of security service is very important in the LBS that store and manage the location information of mobile devices and support various application services using those location information. And in all phases of these functions that include acquisition of location information, storage and management of location information, user management including authentication and information security, and management of the large-capacity location information database, safe security service must be provided. This paper describes a key management architecture based on XML standards for securing access to location based information and services. The main characteristic of the approach is that it build on a number of XML-based standards.
6231139
Practical and Provably-Secure Multicasting over High-Delay Networks
This paper considers the problem of authenticated key exchange in a dynamic group in which members join and leave the group in an arbitrary fashion. A group key exchange scheme for such a dynamic group is designed to minimize the cost of the rekeying operations associated with group updates. Although a number of schemes have attempted for many years to address this problem, all provably-secure schemes are inadequate in dealing with a dynamic group where group members are spread across a wide area network; their communication overhead for group rekeying is significant in terms of the number of communication rounds or the number of messages, both of which are recognized as the dominant factors that severely slow down group key exchange over a wide area network. In this paper, we propose an efficient key exchange scheme for this scenario and prove its security against an active adversary under the factoring assumption. The proposed scheme requires only a constant number of rounds while achieving low message complexity.
38600553
WIPI Mobile Platform with Secure Service for Mobile RFID Network Environment
Recently, RFID (Radio Frequency Identification) technology is practically applied to a number of logistics processes as well as asset management, and RFID is also expected to be permeated in our daily life with the name of ’Ubiquitous Computing’ or ‘Ubiquitous Network’ within the near future. The R&D groups in global now have paid attention to integrate RFID with mobile devices as well as to associate with the existing mobile telecommunication network. Such a converged technology and services would lead to make new markets and research challenges. However, the privacy violation on tagged products has become stumbling block. We propose light-weight security mechanism which is constructed by mobile RFID security mechanism based on WIPI (Wireless Internet Platform for Interoperability). WIPI-based light-weight mobile RFID security platform can be applicable to various mobile RFID services that required secure business applications in mobile environment.
32223299
Security Techniques Based on EPC Gen2 Tag for Secure Mobile RFID Network Services
RFID (Radio Frequency Identification) technology will be a ubiquitous reality in daily life in the near future. The R&D groups in global now have paid attention to integrate RFID with mobile phone devices as well as to associate with the existing mobile telecommunication network. Such a converged technology and services would lead to make new markets and research challenges. However, privacy threats on RFID tags embedded into products has become stumbling block. Therefore, this paper propose a new security technique for mobile RFID service, which can be support to secure RFID service and uses the privacy protection in mobile RFID network services.
33400437
Facial Expression Recognition Using Active Appearance Model
This paper describes a facial expression recognition system based upon Active Appearance Model (AAM), which has been typically used for the face recognition task. Given that AAM has been also used in tracking the moving object, we thought it could be effective in recognizing the facial expressions of humans. Our results show that the performance of the facial expression recognition using AAM is reliably high when it combined with an enhanced Fisher classification model.
17995343
Automatic design of nonlinear filters by nearest neighbor learning
Nonlinear filters have been used not only in noise elimination but in a wide variety of image processing applications. Traditionally the design of a digital filter is a manual task and the user accomplishes it based on previous experiences. Unfortunately often this is not a trivial task. Thus some works try to overcome this difficulty constructing the filters automatically by computational learning neural networks, genetic algorithms and statistical estimation. These works use typical input-output images of the application as the training samples. Many different kinds of filters can be easily constructed using this approach. This paper proposes the use of nearest neighbor (NN) learning to automatic filter construction. The kd-tree (k-dimensional binary tree) is used to accelerate the NN searching. A texture recognition application example is depicted.
15684093
Efficient Authentication and Authorization of Mobile Users Based on Peer-to-Peer Network Mechanisms
This paper presents a peer-to-peer based authentication and authorization infrastructure to minimize authentication delays when mobile users roam across different wireless networks. The basic idea is to avoid exchanging security information between networks visited by a roaming user and the user's home authentication, authorization, and accounting (AAA) server that is typically located in the home network possibly far away from the visited network. Instead, authentication and authorization of a roaming user shall be supported by an AAA server in the visited network. We propose that the AAA server that is responsible for authentication and authorization in a newly visited network locates the AAA server in the previously visited network and retrieves the required security information from that AAA server. The AAA servers can be organized in a peer-to-peer manner and peer-to-peer mechanisms can be applied for searching and transferring security information between them. We propose several mechanisms for quickly locating the previously responsible AAA server in order to decrease authentication delays. The performance of these mechanisms is evaluated by simulations. Real performance measurements show the rather low performance overhead of application level forwarding used in peer-to-peer networks.
14176330
System Specification Based Network Modeling for Survivability Testing Simulation
As the structure and behavior of computer network becomes complicated and unpredictable, it becomes difficult to test the survivability of network. The modeling and simulation is a widely used approach to predict the behavior of system or set of system. In this research, we apply a modeling methodology to construct the valid model of computer network focusing on its vulnerability for survivability testing. To accomplish our aim, the appropriate modeling method should be defined. Especially, we take advantage of the system specification based modeling approach to construct valid network model.
1367636
Wrong Path Events: Exploiting Unusual and Illegal Program Behavior for Early Misprediction Detection and Recovery
Control and data speculation are widely used to improve processor performance. Correct speculation can reduce execution time, but incorrect speculation can lead to increased execution time and greater energy consumption. This paper proposes a mechanism to leverage unexpected program behavior, called wrong-path events, that occur during periods of incorrect speculation. A wrong-path event is an instance of illegal or unusual program behavior that is more likely to occur on the wrong path than on the correct path, such as a NULL pointer dereference. When a wrong-path event occurs, the processor can predict that it is on the wrong path and speculatively initiate misprediction recovery. The purpose of the proposed mechanism is to improve the effectiveness of speculative execution in a processor by helping to insure that the processor remain "on the correct path" throughout periods of speculative execution. We describe a set of wrong-path events which can be used as strong indicators of misprediction. We find that on average 5% of the mispredicted branches in the SPEC2000 integer benchmarks produce a wrong-path event an average of 51 cycles before the branch is executed. We show that once a wrong-path event occurs, it is possible to accurately predict which unresolved branch in the processor is mispredicted using a simple, novel prediction mechanism. We discuss the advantages and shortcomings of wrong-path events and propose new areas for future research.