28th CSEC Group Meeting

Date: March 22, 2005; March 23, 2005

Location: Osaka University

Transportation

28th CSEC Group Meeting Program

(1) Performance Evaluation of TDMA Slot Assignment Protocol in Ad Hoc Networks with Unidirectional Wireless Links: Akimitsu KANZAKI (Dept. of Multimedia Eng., Graduate School of Information Science and Technology Osaka University)
Takahiro HARA (Dept. of Multimedia Eng., Graduate School of Information Science and Technology Osaka University)
Shojiro NISHIO (Dept. of Multimedia Eng., Graduate School of Information Science and Technology Osaka University)
: Due to the ability to provide the collision-free packet transmission regardless of the traffic load,TMDA (Time Division Multiple Access) has been applied effectively to ad hoc sensor networks. In our previous work, we have proposed a TDMA slot assignment protocol that utilizes the channel bandwidth effectively in ad hoc sensor networks in which nodes have differenct communication ranges. In this paper, we verify the effectiveness of our proposed protocol by simulation experiments. In simulation experiments, we evaluate the channel utilization and the efficiency of data transfer which are given by our proposed protocol.

(2) Proposal of Navigation System for Dissolving Traffic Congestion with Inter-Vehicle Communication: Takashi Terauchi (Graduate School of Information Science Nara Institute of Science and Technology)
Naoki Shibata (Department of Information Processing and Management Shiga University)
Keiichi Yasumoto (Graduate School of Information Science Nara Institute of Science and Technology)
Teruo Higashino (Graduate School of Information Science and Technology Osaka University)
Minoru Ito (Graduate School of Information Science Nara Institute of Science and Technology)
: In this paper,we propose a method to mitigate traffic jam by inter-vehicle communication and a route navigation function of car navigation systems. In the proposed method,in order to allow each vehicle to obtain traffic information on the way to its final destination,the demand for each area of the geographical region is calculated from each vehicle`s scheduled route and propagated to each area. Traffic information on each link (road between intersections) is maintained vehicles near the link by receiving the time to pass the link from each vehicle and by generating statistic information. The latest statistics of traffic information on each link is propagated by inter-vehicle communication. Based on the received information,each vehicle calculates a route which avoids the congested area so that the congestion will be dissolved.

(3) Large High Throughput Wireless Multihop Message Transmission with Power Control: Sanae Shimada (Tokyo Denki University)
Hiroaki Higaki (Tokyo Denki University)
: In a wireless mobile network with wireless multihop transmissions such as a mobile adhoc network and a wireless multihop access network, end-to-end throughput from a source mobile computer to a destination one is less than 1/3 of throughput of a wireless communication link due to random waiting time for contention avidance and RTS/CTS control for solving a hidden terminal problem. In this paper, the authors propose an adhoc routing protocol and a message transmission protocol with transmission power control for achieving higher end-to-end throughput. The maximum end-to-end throughput in the proposed protocols is 1/2 of throughput of a wireless communication links. Simulation result shows that the proposed protocol has almost the same connectivity with conventional no power control protocols if density of mobile computers is sufficiently high.

(4) Contention-Free Ad hoc Routing with Power Control: Yasuyuki Nishijima (Department of Computers and Systems Engineering Tokyo Denki University)
Hiroaki Higaki (Department of Computers and Systems Engineering Tokyo Denki University)
: A Mobile computer changes its location from time to time.Wireless communication protocols,e.g. IEEE802.11 and HIPERLAN,are widely available in mobile ad-hoc networks. By controlling signal transmission power in a mobile computer,transmission range of the signal is changed. By increasing the signal transmission power,the number of hops for transmitting a message between two mobile computers is reduced. On the other hand,by reducing the signal transmission power,the probability of contention and collesion in signal transmission is also reduced. Hence,there is a trade off in controlling the signal transmission power in order to reduce an end-to-end message transmission delay. This paper proposes two algorithms for finding another path by controlling signal transmission power for achieving shorter message transmission delay. These algorithms are invoked locally in each mobile conputer on a path,i.e. these are not centralized one in a mobile ad-hoc network.

(5) A proposal of detection and blocking mechanism for retarding the spread of Internet worm: Yuji Ootaku
Hiroaki Hazeyama
Youki Kadobayashi
: In recent years, network congestion caused by worm traffic occurs frequently. Worm occupies wide bandwidth of the network when it tries to infect other hosts. Hence, it is important to respond to the congestion caused by worm in early stage of infection. It is hard to do so, however, because they spread on the whole network very quickly. In order to solve this problem, we propose a mechanism aimed to delay worm's proliferation. The mechanism determines worm traffic by monitoring the connection to the unused IP addresses. When the mechanism finds out the traffic, it deceives itself as targeted hosts and maintain the connections. When any infected host exists on the same subnet, the mechanism shuts down the affected network.

(6) Formal method using demodulation against metamorphic viral coding: Ruo Ando (Graduate School of Media and Governance Keio University)
Yoshiyasu Takefuji (Graduate School of Media and Governance Keio University)
: In this paper we present a equivalence checking method applying demodulation for detecting metamorphic viral coding. For effective searching, SoS (set of support) strategy is applied. Target code is added to the list of set of support with repeating equality substitution to generate unit conflict. Demodulators could be described from the experience specified for skill developer. This system enabled us to detect metamorphic code effectively in the point that we control scanning with demodulators heuristically adopted.

(7) Fast TCP Portscan detection Method: Masayoshi KOHARA (School of Information Science and Electrical Engineering Kyushu University)
Yoshiaki HORI (Faculty of Information Science and Electrical Engineering Kyushu University)
Koichi SAKURAI (Faculty of Information Science and Electrical Engineering Kyushu University)
: Recently, there are many indiscriminant attacks against end-hosts on the Internet.As attackers carry out TCP portscans to find vulnerable end-hosts, portscans can be considered as the sign of intrusion.Therefore prompt detection of the portscan is significant to prepare protection of end-hosts.There have already been several work on detecting portscans and have been using their methods in some network intrusion detection systems. Most of them, however, are insufficient for prompt detection of scanners. Consequently, we requires promptness with accuracy.In this research, I propose an efficient method by which I can detect portscans according to the multiple criteria. In summary, the proposed scheme can achieve prompt detection of portscans with sufficient accuracy.

(8) A Proposal of an Integrated Worm Countermeasure System Based on Dynamic VLAN Control: Tatsuya BABA (NTT Data Corporation)
Masataka KADO (NTT Data Corporation)
Tsutomu INADA (NTT Data Corporation)
: Recently, infection of Internet worms such as "Blaster" , "Sasser" , and "Netsky" are becoming a serious problem. To prevent damage from these worms, there are "quarantine systems" that check the installed anti-virus software and the applied security patches on the client PCs when they are connected to the enterprise network. They have some problems, however, such that it is necessary to install certain anti-virus software supported by the quarantine system, and some application programs do not work after certain patch is applied. In this paper, we propose an integrated worm countermeasure system which has functionalities such as quarantine, worm extermination, protection, infection detection, and isolation on network side without depending on client software.

(9) A Report on Revision of ITU-T Recommendation X.509: Hirosato TSUJI
Jun'ichi YAMAGUCHI
: ITU-T Recommendation X.509 (also published as ISO/IEC 9594-8) is the international standard which defines a framework of public-key certificates for PKI (Public Key Infrastructure). The X.509-based certificates are implemented on various products, e.g. mobile phones. We, as members of ISO/IEC JTC1/SC6/WG8, have been maintaining X.509 and related standards. In this paper, we introduce the overview of the next edition of X.509. We also mention the correction of existing standards, the future work items and the relationship to their profile specifications developed by IETF PKIX WG.

(10) Fast Algorism for X.509 Certificate Path Validation: Shingo Hane (Hitachi, Ltd.)
Takahiro Fujishiro (Hitachi, Ltd.)
Yoko Hashimoto (Hitachi, Ltd.)
Satoru Tezuka (Hitachi, Ltd.)
: An algorism to execute fast path validation of the X.509 Certificate was developed. Not only certificates and certificate revocation information but also certification path information was used to be faster. The effect of it was confirmed by the experiment of the server system that had the fast algorism of certification path verification on the private test environment.

(11) DEVELOPMENT OF UNIVERSAL TIME-STAMP VALIDATION SERVER BASED ON DVCS: Yoshinobu Tanigawa (Systems Development Laboratory Hitachi, Ltd.)
Yoshinori Honda (Systems Development Laboratory Hitachi, Ltd.)
Hiroaki Oguro (Research and Development Headquarters NTT DATA Corporation)
Masaoki Takamura (Research and Development Headquarters NTT DATA Corporation)
: In this paper, we present the universal time-stamp validation server which improves the interoperability and usability of time-stamp validation. The server universally verifies the validity of any time-stamp token produced by any time-stamping scheme. We designed and developed the time-stamp validation protocol based on RFC 3029 for its practicality and extensibility. Moreover, we designed a common interface for verification modules of original non-standard time-stamping schemes. We constructed a prototype client-server system, and confirmed that the server successfully performed time-stamp validation of two types of time-stamps which are based on RFC 3161 and the ISO/IEC 18014-2 archiving scheme.

(12) Implementation and evaluation of Security Certificate Platform for Verification of Safety Communication: Takamasa Isohara (Dept. of Info. & Computer Science Keio University)
Chie Ishida (Dept. of Info. & Computer Science Keio University)
Yuko Kitada (Dept. of Info. & Computer Science Keio University)
Keisuke Takemori (KDDI R&D Laboratories Inc.)
Iwao Sasase (Dept. of Info. & Computer Science Keio University)
: Recently, the authentication technology to attest the identity of the other party of the communication such as PKI is used. However, that technology cannot confirm even the introduction situation of other party's security countermeasures. Therefore, the user on the network has faced the threat of a viral infection and an intrusion. Then, the new concept that was called a security certificate platform that guaranteed other party's of the communication safety measures situation was proposed. In this paper, the requirement for safety, flexibility, and the feasibility to achieve the security certificate platform is clarified. We have also implementation the proposed scheme, and evaluated its feasibility in view of swift response.

(14) Active Modifier of Control Flow for Detecting Anomalous: Kohei Tatara (Graduate School of Information Science and Electrical Engineering Kyushu University)
Toshihiro Tabata (Faculty of Information Science and Electrical Engineering Kyushu University Japan)
Kouichi Sakurai (Faculty of Information Science and Electrical Engineering Kyushu University Japan)
: In order to prevent malicious use of the computer using buffer overflow vulnerabilities, a corrective action by not only calling a programmer's attention but expansion of compiler or OS is important. On the other hand, introduction and employment of an intrusion detection system must be easy for the user by whom the knowledge about a computer is restricted. In this paper, we can detect an anomly program behavior by actively modifying some control flows of a program. Our method satisfies these requirements and gives no false positives.

(15) A Proposal of a System for Detecting Buffer Overflow with Detecting Alteration of Data: Fumiaki NAGANO (Department of Electrical Engineering and Computer Science School of Engineering Kyushu University)
Kohei TATARA (Graduate School of Information Science and Electrical Engineering Kyushu University)
Toshihiro TABATA (Faculty of Information Science and Electriccal Engineering Kyushu University)
Kouichi SAKURAI (Faculty of Information Science and Electriccal Engineering Kyushu University)
: Numerous security technologies which detect buffer overflow have already proposed. Almost these technologies detect if buffer overflows happen or not, but don't detect alteration of variable integrity. But there are attacks which are not be able to be defenced unless the technology detect alteration of variable integrity. So in this paper, we propose a system which detect alteration of variable integrity. Some exinting technologies could be bypassed if the attacker can see the user memory, but our proposed system can't be bypassed even if the attacker can see the user memory. And our proposed system can restore data which is altered by attackers using buffer overflow.

(16) An Anomaly Detection Technique using Network Profiles: Keisuke TAKEMORI (KDDI Labs.)
Yutaka MIYAKE (KDDI Labs.)
Toshiaki TANAKA (KDDI Labs.)
: Recently, a security operation center (SOC) is established against network attacks, which monitors global area networks. Based on computing techniques of time-axis, the SOC evaluates a deviation of mean attack ratio of overall networks, and detects anomaly events. However, there are no comparing techniques of the attack ratio on a space-axis (network-axis). It is hard to evaluate the deviation of mean attack ratio on each network. In this research, we propose a standardizing technique of the mean attack ratio considering with a trend of the network profile. Experimental results with some real audit data show that the objective alarms effect with more reliable response for SOC operators.

(17) Research of Middleware for Omnidirectional Video Communication: Yuya Maita (Graduate school of Software and Information Science Iwate Prefectural University)
Koji Hashimoto (Graduate school of Software and Information Science Iwate Prefectural University)
Yoshitaka Shibata (Graduate school of Software and Information Science Iwate Prefectural University)
: In this paper, a middleware for Omnidirectional video communication system is introduced. The omnidirectional image has a wider view than a single directional camera and able to realize surveillance system or TV confeence in smal room. In this paper, we describe the architecture and functions of the middleware for omnidirectional image control and effective video transmission system.

(18) An Event Delivery Mechanism for Multi-Player Games on P2P Networks with Load Balancing and Short Latency: Shinya Yamamoto (Graduate School of Information Science Nara Institute of Science and Technology)
Yoshihiro Murata (Graduate School of Information Science Nara Institute of Science and Technology)
Keiichi Yasumoto (Graduate School of Information Science Nara Institute of Science and Technology)
Minoru Ito (Graduate School of Information Science Nara Institute of Science and Technology)
: In oeder to achieve multi-party networked games without specific servers in P2P environments,we proposed a P2P based event delivery method where a shared game space is divided into multiple sub\areas(game areas) and some nodes are selected from all players to deliver game events occurring in their responsible areas to player nodes.This method also includes a load balancing mechanism which allows each responsible node for the congested area to dynamically construct a tree of multiple nodes and deliver events along the tree to reduce event forwaeding overhead per node.However,this mechanism introduces larger delivery latency as the event delivery path becomes lpnger. Also,when each user has visible area over several game areas,he/she must subscribe to multiple responsible nodes to receive events occurring in those areas.In our existing method,this problem was not considered in detail.In this paper,we propose techniques (1) to reduce end-to-end event delivery latency by dynamically replacing nodes in the tree,and (2) to efficiently deliver events to users who have visible areas over multiple game areas.Through simulations with ns-s,we have confirmed that the proposed method can reduce end-to-end event delivery latency up to 40%.

(19) A Proposal and an Implementation of Voice over IP System Passing Through FireWall: Masashi Ito (Graduated School of Information and Science Meijo University)
Akira Watanabe (Graduated School of Information and Science Meijo University)
: In recent years, IP telephone has achieved remarkable progress on the Internet through "low priced charge", "continuous connection environment", and "high-speed communication band". However, it is not easy to use IP telephone over firewall and NA(P)T because of their restrictions of the communication. We have proposed the system called SoFW that suppresses the problem. In this paper, detailed functions and its implementation method of SoFW are described.

(20) Reduction of TCP Retransmission for Higher Throughput with Multiple-Route Transmission in Ethernet LAN: Takeshi Kato (Department of Computers and Systems Engineering Tokyo Denki University)
Hiroaki Higaki (Department of Computers and Systems Engineering Tokyo Denki University)
: For supporting network applications which require higher throughput,multiple-route message transmission has been proposed.In an Ethernet LAN,dynamically determined pair of computers communicate.For realizing multiple-route message transmission in an Ethernet LAN,the authors have proposed an extended ARP by which a sender computer gets multiple MAC addresses of NICs of a receiver computer to which one IP address is assigned.In UDP/IP communication,higher throughput is achieved by using the extended ARP even though bandwidths of the NICs are different.In TCP/IP communication,it is difficult to achieve higher throughput due to packet retransmission caused by wrong oedered reception if bandwidths of the NICs are different,In this paper,we introduce buffering of packets into the sender computer for waiting transmission of packets through a pair of wider bandwidth NICs.By using this method,26.8% less packets are retransmitted and 260% more throughput is achieved.

(21) Performance Evaluation of iSCSI on 43Gbps Line: Fumio Teraoka (Information Technology Center Keio University)
Toshiro Sawaki (Information Technology Center Keio University)
Yuso Kanamori (Information Technology Center Keio University)
Kenshiro Hirose (Graduate School of Science and Technology Keio University)
Jun'ichi Nishimura (Graduate School of Science and Technology Keio University)
Masataka Nagura (Graduate School of Science and Technology Keio University)
: This paper evaluated performance of iSCSI over 43Gbps experimental line built between Yagami Campus and Shonan Fujisawa Campus of Keio University as a fundamental experiment to construction of a wide area distributed IP storage. The results showed that NFS had higher throughput than iSCSI if there is xx ms RTT over 1Gbps line. The results also showed that iSCSI had higher throughput than NFS if there is a high packet error rate, and iSCSI is suitable to networks which tends to be congested.

(22) Consideration for mobile agent security: Masyuki Mori (School of Information Science Japan Advanced Institute of Science and Technology(JAIST))
Masakazu Sohsi (School of Information Science Japan Advanced Institute of Science and Technology(JAIST))
Atsuko Miyaji (School of Information Science Japan Advanced Institute of Science and Technology(JAIST))
: We can utilize secure function evaluation with encrypted circuits and oblivious transfer in order to ensure security of mobile agents. However, most of previous works using secure function evaluation for mobile agent security do not explicitly specify the details of communication between mobile agents and their underlying execution hosts. Futhermore, if an adversary can put arbitrary data into the encrypted circuit of a mobile agent, then the adversary could obtain some secret information stord in the agent. Therefore, in our work first we introduce a trusted host between mobile agents and their execution hosts. Moreover, we use oblivious transfer in communication via the trusted host. Unfortunately, existing 1-out-of-2 oblivious transfer protocols are inefficient for that perpose, so we propose a new oblivious transfer protocol based on a k-out-of-n scheme too realize secure communication for mobile agents. Finally, we show that our oblivious transfer protocol is more efficient than previous ones.

(23) A Study on Ubiquitous Service Network: Tetsushi Matsuda
Keiichi Shimizu
: In this report, we describe the result of our study on the functionality which need be supported by communication network in ubiquitous society (we call the network ubiquitous service network). We first classify ubiquitous services into several categories and define a network function for each category. We briefly review related researches for some of the functions and describe the areas for further study.

(24) A Method of Effective Policy Construction for Context-Aware Authorization: Kensuke Shibata (NTT Information Sharing Platform Laboratories NTT Corporation)
Yoshihito Oshima (NTT Information Sharing Platform Laboratories NTT Corporation)
Yosuke Aragane (NTT Information Sharing Platform Laboratories NTT Corporation)
Atsushi Kanai (NTT Information Sharing Platform Laboratories NTT Corporation)
: In recent years access control system becomes more important to protect the valuable information. Authorization is the core component of access control. Along with the multiplicity of environment for the information usage, the context would become the important factor for authorization. So we develop context-aware authorization platform which enables dynamic access control.In this paper, we propose a method of policy construction for context-aware authorization platform. Context-aware authorization needs continuity during information usage because of the variability of context. Since our platform generates the policy for continuous authorization automatically, this method saves the policy description cost. Our method also reduces the load of authorization system because it cuts down the number of conditions in the policy for continuous authorization.

(25) Proposal and evaluation for the interactive video teleconferencing system with the eye contact: Takahiro Komine (National Institute of Information and Communications Technology and Japan Advanced Institute of Science and Technology)
Michiaki Katsumoto (National Institute of Information and Communications Technology)
Yasuo Tan (Japan Advanced Institute of Science and Technology)
: The realization of smooth changing of speakers by the eye contact among multi-sites is very important for successful interactive video teleconferencing as well as the ordinary conference in one site. We have developed the attorney terminal that a set of a camera, a monitor, a microphone and a speaker acts for remote participant's eyes/face/ear/mouth can turn round freely as the attorney of the remote participant with other real participants in the same real space. This paper evaluates the usability of the proto-type system of the attorney terminal and considers about the requirements for establishing the eye contact with concentrating the interactive teleconferencing.

(26) A Proposal of an Address Delivery Protocol Hidding Mobile User Information: Hideo Takahashi
Jun Kawashima
Toru Nakanishi
Nobuo Funabiki
: In mobile communications using the mobile phone and the wireless LAN, etc., there is a problem that privacy information such as user's locations is leaked to the access provider.This paper proposes a protocol that realizes the communication without passing the access provider user's privacy information by the user authentication of the anonymous certificate and the group signature, and by giving a temporarily Media Access Control address and Internet Protocol address.

(27) A Model for Establishing Secure Communication in Secure Service Platform: Tadashi KAJI (Hitachi, Ltd.)
Osamu TAKATA (Hitachi, Ltd.)
Kazuyoshi HOSHINO (Hitachi, Ltd.)
Takahiro FUJISHIRO (Hitachi, Ltd.)
Satoru TEZUKA (Hitachi, Ltd.)
: Secure communication protocols, which provide confidentiality and integrity of communication data, are widely used because of increasing demands of communication security.Existing secure communication protocols consist of two planes;user plane and control plane. User plane is a function to provide confidentiality and/or integrity of application data, and control plane is a function to control the user plane protocol. This paper describes a model for establishing secure communication between entities. In this model, a Trusted Third Party controls control plane of secure communication between entities and authenticate the peer entity on behalf of the entities.

(28) Automatic Generation of Security Protocols by Verified Constructions: Naoto Sato
Shigeki Hagihara
Naoki Yonezaki
: As the Internet has grown rapidly, it becomes a significant issue to design a security protocol to transmit personal or commercial data securely. Although many formal methods for verifying security protocol have been suggested, automatic generation of security protocol is more promising than finding secure protocol by verification. In this paper, we propose a method for automatic generation of security protocols for transimitting data between two principals. We give inferrence rules which deduce security properties from structure of a protocol. By using these rules, we can generate a protocol suitable for real environment, introducing cost evaluation of a protocol. Finally we discuss advantage of our method compared with other generation methods.

(29) Combination of Collusion-Secure Fingerprinting Code and Non-Colluder Detecting Code: Seiryu GOTO (Nagoya Institute of Technology)
Kimitake WAKAYAMA (Nagoya Institute of Technology)
Akira IWATA (Nagoya Institute of Technology)
: Contents fingerprinting is a technology that embeds unique ID in content and identifies pirate users who distribute illegal copies. The fingerprinting must have a resilience against a collusion attack, in which several pirates compare their fingerprinted copies to find and alter the marks. Existing secure fingerprinting codes have a very huge code length. In this paper, we propose two methods and evaluate effectiveness of the tracing performance and the code length.In the first method we use collusion secure code and Non-Colluder detecting code. The other method is to compose the collusion secure code in multi-steps.

(30) A Proposal of WaterMarking System with Maximized Resilience: Kazuo Ohzeki (Graduate School of Engineering)
Michinori Nakajima (Graduate School of Engineering)
Kouhei Yasojima (Faculty of Engineering Shibaura Institute of Technology)
: A new watermarking system which maximizes the resilience and provides authentication method without additional costs for people who distribute their digital image and sound data in the internet. In the conventional methods, embedding algorithm is kept in secret. To insist their copy rights to the others, registering their watermark data to some public institution had been required. this actually charged people registering costs, which made personal watermark embedding difficult. To cope with this, this paper proposes to disclose detection programs. Any third party can detect the watermarks. To carry out this system the detection program is obfuscated. To maximize the resilience, the watermarking system minimizes the embedded information. Assuming the embedded data independent, the majority decision rule authenticates the watermarks. Experiments with the QIM method in DFT region results sufficient resilience and provides higher complexity index than the increasing length of the detection program.

(31) A method for obtaining fine-grain privilege control mechanisms: Yu Inamura (NTT DoCoMo, Inc. Multimedia Laboratories)
Atsushi Takeshita (NTT DoCoMo, Inc. Multimedia Laboratories)
: We propose a method, which is based on cryptography techniques, for obtaining a fine-grain privilege control method. Unlike the OSes based on mandatory access control (MAC) such as the SELinux, which require cumbersome maintenance cost for management, the proposed method is quite usable and can easily be integrated into the existing OSes.

(32) Partial Lookup Services for Distributed Resources with Ranks: Yuji Soeda (Graduate School of Information Science and Technology Osaka University)
Taisuke Izumi (Graduate School of Information Science and Technology Osaka University)
Toshimitsu Masuzawa (Graduate School of Information Science and Technology Osaka University)
: Partial lookup is a method to retrieve distributed resources.For a query, it can return any subset of all resouces matching the query. While the partial lookup can achieves lower cost than the total lookup, it does not guarantee quality of lookup results. In this paper, we introduce rank of resouces, and formalize the partial lookup for ranked distributed resources. In addition, we proposes a probabilistic method to realize the partial lookup for ranked resouces in distributed systems. In this method, each server stores resouces with probability according to their ranks. The probabilistic method has adaptability to system dynamics since it requires no inter-server communication. We show the efficiency of this method by simluations. We also propose probability function transformation to improve efficiency for system dynamics and show that the transformation introduces no degradation of lookup cost.

(33) Secure Models of Autonomous Distributed Public Wireless Internet Access: Ying Huang (Kyoto University)
Kenji Ohira (Kyoto University)
Kenji Fujikawa (Kyoto University)
Yasuo Okabe (Kyoto University)
: In autonomous distributed public wireless internet access services,access points are managed by anyone with broadband internet access lines and access points.Users with accounts to any authentication in the Internet can enjoy the access service through any of these access points.However,as the owners have little knowledge about the Internet and security,management costs such as authenticationg users and saving their communication records are too high.On the other hand,as anyone can set up access points,users are exposed to the threat of their communication being eavesdropped,manipulated or spoofed by malicious access points.In this paper,we propose secure models of the autonomous distributed internet access services using the conbinations of two approaches:authentication at access point and tunnelling features.In the approach with authentication at access points,mobile nodes own accounts to some authentication infrastructure.Once authentication at access points are successful,the mobile nodes and their correspondent nodes can setup a direct communication.In implementation,we use the LIN6 and the MIPv6+IPsecAH protocols.In the approach without authentication at access points,we suggest mechanisms either forwarding all the traffic to a tunneling server or using an end-to-end sedurity protocol.In implementation,we use the PPTP protocol for forwarding and the HIP protocol to ensure end-to-end security between the mobile nodes and correspondent nodes.

(34) Distributed Data Management based on Extensible Hashing in Grid Computing: Yasutaka Nishimura (Tokyo Denki University)
Yuichi Ayusawa (Tokyo Denki University)
Tomoya Enokido (Tokyo Denki University)
Makoto Takizawa (Tokyo Denki University)
: A huge volume of data are created, stored, and used in ubiquitous networks like stream data in sensor networks. We discuss how to dynamically distribute and efficiently locate huge volume of these data in computers of a Grid environment. We adopt a type of extensible hashing to distribute data. The index to locate data is tree-structured with sibling chain. However, since every access is sent to the root node, the root is a performance bottleneck and a single point of failure. In order to resolve performance bottleneck and improve the reliability, an access request is first issued to a leaf node which is local or nearest to an application. Then, the request is forwarded up and them down to the destination node. We evaluate the algorithm compared with traditional top-down searching one in terms of access time, computation overhead,and number of messages.

(35) Implementation of Dynamic Process Resolution Protocol in Flexible Private Network: Hidekazu SUZUKI (Graduate School of Science and Technology Meijo University)
Akira WATANABE (Graduate School of Science and Technology Meijo University)
: The management of network system tends to become difficult when we improve security in intranet. Therefore, we have proposed the concept of FPN (Flexible Private Network) that can realize secure systems with simple management. DPRP (Dynamic Process Resolution Protocol) is the protocol that can create a process information table dynamically for the authentication and cipher communication between terminals under the FPN environment. In this paper, we report the implementation method of DPRP and measurement results of the DPRP sequence.

(36) Implementation of PCCOM and Its Evaluation: Shinya Masuda (Postgraduate Course in Science and Technology Meijo University)
Akira Watanabe (Postgraduate Course in Science and Technology Meijo University)
: Network security technologies have become a major concern, and it is desired that the system is compatible with the conventional systems. We have proposed the cipher communication protocol, called PCCOM (Practical Cipher COMmunication), giving no influences to existing systems. It can authenticate both terminals, and guarantee the integrity of packets, not changing the packet format. In this paper, we describe the implementation of PCCOM. The evaluation results show that PCCOM has enough flexibility and throughput in the practical use.

(37) Proposal of Real-time Stream Authentication Scheme for Motion Pictures: Shin-ichiro KANEKO (Faculty of Science and Engineering Keio University)
Shintaro UEDA (Faculty of Science and Engineering Keio University)
Nobutaka KAWAGUCHI (Faculty of Science and Engineering Keio University)
Takeshi OGINO (Faculty of Science and Engineering Keio University)
Hiroshi SHIGENO (Faculty of Science and Engineering Keio University)
Ken-ichi OKADA (Faculty of Science and Engineering Keio University)
: Motion pictures are compressed by removing spatial and temporal redundancies between frames.Therefore thereare dependencies between frames and the importance of a frame differs from one another. If a high priority frameis lost due to packet loss, all frames dependent to the lost frame is unplayable even if received on the receiver side.Therefore high priority frames must be made robust to packet loss. However previously proposed authenticationschemes do not take the characteristics specific to motion pictures into consideration and thus all frames are handledat the same level. Therefore in our scheme, the amount of redundancy distributed to each frame is adjusted accordingto the importance of each frame.

(38) Design of End-node Oriented Firewall Traversal: Keisuke Onimaru (Nara Institute of Science and Technology Graduate School of Information Science)
Michiko Izumi (Nara Institute of Science and Technology Graduate School of Information Science)
Motohiro Ichikawa (Nara Institute of Science and Technology Graduate School of Information Science)
Hideki Sunahara (Nara Institute of Science and Technology Information Science Center)
: Peer-to-peer communication model was attracted interest. Unfortunately, the model requires all end-node to be interconnectable. Technologies to keep interconnectivity and to put peer-to-peer communication model into practice include technologies for firewall traversal, virtual private network, and so on. Before using these technologies, administrator needs to permit access. As a consequence, there is insufficiency for p2p communication model. In this paper, we proposed the end-node oriented firewall control mechanism for keep interconnectivity, and to realize the peer-to-peer communication model. And we proposed the end user oriented mutual trust model for applying this technology.

(39) A Proposal of Method of Lending Car Operation Privilege by Using Cellular Phone as Smart Key: Kazumi SAITO
Hidenori OHTA
Nori MATSUDA
Takashi ITO
Hirosato TSUJI
Takeshi YONEDA
: In recent years smart keys are being applied to cars as an advanced keyless entry system. However, when lending a car to someone, handing a physical key over to him/her is still needed, which might cause a robbery of the car or its accessories. In order to lend a car without handing a physical key, in this paper, we propose a method of using a cellular phone as a smart key. By this method, lending a car is realized by transferring operation privilege from the owner's phone to the borrower's phone. Furthermore, owner can set restrictions of car operation privilege in order to improve safety and flexibility.

(40) Important Data Distribution Method Using IC Card: Masatoshi HOBO (Graduate School of Science and Technology Meijo University)
Akira Watanabe (Graduate School of Science and Technology Meijo University)
: Even in the environment as the user can choose any client terminals, secure communication between a server and a client is essential for the system. However, in this case, the client has no data for identity verification. In this paper, assuming a non-contact IC card for identity verification, we have studied an authentication method between the client terminal and the server terminal.

(41) Anonymous Authentication System Using Proxy Servers: Koji Chida (NTT Information Sharing Platform Laboratories)
Noburou Taniguchi (NTT Information Sharing Platform Laboratories)
Osamu Shionoiri (NTT Information Sharing Platform Laboratories)
Atsushi Kanai (NTT Information Sharing Platform Laboratories)
: This paper proposes an anonymous authentication system that identifies a malicious user in a threshold manner.The proposed system protects user privacy by simply using proxy servers and employs a fair blind signature and threshold cryptosystem to identify a malicious user.In the system, each signature is separable against a verifier without updating secret/public keys and the certificate, moreover, any secret key can easily be revoked if a certain number of escrow agents collaborates.

(42) Reliable broadcast authentication in sensor networks: Taketsugu Yao (Ubiquitous System Laboratory Corporate Research and Development Center Oki Electric Industry Co., Ltd.)
Yasuko Matsumura (Ubiquitous System Laboratory Corporate Research and Development Center Oki Electric Industry Co., Ltd.)
Shigeru Fukunaga (Ubiquitous System Laboratory Corporate Research and Development Center Oki Electric Industry Co., Ltd.)
: Due to the low-cost nature of sensor network nodes, we cannot generally assume the availability of a high-processing-power CPU and tamper-resistant hardware. In this paper, we propose a reliable broadcast authentication working under the above-mentioned circumstances. The proposed method, although based on symmetric cryptographic primitives, is secure against anyone who knew the message authentication key as well as the malicious router nodes in a multi-hop environment. The proposed method consists of three steps; (1) reliable broadcast of a message, (2) acknowledgments without feigning from all the nodes in the network, and (3) disclosure of the message authentication key. We estimated the implementation time of the proposed method in ZigBee environment, and as a result, we found that suppressing the implementation time of reliable broadcast is effective in reducing the whole implementation time of the proposed method.

(43) An Application of Digital Document Sanitizing Scheme Suitting to Timestamps for Digital documents.: Ryota SATO (NTT Information Sharing Platform Laboratories NTT Corporation)
Akiko FUJIMURA (NTT Information Sharing Platform Laboratories NTT Corporation)
Koji CHIDA (NTT Information Sharing Platform Laboratories NTT Corporation)
Osamu SHIONOIRI (NTT Information Sharing Platform Laboratories NTT Corporation)
Atsushi KANAI (NTT Information Sharing Platform Laboratories NTT Corporation)
: The present technical and operational measures concerning making, preservation and use of digital documents are required to prepare for the legal of digital documents. We propose that an application of digital sanitizing scheme as one of the technical measures.The digital sanitizing scheme enables us to verify the integrity of partially sanitized document. In this paper, we adjust the requirements for making, preservation and use of digital documents and propose an application of digital sanitizing scheme to meet the requirements for integrity and flexibility demand.

(44) An Implementation Study of a Repeater for Digital Video Multi-points Teleconferencing over FTTH Internet Access Services: Shinji TSUZUKI (Faculty of Engineering Ehime University)
Yoshinori IGUCHI (Faculty of Engineering Ehime University)
Yoshio YAMADA (Faculty of Engineering Ehime University)
: The present technical and operational measures concerning making, preservation and use of digital documents are required to prepare for the legal of digital documents. We propose that an application of digital sanitizing scheme as one of the technical measures.The digital sanitizing scheme enables us to verify the integrity of partially sanitized document. In this paper, we adjust the requirements for making, preservation and use of digital documents and propose an application of digital sanitizing scheme to meet the requirements for integrity and flexibility demand.

(45) Flexible QoS coupling for multi-domain applications: Kousuke Nogami (Internet Systems Research Laboratories NEC Corp.)
Eiji Takahashi (Internet Systems Research Laboratories NEC Corp.)
Kunihiro Taniguchi (Internet Systems Research Laboratories NEC Corp.)
: To provide QoS services across multi-domains, we propose a loosely QoS coupling architecture. In this paper, we explain the architecture consisting of four functions: integration of the difference of QoS semantics of each domain, exchange of QoS information between domains, computing routing tables based on QoS information and construction of overlay network with satisfying required QoS based on routing tables. Leveraging this overlay network, applications can provide users belonging to multi- domains with high-quality services.

(46) A development of communication control method for PAN2PAN realtime streaming: Koji Suzuki
Hiroshi Mineno
Kiyoko Tanaka
Hideharu Suzuki
Ishikawa Norihiro
Tadanori Mizuno
: We believe that the communication using whole links to the Internet within a PAN(Personal Area Network) provides more reliable and higher bit rate than the peer-to-peer communication in mobile computing environment.We call this method PAN2PAN communication.Since there are some paths to the Internet within a PAN in the PAN2PAN communication,traffic distribution mechanism is one of the key issucs to use a real-time streaming application stably.In this paper,we describe a middleware to provide the ability of stable PAN2PAN communication using FEC(Forward Error Correction) and buffering technics.The effect of PAN2PAN communication is evaluated through prototype testbed.

(47) Detection of Network Events based on Digital Filtering: Ding Hui Zhang (Graduate School of Information Sciences Research Institute of Electrical Communication Tohoku University)
Kazuhide Koide (Graduate School of Information Sciences Research Institute of Electrical Communication Tohoku University)
Gen Kitagata (Graduate School of Information Sciences Research Institute of Electrical Communication Tohoku University)
Glenn Mansfield Keeni ((Š”) ƒTƒCƒo[Eƒ\ƒŠƒ…[ƒVƒ‡ƒ“ƒY)
Norio Shiratori (Graduate School of Information Sciences Research Institute of Electrical Communication Tohoku University)
: Network traffic analysis and detection of Event are essential for efficient network administration. The main goal of this research is to provide useful and meaningful information to the network administrator. After a thorough investigation in the field of detecting network Event by digital signal technique, we focus on a method called Deviation Score. Deviation Score takes less time on anomaly detection than any other related methods, such as Statistical method, Markov Models and Neural Networks method. However, there are three problems with Deviation Score, which are (1) inexact detection result, (2) high computational complexity, (3) requirement of manually set threshold. In this research, we propose a new method of Event detection of network traffic, which is exact, real-time and automatic, i.e. no manual intervention is needed. Experiment results show that our proposed method can detect Event with more efficiently than Deviation Score, especially pertaining to the detection exactness point.

(48) Subjects and Solutions on Business Impact Analysis using Common Information Model: Takehiko HOSOKAEA
Nobutane MORI
Masashi TORATO
: Today, the management activity of the enterprise cannot be accomplished without the information system.An unexpected halt of the information system and the decrease in the system quality cause a big adverse effect to the business activity. In this paper, the subjects and the solutions is described to realize business impact analysis using CIM(Common Information Model).

(49) A Study on the Data Management Method for Related Multiple Application Software: Eiji YAMAMOTO (Information Technology R&D Center Mitsubishi Electric Corp.)
Masaru NAGASHIMA (Information Technology R&D Center Mitsubishi Electric Corp.)
Teruaki ITO (Information Technology R&D Center Mitsubishi Electric Corp.)
Naoto MIYAUCHI (Information Technology R&D Center Mitsubishi Electric Corp.)
: In a computer system which is composed of multiple application software, when one software changes data contents, the modified data content might affect to another software's data contents. We investigate the data synchronization methodology among multiple application software.This paper proposes the data management method of the multiple application software which are related each other.

(51) The Development of the Edge Network Management Device By using 1CD Linux: Kenjiro MIURA (Information Technology R&D Center Mitsubishi Electric Corporation)
Atsushi OGIYA (Information Technology R&D Center Mitsubishi Electric Corporation)
Masashi TORATO (Mitsubishi Electric Information Systems Corporation)
: Today, an enterprise IP network becomes more important because the wide variety of applications (SNA, VoIP, video streams and so on) are integrated on it. On the other hand, it becomes more difficult to manage because of its growing complexity. In this paper, we propose the Edge Network Management Device for better network management. It collects the availability and performance information of each client(user) network to the servers. So it's useful for analyzing the extent of a failure impact or warning productivity by response delay. And we have implemented these management functions on CD bootable Linux (KNOPPIX) for deployment cost reduction.

(52) Configuration Management for the Control Network: Masaru Nagashima (Mitsubishi Electric Corp., Information Technology R&D Center)
Teruaki Ito (Mitsubishi Electric Corp., Information Technology R&D Center)
Eiji Yamamoto (Mitsubishi Electric Corp., Information Technology R&D Center)
Naoto Miyauchi (Mitsubishi Electric Corp., Information Technology R&D Center)
: In a field of product manufacturing system, there is demand of wanting to make a flexible production line of a factory. But, in current system,there are various networks with unique address format. Therefore, such a system, this expansion causes the system configurations and operations to complicate from the system integration point of view. We suggested a configuration management to manage various equipments, on hierarchical system with heterogeneous networks, using a network. This technique assigns address information that indicates a position, and makes all equipments with routing function have address information for all equipments. In this paper, we explain the outline of this technique.

(53) An Integrated Security Configuration Analyzing System for Policy-based Security Management: Sumitaka OKAJO (Internet Systems Research Laboratories NEC Corp.)
Katsushi MATSUDA (Internet Systems Research Laboratories NEC Corp.)
Ryuichi OGAWA (Internet Systems Research Laboratories NEC Corp.)
: In order to protect networks against network security threats, many security components with various security functions have been deployed, and the configuration and management of those components are highly complex. Therefore, we need a policy-based security management system to reduce system administrator's load. This paper presents a security configuration analyzing system, which can summarize current configurations and find security policy conflicts among the configurations of cooperated devices. The paper also presents a prototype system, which can find conflicts between firewall and NIDS policies. Advantages of the proposed method to existing techniques are clarified by an experiment.

(54) Design of fault-tolerant distributed real-time processing middleware for signal processing systems: Kazuhiro Murayama (Information Technology R&D Center Mitsubishi Electric Corporation)
Shinichi Ochiai (Information Technology R&D Center Mitsubishi Electric Corporation)
: Recently, real-time processing systems, such as sensor information processing systems, are required to keep high performance computation in case of system failure. To archive this demand, it is needed to reduce down time by finding system failure and recovering systems as quickly as possible. For this reason, we have been developing a fault-tolerant middleware which have three special features about recovery of computing power; (1) migrate CPUs from a low-important process to a high-important process, (2) resume by restoring past data, (3) provide APIs to make applications easy. In this paper, we describe the design of our middleware.

(55) An Efficient Video Delivery Method to Various Terminals: Shuichi Yamaoka (Grad. Sch. of Info. Sci., Nara Institute of Sci. and Tech.)
Tao Sun (Grad. Sch. of Info. Sci., Nara Institute of Sci. and Tech.)
Morihiko Tamai (Grad. Sch. of Info. Sci., Nara Institute of Sci. and Tech.)
Keiichi Yasumoto (Grad. Sch. of Info. Sci., Nara Institute of Sci. and Tech.)
Naoki Shibata (Grad. Sch. of Info. Sci., Nara Institute of Sci. and Tech.)
Minoru Ito (ept. of Info. Proc. and Man., Shiga Univ.)
: In this paper,we propose a new video delivery method called MTcast(Multiple Transcode based video multicast) which achieves efficient simultaneous video delivery to multiple heterogeneous users by relying on user nodes to transcode and forward video to other user nodes.In MTcast,each user specifies a quality requirement for a video consisting of bitrate,picture size and frame rate based on the user`s environmental resource limitation.All users can receive video with specified quality(or near this quality) along a single delivery tree.A different quality requirement can be specified to each video segment.The main characteristics of MTcast are in its scalability,high user satisfaction in received video quality,short startup latency and robustness against node failure.Through experiments,we confirmed that enough performance as an internal node of the delivery tree can be achieved both on a desktop PC and a laptop PC.We also confirmed that deterioration of video quality by repeated transcoding is within permissible range.

