Browsing by Author "Ho, FS"

Now showing 1 - 5 of 5

A generic electronic payment model supporting multiple merchant transactions
(2000)
Huang, YL
;
Shieh, SP
;
Ho, FS
;
資訊工程學系
;
Department of Computer Science
This paper presents a generic electronic payment model which is intended for a multi-merchant transaction, in which more than one merchant (the retailer, multiple resellers and content providers) are involved in the distribution of electronic contents. With our payment model, every involved merchant will be notified to verify the license information of a content on the settlement day before the customer actually pays for his purchase. Thus, piracy can be discouraged, intellectual property rights of electronic contents can be protected. Each of the involved merchants can obtain his own deserved share of the customer's payment in accordance with their union agreement on this content. As examples to demonstrate the applications of our generic payment model, two well-known payment systems are enhanced herein, based on our payment model.
A total ordering multicast protocol using propagation trees - Comment
(1997-10-01)
Shieh, SP
;
Ho, FS
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
In this paper, we reevaluate the message cost of Jia's multicast mechanism. Our analysis shows that its message cost should be (D+k+1) instead of (D+2), where D is the the depth of the subtree and k is the number of metagroups containing the destination multicast group.
An efficient authentication protocol for mobile networks
(1999-07-01)
Shieh, SP
;
Ho, FS
;
Huang, YL
;
資訊工程學系
;
Department of Computer Science
Many existing authentication protocols supporting inter-domain authentication on the Internet require their clients to communicate with every involved key distribution center (KDC) directly. This is inefficient and costly when the client side is a wireless mobile unit, for wireless transmission has relatively lower bandwidth, and a mobile unit is battery powered. In this paper, we present a mobile authentication protocol which only needs seven messages for inter-domain initial authentication regardless of the number of hops transited between the visited and home domains; four messages for subsequent authentication when the mobile user requests a different service provided by the visited domain; and two messages when the same service is requested again. With the enhanced version of BAN logic we propose, it is proved that our protocol can achieve more goals of authentication than those required by the original BAN logic.
Efficient key distribution schemes for secure media delivery in pay-TV systems
(2004-10-01)
Huang, YL
;
Shieh, S
;
Ho, FS
;
Wang, JC
;
資訊工程學系
To provide secure media delivery in pay-TV systems, a large number of messages are exchanged for key updates in the conventional key distribution schemes. This is inefficient and costly when the client side (set-top box) uses a smart card with limited computing power. In this paper, we present three key distribution schemes for channel protection and secure media delivery in pay-TV systems. With the proposed schemes, encryption keys of the subscribed programs can be efficiently and securely distributed to the authorized subscribers. Only one message is needed to renew key in the key distribution schemes for subscription channel protection. In addition, we use simpler computation functions, including one-way hash function and exclusive-OR operation, for key updates to reduce the computation cost. With our key distribution schemes, only authorized subscribers can watch the subscribed programs correctly. Unauthorized subscribers have no information to retrieve the correct programs over the networks. Thus, service providers can charge their subscribers according to their subscriptions, and the illegal access of the media and video programs from networks can be prevented, based on the proposed schemes.
Network address translators: Effects on security protocols and applications in the TCP/IP stack
(2000-11-01)
Shieh, SP
;
Ho, FS
;
Huang, YL
;
Luo, JN
;
資訊工程學系