• Title/Summary/Keyword: Internet Based Laboratory

Search Result 491, Processing Time 0.024 seconds

Fingerprint Template Protection Using One-Time Fuzzy Vault

  • Choi, Woo-Yong;Chung, Yong-Wha;Park, Jin-Won;Hong, Do-Won
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.2221-2234
    • /
    • 2011
  • The fuzzy vault scheme has emerged as a promising solution to user privacy and fingerprint template security problems. Recently, however, the fuzzy vault scheme has been shown to be susceptible to a correlation attack. This paper proposes a novel scheme for one-time templates for fingerprint authentication based on the fuzzy vault scheme. As in one-time passwords, the suggested method changes templates after each completion of authentication, and thus the compromised templates cannot be reused. Furthermore, a huge number of chaff minutiae can be added by expanding the size of the fingerprint image. Therefore, the proposed method can protect a user's fingerprint minutiae against the correlation attack. In our experiments, the proposed approach can improve the security level of a typical approach against brute-force attack by the factor of $10^{34}$.

Secret Key Generation from Common Randomness over Ultra-wideband Wireless Channels

  • Huang, Jing Jing;Jiang, Ting
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.10
    • /
    • pp.3557-3571
    • /
    • 2014
  • We develop a secret key generation scheme using phase estimation in ultra-wideband (UWB) wireless fading channels. Based on the reciprocity theorem, two terminals extract the phase of the channel as a common random source to generate secret bits. Moreover, we study the secret key rate by a pair of nodes observing correlated sources and communicating to achieve secret key agreement over public communication channels. As our main results, we establish a more practical upper bound from Cramer-Rao bound (CRB) and compare it with a universally theoretical upper bound on the shared maximum key rate from mutual information of correlated random sources. Derivation and numerical examples are presented to demonstrate the bound. Simulation studies are also provided to validate feasibility and efficiency of the proposed scheme.

Near-infrared face recognition by fusion of E-GV-LBP and FKNN

  • Li, Weisheng;Wang, Lidou
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.208-223
    • /
    • 2015
  • To solve the problem of face recognition with complex changes and further improve the efficiency, a new near-infrared face recognition algorithm which fuses E-GV-LBP and FKNN algorithm is proposed. Firstly, it transforms near infrared face image by Gabor wavelet. Then, it extracts LBP coding feature that contains space, scale and direction information. Finally, this paper introduces an improved FKNN algorithm which is based on spatial domain. The proposed approach has brought face recognition more quickly and accurately. The experiment results show that the new algorithm has improved the recognition accuracy and computing time under the near-infrared light and other complex changes. In addition, this method can be used for face recognition under visible light as well.

Towards a Server-Centric Interaction Architecture for Wireless Applications

  • Saarinen, Jussi;Mikkonen, Tommi;Tarkoma, Sasu;Heikkinen, Jani;Pitkanen, Risto
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.2 no.2
    • /
    • pp.103-119
    • /
    • 2008
  • Traditional web-based services that require users to browse via documents and fill out forms, are difficult to use with mobile devices. Moreover, as the web paradigm assumes active clients, further complications are introduced in cases where the server is the active entity, instead of the client. This paper presents a Server-Centric Interaction Architecture (SCIA) for wireless applications. The architecture enables servers to initiate communication with clients as well as push secure targeted data to them, in a piecemeal fashion. It further enables the development of highly collaborative wireless services with interactive user interfaces.

Distributed Resource Partitioning Scheme for Intercell Interference in Multicellular Networks

  • Song, Jae-Su;Lee, Seung-Hwan
    • Journal of electromagnetic engineering and science
    • /
    • v.15 no.1
    • /
    • pp.14-19
    • /
    • 2015
  • In multicellular wireless networks, intercell interference limits system performance, especially cell edge user performance. One promising approach to solve this problem is the intercell interference coordination (ICIC) scheme. In this paper, we propose a new ICIC scheme based on a resource partitioning approach to enhance cell edge user performance in a wireless multicellular system. The most important feature of the proposed scheme is that the algorithm is performed at each base station in a distributed manner and therefore minimizes the required information exchange between neighboring base stations. The proposed scheme has benefits in a practical environment where the traffic load distribution is not uniform among base stations and the backhaul capacity between the base stations is limited.

Group Key Agreement From Signcryption

  • Lv, Xixiang;Li, Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.12
    • /
    • pp.3338-3351
    • /
    • 2012
  • There is an intuitive connection between signcryption and key agreement. Such a connector may lead to a novel way to construct authenticated and efficient group key agreement protocols. In this paper, we present a primary approach for constructing an authenticated group key agreement protocol from signcryption. This approach introduces desired properties to group key agreement. What this means is that the signcryption gives assurance to a sender that the key is available only to the recipient, and assurance to the recipient that the key indeed comes from the sender. Following the generic construction, we instantiate a distributed two-round group key agreement protocol based on signcryption scheme given by Dent [8]. We also show that this concrete protocol is secure in the outsider unforgeability notion and the outsider confidentiality notion assuming hardness of the Gap Diffie-Hellman problem.