(56) Proposal of Service Design Technique to Achieve Service by Component Cooperation on Overlay Network: Yoshitaka Nakamura (Graduate School of Information Science and Technology Osaka University)
Hirozumi Yamaguchi (Graduate School of Information Science and Technology Osaka University)
Akihito Hiromori (Graduate School of Information Science and Technology Osaka University)
Teruo Higashino (Graduate School of Information Science and Technology Osaka University)
: In this paper, we propose a design technique to provide services by collaboration of service components on overlay networks.This technique automatically derives a set of behavior descriptions of service nodes' on overlay networks where service nodes can be connected with each other from a given description of service.The descriptions of service nodes' behavior specifiy how those service nodes collaborate to provide the required service.The allocation of service components to the service nodes is also optimized to achieve well-balanced bandwidth utilization under the constraints of performance on service nodes.The experimental results using a practical example and real network simulator shows the effectiveness of the proposed methodology.

(57) A Proposal of Worm Detection Method Following the Infection Process: Shusuke MAEDA (NTT Data Corporation)
Tatsuya BABA (NTT Data Corporation)
Hisamichi OHTANI (NTT Data Corporation)
Masataka KADO (NTT Data Corporation)
Tsutomu INADA (NTT Data Corporation)
: The network incidents caused by Internet worms are increasing every year. The signature matching method for worm detection is effective only for known-worms, and is not effective for their variants and unknown-worms. Several methods for unknown-worm detection have been proposed. These methods detect worm's typical behaviors. However, such methods generate many false positives. In this paper, we propose an improved worm detection method following the infection process that is necessary for Internet worms to spread.

