By Topic

Information Science and Security, 2008. ICISS. International Conference on

Date 10-12 Jan. 2008

Filter Results

Displaying Results 1 - 25 of 46
  • 2008 International Conference on Information Science and Security - Cover

    Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (278 KB)  
    Freely Available from IEEE
  • 2008 International Conference on Information Science and Security - Title

    Page(s): i - iii
    Save to Project icon | Request Permissions | PDF file iconPDF (100 KB)  
    Freely Available from IEEE
  • 2008 International Conference on Information Science and Security - Copyright

    Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (44 KB)  
    Freely Available from IEEE
  • 2008 International Conference on Information Science and Security - TOC

    Page(s): v - vii
    Save to Project icon | Request Permissions | PDF file iconPDF (163 KB)  
    Freely Available from IEEE
  • Foreword

    Page(s): viii
    Save to Project icon | Request Permissions | PDF file iconPDF (134 KB)  
    Freely Available from IEEE
  • Committees

    Page(s): ix - xi
    Save to Project icon | Request Permissions | PDF file iconPDF (138 KB)  
    Freely Available from IEEE
  • Access Scheduling on the Control Channels in TDMA Wireless Mesh Networks

    Page(s): 3 - 12
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (134 KB) |  | HTML iconHTML  

    The access scheduling on the control channels in TDMA wireless mesh networks is studied in this paper. The problem is to assign time-slots for each node in the network to access the control channels so that it is guaranteed that each node can broadcast the control packet to any one-hop neighbor in one scheduling cycle. The objective is to minimize the total number of different time-slots in the scheduling cycle. The original contributions of this paper are that it has taken the large interference range problem into consideration for the first time and proposed two algorithms for the scheduling problem, namely, the speak once algorithm and the speak separately algorithm. We prove that the number of time-slots by the second algorithm is upper-bounded by min(n, 2K) in some special cases, where n is the node number and K is the maximum node degree. The fully distributed versions of these algorithms are given in this paper. Simulation results also show that the performance of the speak separately algorithm is rather better than that of the speak once algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hybrid Particle Swarm Optimization Approach for Scheduling Flow-Shops with Multiprocessor Tasks

    Page(s): 13 - 16
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (310 KB) |  | HTML iconHTML  

    Particle swarm optimization (PSO) technique is employed in many optimization and search problems due to its simplicity and ability to tackle these problems successfully. This paper shows application of PSO in scheduling hybrid flow-shops with multiprocessor tasks. This scheduling problem is often encountered in computing and industrial applications. In order to improve the performance of PSO, hybrid techniques were also employed. A comparative performance study is reported. It is observed that PSO and hybrid methods have merits in solving multiprocessor task scheduling in hybrid flow-shop environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dangers of Applying Web 2.0 Technologies in E-commerce Solutions

    Page(s): 17 - 25
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (532 KB) |  | HTML iconHTML  

    Nowadays the E-commerce concept got widespread wide spread occurrence, today it is not only Web stores, but also various kinds of informational services and advertisement turnover. By growing of varieties sites competition grows too and Web technologies, that allows broadening functionality of Web applications and becoming more attractive, are evolve too. Now Web 2.0 concept is on everybody lips, this is new philosophy of Internet applications and new Web technologies, which brings new profits inside as well as new dangers. Within the Web 2.0 integration the vector of malicious attacks has been changed from Web servers and their systems to the end user. In this report concept of E-commerce and Web 2.0 also main threats, appeared by reason of distribution of new technologies, and some security approaches against them are considered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strategic Approach to Information Security in Organizations

    Page(s): 26 - 31
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (77 KB) |  | HTML iconHTML  

    This paper is about the strategy for organizational information security. Strategy has been argued important however got little highlight comparing to other fields in information security, even from academia. We formed concept of information security strategy in organizations, developed classification framework for them, and identified important factors influencing their effective implementation in organizations. We believe that this is a new attempt to understand information security strategy and form a theoretical background in academia. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm to Cluster Orthologous Proteins across Multiple Genomes

    Page(s): 32 - 37
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (923 KB) |  | HTML iconHTML  

    In GOLD (genomes online database), the re It has been a successful technique, for researches on genome evolution and for functional annotation of newly sequenced genomes, to construct an OPCs(orthologous protein clusters) with the best reciprocal BLAST hits from multiple complete-genomes. It, however, needs time-labor processes to make the OPCs by hand and biological analysis. In order to reduce the load, we propose an automatic parallel computing method that clusters OPs(orthologous proteins) from multiple complete-genomes. For systematic representation of clustering OPs, a mathematical frame of a vector is suggested. The algorithm starts, on the hypercube model, with parallelism of clustering pairwise genomes(CPG) and parallelizes all the processes of clustering multiple genomes(CMG). In CPG, all pairwise- comparisons are divided into sub-pairwise- comparisons, and the local results of clustering OPs between two genomes are integrated and broadcast to each processor. In CMG, all the clustering-processes are split into sub- clustering-processes, and the local results of OPCs among multiple genomes are broadcast to each processor and integrated in it. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • User-Oriented Batch Processing of Individual Rekeying

    Page(s): 38 - 43
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1937 KB) |  | HTML iconHTML  

    For a long time multicast security researches have been going on. In multicast security the group key must be changed whenever users join or leave. We called it 'rekeying'. There are so far two main schemes of rekeying. One is individual rekeying and the other is periodic rekeying. However the two schemes have so serious weakness in some environment that they might not be suitable for scalable and efficient multicast security service. So this paper describes what the problems are in the legacy both schemes and in actual world, and suggests the solution, the user-oriented batch processing of individual rekeying, for security and efficiency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel Approach to Search a Node in MANET

    Page(s): 44 - 48
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (361 KB) |  | HTML iconHTML  

    Traditional sensor network environment have making the group and optimization method between nodes. But it is a not enough in MANET environment that consists of many wireless devices and various wired or wireless protocols. So, we propose a Novel Approach to Search a node in MANET based on TORA. We show our proposed scheme's architecture and algorithm. Our proposed scheme shows more efficient to search a middle node. But we have a more research that how can make experiment result to more easy and verify the result in various simulate environments.. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Efficiency Elevation Method of IT Security System Evaluation via Process Improvement

    Page(s): 49 - 57
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (88 KB) |  | HTML iconHTML  

    As IT industries grow rapidly, many kinds of problems refuted to information security have gained force. (Demands for information security products such as firewall, Intrusion (Detection System have grown and the reliability and the safety of information security products is gathering strength. The evaluation for information security products is putting in operation, but developers have a difficulty in timely presenting their products due to long time for the evaluation. In this paper, we suggest the efficient elevation method for information security product by improving the development process in order to meet the assurance requirements of the Common Criteria. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Restricted Path Flooding Scheme in Distributed P2P Overlay Networks

    Page(s): 58 - 61
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (751 KB) |  | HTML iconHTML  

    In P2P overlay network, peers are able to directly share and exchange information without the help of a server. This results in a prompt and secure sharing of network resources and data handling. However, flooding algorithm that is used in distributed P2P network generated query message excessively. Our objective in this paper is to proposes a presents a restricted path flooding algorithm that can decrease query message's occurrence to solve P2P network's problems. It includes concepts as well as systematic procedures of the proposed scheme for fast path flooding in distributed P2P overlay networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Design and Implementation of Flash Cryptographic File System Based on YAFFS

    Page(s): 62 - 65
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (273 KB) |  | HTML iconHTML  

    As the amount of flash memory being used in embedded device is increased and embedded devices become more important in many computing environments, embedded file system security becomes more important issue. Moreover embedded devices can be easily stolen or lost because of its high portability. If the lost embedded device has very important information, there's no means to protect it except data encryption. For improving embedded devices' security this paper propose design and implementation of flash cryptographic file system. For this purpose YAFFS is used. By the modified YAFFS cryptographic file system, the security of embedded devices can be improved. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Enhanced Next Hop Selection Scheme for Ad Hoc Wireless Networks

    Page(s): 66 - 71
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (449 KB) |  | HTML iconHTML  

    In ad hoc wireless network, the position-based routing scheme has been proposed for the purpose of reducing control signaling overhead in networks and establishing the shortest, multi-hop routing path. In spite of several benefits, however, there are still some problems such as connectivity, reliability and security in the process of route discovery. In this paper, we propose an enhanced next hop selection scheme to guarantee connectivity between intermediate nodes selected as next hop with the shortest, multi-hop path. In proposed scheme, we adopt a limited sending node's transmission range defined by Rc, alpha parameters to reduce the number of signaling packet and guarantee connectivity between two network nodes interconnected making up multi-hop routing path. Also, dc dwi parameters are suggested to select next hop making shortest path considering both sender and destination's aspect. Then, to support security, the safety table is newly defined by adding a specific subfield to a routing cache to identify the misbehaving nodes. To estimate the performance of the proposed scheme, we provide several simulation results comparing with exiting ones in terms of packet delivery ratio, end-to-end delay, and routing overhead. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-Stage Intrusion Detection System Using Hidden Markov Model Algorithm

    Page(s): 72 - 77
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (292 KB) |  | HTML iconHTML  

    Intrusion detection systems are the basis of system protection from network attacks. However, intrusions are increasingly taking multi-stage procedures to attack a system, and cannot be detected by existing single stage intrusion detection systems. This paper proposes a multi-stage intrusion detection system architecture using hidden Markov model algorithm. This system considers every stage used by recent intrusions and applies them to the hidden Markov model algorithm to determine which intrusion is used in the audit data. This architecture reduces overheads of intrusion agents and raises efficiency of the whole system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New BESA Algorithm Development and Design for Network Security in Multimedia Communication

    Page(s): 78 - 83
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (375 KB) |  | HTML iconHTML  

    New BESA cryptographic algorithm is suitable network environment and wire/wireless communication network, on implement easy, security rate preservation, scalable and reconfigurable. Though proposed algorithm strengthens security vulnerability of TCP/IP protocol and keep security about many user as that have authentication function in network environment, there is important purpose. So that new BESA cryptographic algorithm implemented by hardware base cryptosystem and en/decryption is achieved at the same time, composed architecture. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cryptanalysis on Improved Chou et al.'s ID-Based Deniable Authentication Protocol

    Page(s): 87 - 93
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (265 KB) |  | HTML iconHTML  

    A deniable authentication protocol enables the protocol participants to authenticate their respective peers, while able to deny their participation after the protocol execution. This protocol can be extremely useful in some practical applications such as online negotiation, online shopping and electronic voting. Recently, we have improved a deniable authentication scheme proposed by Chou et al. due to its vulnerability to the key compromise impersonation attack in our previous report. However, we have later discovered that our previous enhanced protocol is vulnerable to the insider key compromise impersonation attack and key replicating attack. In this paper, we will again secure this protocol against these attacks and demonstrate its heuristic security analysis. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Agent Based Dynamic Adaptation of Intelligent Robots Using Enterprise Service Bus

    Page(s): 94 - 97
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1404 KB) |  | HTML iconHTML  

    Intelligent robots get data of the current situation from sensors and perform knowledgeable services. Intelligent robots must dynamically collaborate with environment, discover new services and reconfigure themselves by using the services for unforeseen situation. Therefore, dynamic adaptation is prerequisite for intelligent robots. In this paper, we propose an agent based dynamic adaptation framework of intelligent robots using enterprise service bus. Agent technology provides an intelligent approach for collaboration between robots. This framework focuses on dynamic discovery and reconfiguration of service-oriented applications using multi-agent system in intelligent robots. A prototype is provided to show the validity of this framework. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Surface Approximation Based on Two Types of Geometric Features

    Page(s): 98 - 101
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1103 KB) |  | HTML iconHTML  

    The complex models, in 3D computer graphics, can provide a convincing level of realism but rather cause problems in real-time applications focusing on real-time interactivity. Therefore, it is useful to have various simplified versions of the model according to the performance of the system. In this paper, we present a surface approximation algorithm based on two types of geometric features, which can excellently preserve the characteristic features of the original model, even after drastic simplification process. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accelerating Symmetric and Asymmetric Ciphers with Register File Extension for Multi-word and Long-word Operation

    Page(s): 102 - 107
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (401 KB) |  | HTML iconHTML  

    In this paper, we propose a new register file architecture called the register file extension for multi-word and long-word operation (RFEMLO) to accelerate both symmetric and asymmetric cryptographic algorithms. Based on the idea that most of cryptographic algorithms heavily use multi-word or long-word operations, RFEMLO allows multiple contiguous registers to be specified as a single operand. RFEMLO can be applied to a general purpose processor by providing an instruction set extension and an additional functional unit. To evaluate the performance of RFEMLO, we use Simplescalar/ARM 3.0 (with gcc 2.95.2) and run detailed simulations on various cryptographic algorithms. The simulation results show that we could achieve 83% and 138% performance gain in both symmetric and asymmetric ciphers by applying RFEMLO to a conventional superscalar processor. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • EMCEM: An Efficient Multimedia Content Encryption Scheme for Mobile Handheld Devices

    Page(s): 108 - 114
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (253 KB) |  | HTML iconHTML  

    Since many people consume multimedia content (music, movie etc.) on mobile devices, mobile DRM becomes important, which controls digital content usage under wireless environment. In a typical DRM model, a block cipher is usually used to encrypt multimedia content because of its reasonable security and performance. However, encrypting multimedia content using a block cipher in mobile environment requires much computation power and energy due to its huge size. It is critical problems because users want long playtime and quick responsiveness with random access. In this paper, we propose an efficient multimedia content encryption scheme for mobile handheld devices (EMCEM), which uses a block cipher to encrypt some parts of content and a stream cipher to encrypt the others. We also use different stream cipher key to improve security. EMCEM accommodates the current DRM architecture, supports random access to a media file, and has flexibility to determine easily the trade-off between performance and security. Experimental results have shown that EMCEM has much better performance than encrypting content completely using a block cipher. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sensor Based Hybrid Managing Mechanism for Context-aware Service Compatibility

    Page(s): 115 - 120
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (593 KB) |  | HTML iconHTML  

    It is expected that the intelligent management system will be able to provide intelligent building services based on context-awareness mechanism, which consists of a sensor platform, a context-aware framework and an intelligent agent. The sensor platform collects raw data and sends them to a context-aware framework which perceives the residents and a building's context. The intelligent agent triggers an automatic services according to the information based on the sensed situation of the context-aware framework. We designed and implemented the intelligent visitor care system based on this context-awareness technology, which minimizes residents' interventions and maximizes functionality autonomy of systems. Also we suggested system architecture and the flows for the proposed system. In this article we discuss interaction issue about conflict and interference between various context information and service in the building environment. Context information conflict arises when deciding service through various sensing information. Service interaction generated when a service is applied to different controls at the same time, for same device. Also we proposed a model to implement the sensing information management (SIM) module which can gather and optimized information through interaction within sensed information and adapts it's to the context-aware services. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.