Hsiao-Ying Lin

Learn More
We proposed a two-round protocol for solving the Millionaires’ Problem in the setting of semi-honest parties. Our protocol uses either multiplicative or additive homomorphic encryptions. Previously proposed protocols used additive or XOR homomorphic encryption schemes only. The computation and communication costs of our protocol are in the same asymptotic(More)
A cloud storage system, consisting of a collection of storage servers, provides long-term storage services over the Internet. Storing data in a third party's cloud system causes serious concern over data confidentiality. General encryption schemes protect data confidentiality, but also limit the functionality of the storage system because a few operations(More)
Distributed networked storage systems provide the storage service on the Internet. We address the privacy issue of the distributed networked storage system. It is desired that data stored in the system remain private even if all storage servers in the system are compromised. The major challenge of designing these distributed networked storage systems is to(More)
With the increasing popularity of cloud computing, Hadoop has become a widely used open source cloud computing framework for large scale data processing. However, few studies have been done to enhance data confidentiality of Hadoop against storage servers. In this paper, we address the data confidentiality issue by integrating hybrid encryption schemes and(More)
There is strong demand for solutions to security problems in various wireless networks, such as WiFi, WiMAX, 3GPP and WSN, not only for the individual networks themselves but also for the integration of these networks. A complete solution cannot be proposed by piecemeal proposals but requires a holistic examination of all security concerns. The solution(More)
Advanced smart meters generate meter readings in a time unit less than a second. Fine-grained meter readings enable various smart grid applications, such as load monitoring, automatic billing, and power generation planning. However, those meter readings threaten individuals' privacy by revealing details of one's daily activities. The time granularity of(More)
Erasure code based distributed storage systems provide data robustness by storing encoded-fragments over servers. To maintain data robustness, a repair mechanism recovers a storage system from server failures by repairing encoded-fragments. For decentralized erasure code based storage systems, we propose a decentralized repair mechanism. Our mechanism has(More)
Erasure codes are applied in distributed storage systems to provide data robustness against server failures by storing data redundancy among many storage servers. A (n, k) erasure code encodes a data object, which is represented as k elements, into a codeword of n elements such that any k out of these n codeword elements can recover the data object back.(More)