(58) Improced exception handler for real-time overflow prevention: Ruo Ando (Graduate School of Media and Governance Keio University)
Yoshiyasu Takefuji (Graduate School of Media and Governance Keio University)
: In this In this paper, we introduce a improved exception handler, based on debug and instruction trace technology for real-time malicious process nullification. Proposal system, which is relied on the concept of process debugging is applied for the prevention of buffer overflow, which makes it possible to nullify the infected process without rebuilding the application. Previously, there is no technology that the some kind of control such as stopping for malicious process without recompiling source code. In experiment, it has been validated that the load stress testing of detecting buffer overflow is reasonably low in the proposal system.

(59) Inter AS Traceback Method for Detecting DDoS Attacks: Toshifumi KAI (Matsusita Electric Works, Ltd. Systems Technology Research Laboratory)
Akito NAGASHIMA (Matsusita Electric Works, Ltd. Systems Technology Research Laboratory)
Hiroshige NAKATANI (Matsusita Electric Works, Ltd. Systems Technology Research Laboratory)
Hiroshi SHIMIZU (Matsusita Electric Works, Ltd. Systems Technology Research Laboratory)
Teruaki TAKAHASHI (Kogakuin University Dept. of Computer Engineering)
Ayako SUZUKI (NTT Advanced Technology Corp Core Networks Bussiness Headquarters System Development Unit)
: The amount of damage by illegal access is increasing with the spread of the Internet. Especially the DoS (Denial of Service) and DDoS (Distributed DoS) attacks cause system down and often have serious impacts on the society. Various attacker detection techniques have been proposed until now. We propose inter AS(Autonomous System) traceback method for detecting attackers on large scale network. Performance of this proposed scheme was clarified by some numerical models and experiment.

