Browsing by Author "Yeh, Lo-Yao"

Now showing 1 - 13 of 13

A Batch-Authenticated and Key Agreement Framework for P2P-Based Online Social Networks
(2012-05-01)
Yeh, Lo-Yao
;
Huang, Yu-Lun
;
Joseph, Anthony D.
;
Shieh, Shiuhpyng Winston
;
Tsaur, Woei-Jiunn
Online social networks (OSNs) such as Facebook and MySpace are flourishing because more and more people are using OSNs to share their interests with friends. Because security and privacy issues on OSNs are major concerns, we propose a security framework for simultaneously authenticating multiple users to improve the efficiency and security of peer-to-peer (P2P)-based OSNs. In the proposed framework, three batch authentication protocols are proposed, adopting the one-way hash function, ElGamal proxy encryption, and certificates as the underlying cryptosystems. The hash-based authentication protocol requires lower computational cost and is suitable for resource-limited devices. The proxy-based protocol is based on asymmetric encryption and can be used to exchange more information among users. The certificate-based protocol guarantees nonrepudiation of transactions by signatures. Without a centralized authentication server, the proposed framework can therefore facilitate the extension of an OSN with batched verifications. In this paper, we formally prove that the proposed batch authentication protocols are secure against both passive adversaries and impersonator attacks, can offer implicit key authentication, and require fewer messages to authenticate multiple users. We also show that our protocols can meet important security requirements, including mutual authentication, reputation, community authenticity, nonrepudiation, and flexibility. With these effective security features, our framework is appropriate for use in P2P-based OSNs.
A Conditional Access System with Efficient Key Distribution and Revocation for Mobile Pay-TV Systems
(2013-06-01)
Yeh, Lo-Yao
;
Huang, Jiun-Long
;
資訊工程學系
;
Department of Computer Science
Current mobile pay-TV systems have two types of Conditional Access Systems (CAS): group-key-based and public-key systems. The best feature of group-key-based systems is the ability to enjoy the broadcast nature in delivery multimedia contents, while the major advantage of public-key systems is consolidating the security foundation to withstand various attacks, such as collusion attacks. However, the problems of group-key-based systems include collusion attacks, lack of nonrepudiation, and troublesome key distribution. Even worse, the benefit of broadcast efficiency is confined to a group size of no more than 512 subscribers. For public-key systems, the poor delivery scalability is the major shortcoming because the unique private key feature is only suitable for one-to-one delivery. In this article, we introduce a scalable access control scheme to integrate the merits of broadcasting regardless of group size and sound security assurance, including fine-grained access control and collusion attack resistance. For subscriber revocation, a single message is broadcast to the other subscribers to get the updated key, thus significantly boosting subscriber revocation scalability. Due to mobile subscribers' dynamic movements, this article also analyzes the benefit of retransmission cases in our system. Through the performance evaluation and functionality comparison, the proposed scheme should be a decent candidate to enhance the security strength and transmission efficiency in a mobile pay-TV system.
A practical authentication protocol with anonymity for wireless access networks
(2011-10-01)
Chen, Yen-Cheng
;
Chuang, Shu-Chuan
;
Yeh, Lo-Yao
;
Huang, Jiun-Long
;
資訊工程學系
The use of anonymous channel tickets was proposed for authentication in wireless environments to provide user anonymity and to probably reduce the overhead of re-authentications. Recently, Yang et al. proposed a secure and efficient authentication protocol for anonymous channel in wireless systems without employing asymmetric cryptosystems. In this paper, we will show that Yang et al.'s scheme is vulnerable to guessing attacks performed by malicious visited networks, which can easily obtain the secret keys of the users. We propose a new practical authentication scheme not only reserving the merits of Yang et al.'s scheme, but also extending some additional merits including: no verification table in the home network, free of time synchronization between mobile stations and visited networks, and without obsolete anonymous tickets left in visited networks. The proposed scheme is developed based on a secure one-way hash function and simple operations, a feature which is extremely fit for mobile devices. We provide the soundness of the authentication protocol by using VO logic. Copyright (C) 2010 John Wiley & Sons, Ltd.
ABACS: An Attribute-Based Access Control System for Emergency Services over Vehicular Ad Hoc Networks
(2011-03-01)
Yeh, Lo-Yao
;
Chen, Yen-Cheng
;
Huang, Jiun-Long
;
資訊工程學系
;
Department of Computer Science
In this paper, we propose an Attribute-Based Access Control System (ABACS) for emergency services with security assurance over Vehicular Ad Hoc Networks (VANETs). ABACS aims to improve the efficiency of rescues mobilized via emergency communications over VANETs. By adopting fuzzy identity-based encryption, ABACS can select the emergency vehicles that can most appropriately deal with an emergency and securely delegate the authority to control traffic facilities to the assigned emergency vehicles. Using novel cryptographic preliminaries, ABACS realizes confidentiality of messages, prevention of collusion attacks, and fine-grained access control. As compared to the current PKI scheme, the computational delay and transmission overhead can be reduced by exploiting the advantages afforded by message broadcasting, which is heavily used in ABACS. The performance evaluation demonstrates that ABACS is a suitable candidate for realizing emergency services via VANETs.
ABAKA: An Anonymous Batch Authenticated and Key Agreement Scheme for Value-Added Services in Vehicular Ad Hoc Networks
(2011-01-01)
Huang, Jiun-Long
;
Yeh, Lo-Yao
;
Chien, Hung-Yu
;
資訊工程學系
;
Department of Computer Science
In this paper, we introduce an anonymous batch authenticated and key agreement (ABAKA) scheme to authenticate multiple requests sent from different vehicles and establish different session keys for different vehicles at the same time. In vehicular ad hoc networks (VANETs), the speed of a vehicle is changed from 10 to 40 m/s (36-144 km/h); therefore, the need for efficient authentication is inevitable. Compared with the current key agreement scheme, ABAKA can efficiently authenticate multiple requests by one verification operation and negotiate a session key with each vehicle by one broadcast message. Elliptic curve cryptography is adopted to reduce the verification delay and transmission overhead. The security of ABAKA is based on the elliptic curve discrete logarithm problem, which is an unsolved NP-complete problem. To deal with the invalid request problem, which may cause the batch verification fail, a detection algorithm has been proposed. Moreover, we demonstrate the efficiency merits of ABAKA through performance evaluations in terms of verification delay, transmission overhead, and cost for rebatch verifications, respectively. Simulation results show that both the message delay and message loss rate of ABAKA are less than that of the existing elliptic curve digital signature algorithm (ECDSA)-based scheme.
ALM: An adaptive location management scheme for approximate location queries in wireless sensor networks
(2010-10-15)
Yeh, Lo-Yao
;
Huang, Chen-Che
;
Wu, Cheng-En
;
Huang, Jiun-Long
;
資訊工程學系
Location management is an important issue for object tracking applications of wireless sensor networks. Since locations obtained by most positioning techniques are inherently imprecise, users may send approximate location queries with precision constraints to trade for energy consumption of sensor nodes. Therefore, we propose an Adaptive Location Management scheme called ALM to process approximate location queries. ALM employs a two-tier storage architecture (i.e., centric storage node and local storage node) to facilitate approximate query resolving and to reduce the energy consumption of sensor nodes. We propose a storage node relocation and replication mechanism, which can create, remove replicas of storage nodes and adjust the positions of storage nodes according to the location queries and updates. As such, the number of forwarding location update and query messages is reduced by the proposed storage node relocation and replication mechanism, thereby conserving more energy. The experimental results show that compared with EASE (Xu et al. (2008) [18]), ALM is able to reduce the number of transmission messages and the energy consumption of sensor network, and prolong the network lifetime. (C) 2010 Elsevier B.V. All rights reserved.
ALM: An adaptive location management scheme for approximate location queries in wireless sensor networks
(2010-10-15)
Yeh, Lo-Yao
;
Huang, Chen-Che
;
Wu, Cheng-En
;
Huang, Jiun-Long
;
資訊工程學系
Location management is an important issue for object tracking applications of wireless sensor networks. Since locations obtained by most positioning techniques are inherently imprecise, users may send approximate location queries with precision constraints to trade for energy consumption of sensor nodes. Therefore, we propose an Adaptive Location Management scheme called ALM to process approximate location queries. ALM employs a two-tier storage architecture (i.e., centric storage node and local storage node) to facilitate approximate query resolving and to reduce the energy consumption of sensor nodes. We propose a storage node relocation and replication mechanism, which can create, remove replicas of storage nodes and adjust the positions of storage nodes according to the location queries and updates. As such, the number of forwarding location update and query messages is reduced by the proposed storage node relocation and replication mechanism, thereby conserving more energy. The experimental results show that compared with EASE (Xu et al. (2008) [18]), ALM is able to reduce the number of transmission messages and the energy consumption of sensor network, and prolong the network lifetime. (C) 2010 Elsevier B.V. All rights reserved.
An Privacy-preserving Cross-organizational Authentication/Authorization/Accounting System using Blockchain Technology
(2018-01-01)
Lu, Peggy Joy
;
Yeh, Lo-Yao
;
Huang, Jiun-Long
;
交大名義發表
;
資訊工程學系
Thanks to the growth of cloud computing and network technology, different organizations might want to share data and resources between each other. However, cross-organizational authentication systems usually need a central control system, which must be fully trusted. Thus, we use blockchain technology to store the access control list of users due to its tamper-proof and decentralized feature. Our system also provides authentication/authorization/accounting functions by using a virtual coin exe_coin to achieve accounting function. The method of one-way hash chain is used to securely adapt to the transparency feature of blockchain. In authentication system, the transparency may lead to the linkability problem. In our scheme, attackers cannot get the linkability between the transactions and the particular user. To the best of our knowledge, our scheme is the first blockchain-based authentication system with the merits of unlinkability and accounting.
Cloud-Based Fine-Grained Health Information Access Control Framework for Lightweight IoT Devices with Dynamic Auditing and Attribute Revocation
(2018-04-01)
Yeh, Lo-Yao
;
Chiang, Pei-Yu
;
Tsai, Yi-Lang
;
Huang, Jiun-Long
;
資訊工程學系
The eHealth trend has spread globally. Internet of Things (IoT) devices for medical service and pervasive Personal Health Information (PHI) systems play important roles in the eHealth environment. A cloud-based PHI system appears promising but raises privacy and information security concerns. We propose a cloud-based fine-grained health information access control framework for lightweight IoT devices with data dynamics auditing and attribute revocation functions. Only symmetric cryptography is required for IoT devices, such as wireless body sensors. A variant of ciphertext-policy attribute-based encryption, dual encryption, and Merkle hash trees are used to support fine-grained access control, efficient dynamic data auditing, batch auditing, and attribute revocation. Moreover, the proposed scheme also defines and handles the cloud reciprocity problem wherein cloud service providers can help each other avoid fines resulting from data loss. Security analysis and performance comparisons show that the proposed scheme is an excellent candidate for a cloud-based PHI system.
Hierarchical role-based data dissemination in wireless sensor networks
(2013-10-01)
Huang, Chen-Che
;
Huang, Tsun-Tse
;
Huang, Jiun-Long
;
Yeh, Lo-Yao
;
資訊工程學系
Data dissemination from multiple sources to mobile sinks is fundamental and challenging in WSN applications due to limited energy supply of sensor nodes and sink mobility. Previous data dissemination protocols either rely on an energy-consuming coordinate system or build an inefficient backbone. In this paper, we propose a hierarchical role-based data dissemination (HRDD) protocol in wireless sensor networks. In HRDD, a small number of sensor nodes are assigned to serve as cluster heads and agents to form the data dissemination backbone and mitigate unnecessary query forwarding. In addition, HRDD designs an efficient data delivery mechanism that provides shorter paths to accelerate data delivery as well as reduce the number of data transmissions. An adaptive backbone maintenance mechanism is also introduced for low-energy cluster heads and agents to reduce their load, thereby prolonging the network lifetime. The experimental results show that HRDD achieves the longer network lifetime, the shorter delay, and the high success ratio compared to the prior work.
PAACP: A portable privacy-preserving authentication and access control protocol in vehicular ad hoc networks
(2011-03-15)
Yeh, Lo-Yao
;
Chen, Yen-Cheng
;
Huang, Jiun-Long
;
資訊工程學系
;
Department of Computer Science
Recently, several studies addressed security and privacy issues in vehicular ad hoc networks (VANETs). Most of them focused on safety applications. As VANETs will be available widely, it is anticipated that Internet services could be accessed through VANETs in the near future. Thus, non-safety applications for VANETs would rise in popularity. This paper proposes a novel portable privacy-preserving authentication and access control protocol, named PAACP, for non-safety applications in VANETs. In addition to the essential support of authentication, key establishment, and privacy preservation, PAACP is developed to provide sophisticated differentiated service access control, which will facilitate the deployment of a variety of non-safety applications. Besides, the portability feature of PAACP can eliminate the backend communications with service providers. Therefore, better performance and scalability can be achieved in PAACP. (C) 2010 Elsevier B.V. All rights reserved.
PBS: A Portable Billing Scheme with Fine-Grained Access Control for Service-Oriented Vehicular Networks
(2014-11-01)
Yeh, Lo-Yao
;
Huang, Jiun-Long
;
資訊工程學系
;
Department of Computer Science
Vehicular ad hoc networks (VANETs) are an emerging wireless network technology used to improve road safety. Commercial services will play an important role in drawing customers to VANETs. Therefore, service-oriented vehicular networks offer an effective and promising approach. To meet the diverse requirements of different users, fine-grained access control is essential. This paper aims to address security, privacy and billing issues in service-oriented vehicular networks. Taking advantage of a portable electronic currency, the proposed scheme mitigates the long authentication delay of the centralized AAA architecture. Variant attribute-based encryption ensures fine-grained access control and secure billing. Only vehicles possessing the proper service attributes and valid electronic currency are authorized to access the requested service file. The security properties of entity authentication, session key agreement, privacy, fraud electronic currency prevention, double-spending prevention, and nonrepudiated billing are achieved. Extensive analysis and simulations demonstrate that our scheme is a viable candidate to replace a centralized AAA architecture with a decentralized method for better scalability in service-oriented vehicular networks.
Secure IoT-Based, Incentive-Aware Emergency Personnel Dispatching Scheme with Weighted Fine-Grained Access Control
(2017-10-01)
Yeh, Lo-Yao
;
Tsaur, Woei-Jiunn
;
Huang, Hsin-Han
;
資訊工程學系
;
Department of Computer Science
Emergency response times following a traffic accident are extremely crucial in reducing the number of traffic-related deaths. Existing emergency vehicle dispatching systems rely heavily on manual assignments. Although some technology-assisted emergency systems engage in emergency message dissemination and path planning, efficient emergency response is one of the main factors that can decrease traffic-related deaths. Obviously, effective emergency response often plays a far more important role in a successful rescue. In this article, we propose a secure IoT-based and incentive-aware emergency personnel dispatching scheme (EPDS) with weighted fine-grained access control. Our EPDS can recruit available medical personnel on-the-fly, such as physicians driving in the vicinity of the accident scene. An appropriate incentive, such as paid leave, can be offered to encourage medical personnel to join rescue missions. Furthermore, IoT-based devices are installed in vehicles or wearable on drivers to gather biometric signals from the driver, which can be used to decide precisely which divisions or physicians are needed to administer the appropriate remedy. Additionally, our scheme can cryptographically authorize the assigned rescue vehicle to control traffic to increase rescue efficacy. Our scheme also takes advantage of adjacent roadside units to organize the appropriate rescue personnel without requiring long-distance communication with a trusted traffic authority. Proof of security is provided and extensive analyses, including qualitative and quantitative analyses and simulations, show that the proposed scheme can significantly improve rescue response time and effectiveness. To the best of our knowledge, this is the first work to make use of medical personnel that are close by in emergency rescue missions.