Browsing by Author "Liu, Yung-Hsiang"

Now showing 1 - 5 of 5

A Secure Reed-Solomon Code Incentive Scheme for Commercial Ad Dissemination Over VANETs
(2011-11-01)
Tseng, Fu-Kuo
;
Liu, Yung-Hsiang
;
Hwu, Jing-Shyang
;
Chen, Rong-Jaye
;
資訊工程學系
A recent surge of research on vehicular ad hoc networks (VANETs) has given us new opportunities and challenges. Aside from safety-related applications, commercial applications also find their way to fully utilize these networks. One of the promising applications is the dissemination of commercial advertisements over VANETs. However, there are uncooperative vehicles that may disrupt the spreading of these advertisements. To encourage cooperation, we want to address proper incentives and security measurements. In this paper, we use Reed-Solomon codes (RS-codes) to construct our incentive scheme and enhance its security by introducing one discrete logarithm representation problem. Our construction yields a secure and practical commercial advertisement dissemination scheme over VANETs.
An asymptotically perfect secret sharing scheme based on the Chinese Remainder Theorem
(2017-01-01)
Liu, Yung-Hsiang
;
Chen, Rong-Jaye
;
資訊工程學系
;
Department of Computer Science
The secret sharing schemes based on the Chinese Remainder Theorem (CRT) and their applications have attracted many researchers in recent years. In this paper, we propose a weighted threshold secret sharing scheme based on the CRT and prove the scheme is asymptotically perfect. Since all CRT-based secret sharing schemes use special sequences of pairwise coprime integers as its parameters, this paper proposes the first algorithm to generate these integers. Moreover, the correctness of this algorithm is proved by using the prime number theorem. The experimental result shows the effectiveness and the efficiency of our algorithm as well as the space efficiency of our scheme using the sequences of integers generated from our algorithm. Our scheme with the parameter generation algorithm can be used in many applications such as threshold cryptosystems.
Ensuring Correctness of Range Searches on Encrypted Cloud Data
(2012)
Tseng, Fu-Kuo
;
Liu, Yung-Hsiang
;
Chen, Rong-Jaye
;
資訊工程學系
;
Department of Computer Science
We target at one newly introduced security concern which is not fully addressed when moving (encrypted) data to the cloud, namely, the security of the search results from the cloud. The cloud storage provider (CSP) might be compromised or simply act maliciously for their own good, which yields incorrect search results. In this paper, we exploit hidden vector encryption to tackle this important security problem. Our construction enables CSPs to provide a proof of the search results to be verified later by the cloud storage users. In particular, this proposed scheme handles equality and range searches on encrypted data. Users can verified the correctness of the search results without decrypting for the corresponding file contents. Any tampering with the search results by CSPs will be caught, while any incorrect charge against CSPs for tampering search results can be rectified. Finally, we present extensive security and performance analysis to show the security and practicality of our scheme.
Halo: A Hierarchical Identity-Based Public Key Infrastructure for Peer-to-Peer Opportunistic Collaboration
(2009)
Tseng, Fu-Kuo
;
Zao, John K.
;
Liu, Yung-Hsiang
;
Kuo, Fang-Po
;
資訊工程學系
The lack of information security protection for peer-to-peer systems has hampered the use of this robust and scalable technology in sensitive applications. The security weakness is rooted in the server-less architecture and the demand driven ad-hoc operation scenarios of peer-to-peer systems. Together, they prohibit scalable key management using traditional symmetric/asymmetric cryptographic techniques. The advent of hierarchical identity-based cryptography and thresholded/joint secret sharing offers a possible solution to this problem. In this paper, we present the design of Halo, a hierarchical identity-based public key infrastructure that uses these novel technologies to perform recursive instantiation of private key generators and establish a trust hierarchy with unlimited number of levels. The PKI thus enables the employment of hierarchical identity-based public key encryption, signature, and signcryption for the protection of peer-to-peer applications. The effort to implement a proof-of-concept prototype as a JXTA service module was also discussed.
To Piggyback Or Not to Piggyback Acknowledgments?
(2010)
Lee, Tsern-Huei
;
Kuo, Yaw-Wen
;
Huang, Yu-Wen
;
Liu, Yung-Hsiang
;
電信工程研究所
Piggyback is an effective way to reduce the MAC protocol overhead of wireless networks. This paper considers the physical data rate and transmission bit error to derive the criterion of piggyback. Numerical results show that the improvement of piggyback can reach 40% for some cases. For given the bit error rate and the data rate, we also provide the criterion for every combination in a table.