(60) An Analysis of DNSSEC Transport Overhead Increase: Kenji RIKITAKE (Security Laboratory KDDI R&D Laboratories, Inc.,Graduate School of Information Science and Technology Osaka University)
Hiroki NOGAWA (Information Center for Medical Sciences Tokyo Medical and Dental)
Toshiaki TANAKA (Security Laboratory KDDI R&D Laboratories, Inc.)
Koji NAKAO (Information Security Department KDDI Corporation)
Shinji SHIMOJO (Cybermedia Center Osaka University)
: DNSSEC has been under the redesign process to become a de-facto standard of DNS (Domain Name System) authentication. DNSSEC requires a digital signature to be attached to every RRset (Resource Record set) of the answers, and largely increase the payload length of the UDP transport. In this paper, we analyze the effect of payload-length increase caused by DNSSEC signature and related RRs (Resource Records) by performing a simulation based on the DNSSEC protocol over real-world traffic samples. The simulation results indicate the percentage of payload length of the DNS answers including additional records exceeding the practical limitation of 1232 bytes imposed by IPv6 default MTU (Maximum Transmission Unit) becomes approx. 30% of the samples.

(61) Proposal and implementation of NAT Free Protocol.: Naoki KATO (Graduate School of Science and Technology Meijo University)
Nobushige YANAGISAWA (Graduate School of Science and Technology Meijo University)
Hidekazu SUZUKI (Graduate School of Science and Technology Meijo University)
Akira WATANABE (Graduate School of Science and Technology Meijo University)
: The Internet's spreading, constructing a privately private network, and connecting it with the Internet with two or more terminals are general. However, the address translation device lies between a private network and the Internet, and It is not possible to communicate freely. In this paper, DNS, the terminal, and the address translation device cooperate, and the proposal of NATF(Network Address Translation Free protocol) to solve the problem and the implementation of method are described.

