Interaction between entities who may not trust each other is now commonplace on the Internet. This paper focuses on the specific problem of sharing information between distrusting parties. Previous work in this area shows that privacy and utility can co-exist, but often do not provide strong assurances of one or the other. In this paper, we sketch a research agenda with several directions for a...

Pervasive computing allows data to be collected using sensors and mobile devices. Recent studies, however, show that in emergency and crisis situations conventional access control mechanisms are too rigid for information sharing. There is an increasing need to secure the information collected from the pervasive computing environments, and yet to be able to allow flexible data sharing to facilit...

This paper studies the problem of repairing secret sharing schemes, i.e., schemes that encode a message into n shares, assigned to n nodes, so that any n − r nodes can decode the message but any colluding z nodes cannot infer any information about the message. In the event of node failures so that shares held by the failed nodes are lost, the system needs to be repaired by reconstructing and re...

Although the benefits of information sharing between supply-chain partners are well known, many companies are averse to share their “private” information due to fear of adverse impact of information leakage. This paper uses techniques from Secure Multiparty Computation (SMC) to develop “secure protocols” for the CPFR r © † (Collaborative Planning, Forecasting, and Replenishment) business proces...

In this paper, we present a construction of (n, k, d,m) secure regenerating codes for distributed storage systems against eavesdroppers that can observe either data stored in at most m storage nodes or downloaded data for repairing at most m failed nodes in a network where m < k ≤ d ≤ n − 1. The (n, k, d,m) secure regenerating code is based on an (n, k, d) minimum bandwidth regenerating (MBR) c...

Outsourced computing gives computationally-limited data owners opportunities to have third parties process the data. However, data privacy is a major concern for outsourced computing. To the end of secure outsourced computing (SOC), the information-theoretic secure multiparty computation (IT-SMC) derived from secret sharing (SS) schemes is among the most computationally efficient techniques tha...

In this paper, we attempt to construct practical secret sharing schemes, which scheme has smaller share size and can detect cheating with high probability. We de ne two secure ramp schemes, secure ramp scheme and strongly secure ramp scheme. Then, we propose two constructions of secure ramp scheme. These schemes both have small share size and the cheating can be detected with high probability. ...