Energy harvesting from conducted electromagnetic interference of fluorescent light for Internet of Things application

  • Hyoung, Chang-Hee;Hwang, Jung-Hwan
    • ETRI Journal
    • /
    • v.44 no.5
    • /
    • pp.759-768
    • /
    • 2022
  • A novel energy harvesting technique that uses conducted electromagnetic interference as an energy source is presented. Conducted EMI generated from fluorescent light using a switched-mode power supply was measured and modeled as an equivalent voltage source. Two types of rectifier circuits-a bridge rectifier and a voltage doubler-were used as the harvesting devices for conducted EMI source. The matching networks were designed based on the equivalent model, and the harvested power was improved. The implemented energy harvester produces a regulated power over 68.9 mW and current over 15.1 mA while a regulated voltage can be selected between 3.3 V and 5 V. The proposed system shows the highest harvesting power indoor environment and can provide enough power for the Internet of Things devices.

Providing survivability for virtual networks against substrate network failure

  • Wang, Ying;Chen, Qingyun;Li, Wenjing;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4023-4043
    • /
    • 2016
  • Network virtualization has been regarded as a core attribute of the Future Internet. In a network virtualization environment (NVE), multiple heterogeneous virtual networks can coexist on a shared substrate network. Thus, a substrate network failure may affect multiple virtual networks. In this case, it is increasingly critical to provide survivability for the virtual networks against the substrate network failures. Previous research focused on mechanisms that ensure the resilience of the virtual network. However, the resource efficiency is still important to make the mapping scheme practical. In this paper, we study the survivable virtual network embedding mechanisms against substrate link and node failure from the perspective of improving the resource efficiency. For substrate link survivability, we propose a load-balancing and re-configuration strategy to improve the acceptance ratio and bandwidth utilization ratio. For substrate node survivability, we develop a minimum cost heuristic based on a divided network model and a backup resource cost model, which can both satisfy the location constraints of virtual node and increase the sharing degree of the backup resources. Simulations are conducted to evaluate the performance of the solutions. The proposed load balancing and re-configuration strategy for substrate link survivability outperforms other approaches in terms of acceptance ratio and bandwidth utilization ratio. And the proposed minimum cost heuristic for substrate node survivability gets a good performance in term of acceptance ratio.

Stochastic Optimization of Multipath TCP for Energy Minimization and Network Stability over Heterogeneous Wireless Network

  • Arain, Zulfiqar Arain;Qiu, Xuesong;Zhong, Lujie;Wang, Mu;Chen, Xingyan;Xiong, Yongping;Nahida, Kiran;Xu, Changqiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.1
    • /
    • pp.195-215
    • /
    • 2021
  • Multipath Transport Control Protocol (MPTCP) is a transport layer protocol that enables multiple TCP connections across various paths. Due to path heterogeneity, it incurs more energy in a multipath wireless network. Recent work presents a set of approaches described in the literature to support systems for energy consumption in terms of their performance, objectives and address issues based on their design goals. The existing solutions mainly focused on the primary system model but did not discourse the overall system performance. Therefore, this paper capitalized a novel stochastically multipath scheduling scheme for data and path capacity variations. The scheduling problem formulated over MPTCP as a stochastic optimization, whose objective is to maximize the average throughput, avoid network congestion, and makes the system more stable with greater energy efficiency. To design an online algorithm that solves the formulated problem over the time slots by considering its mindrift-plus penalty form. The proposed solution was examined under extensive simulations to evaluate the anticipated stochastic optimized MPTCP (so-MPTCP) outcome and compared it with the base MPTCP and the energy-efficient MPTCP (eMPTCP) protocols. Simulation results justify the proposed algorithm's credibility by achieving remarkable improvements, higher throughput, reduced energy costs, and lower-end to end delay.

Implementation of an Integrated Messaging Gateway Based on OSGi

  • Kang, Kyu-Chang;Kang, Dong-Oh;Lee, Hyung-Jik
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.296-299
    • /
    • 2003
  • This paper presents the implementation of an integrated messaging gateway (IMG) based on the open services gateway initiative (OSGi) specification to deliver home messages between home and some telecommunication devices. The IMG has four service agents to support a diverse communication channel. In this paper, we describe a software architecture for a seamless messaging and device layouts in the IMG. And then, we detail each components allowing users to be notified automatically through a cellular phone, a telephone, and the Internet.

  • PDF