(62) Proposal and its implementation on the communication between terminals in independent private address areas via a global address area: Nobushige YANAGISAWA (Graduate School of Science and Technology Meijo University)
Naoki KATO (Graduate School of Science and Technology Meijo University)
Hidekazu SUZUKI (Graduate School of Science and Technology Meijo University)
Akira WATANABE (Graduate School of Science and Technology Meijo University)
: There are a global address area and a private address area in IPv4 world. It is not possible to communicate freely among them, because NAPT exists on the communication route. NATF (NAT Free Protocol) is a promising protocol to solve the restriction of NAPT. In this paper, a new method that enables the communication between terminals in independent private address areas via a global address area is proposed enhancing the idea of NATF. The implementation method is also described.

(63) A countermeasure against insider with detection of suspicious behavior: Hirokazu Maruoka (Shizuoka University)
Masakatsu Nishigaki (Shizuoka University)
: To avoid threats caused by insiders, many organizations have employed data encryption, access control, and/or recording access log. However, data encryption and access control are not effective against insiders, since insiders who are also registered users have decryption key and access right for the data. Recording access log is useful for tracing the crime, but it cannot detect the crime in real-time. This paper tries to establish a real-time detection of internal fraud by sensing insiders' suspicious behavior.

(64) Implementation of Digital Signature Scheme with MAC against Signing-Key Compromise: Takahiro Matsuzaki (Institute of Industrial Science University of Tokyo)
Kanta Matsuura (Institute of Industrial Science University of Tokyo)
: It is expected that digital signatures will be popular increasingly in the future to achieve a safe electronic society. However,the possibility of signing-key exposure cannot be denied,then the technique to solve the dispute generated by the signature counterfeit is necessary. Digital signature scheme with MAC is the technique that use MAC on the data to be signed as evidence to solve a dispute. However,the signature token is not examined enough. In this paper,we analyze the signature token of digital signature scheme with MAC suitable for implementation,and clarify the conditions that the system should meet when the signature token is defined.

(65) A Proposal of a Usage Control Method that Utilizes a Propagation of Document Attributes: Tomoaki WASHIO (NTT Information Sharing Platform Laboratories NTT Corporation)
Yukiko YOSUKE (NTT Information Sharing Platform Laboratories NTT Corporation)
Yoshihito OSHIMA (NTT Information Sharing Platform Laboratories NTT Corporation)
Atsushi KANAI (NTT Information Sharing Platform Laboratories NTT Corporation)
: As the leakage of the classified information becomes serious, a lot of enterprises have strengthened the measures to prevent the leakage. To prevent mainly the leakage by person in the enterprise (e.g. employees) which is one of the typical cases of the information leakage , usage control mechanisms which control the document operation on the user terminal are examined and adopted. By adoption of such mechanisms, however, the right business operations might be obstructed or its efficiency might decrease. In this paper, a usage control method is proposed which utilizes a propagation of document attributes. The method achieves both the prevention of the information leakage and the operation of documents with conventional convenience.

(66) Conflict Resolution of the Security Policy by Functional Mapping: Katsushi MATSUDA (Internet Systems Research Laboratories NEC Corp.)
Sumitaka OKAJO (Internet Systems Research Laboratories NEC Corp.)
Ryuichi OGAWA (Internet Systems Research Laboratories NEC Corp.)
: Security management with a security policy sometimes do not work, because there is a great difference between the security policy and the topology or usage manners of the network system to which the policy will be applied. In this paper, we describe a method that discovers inconsistencies in the policy by comparing a fragment of the policy with a component of the network system and supports to amend the policy into an exact one. The method can detect two kinds of inconsistencies, namely, a syntactic inconsistency caused by the mapped form of a policy and a topology and a semantic inconsistency caused by the operating knowledge in the security field.

[home]