scispace - formally typeset
Search or ask a question
Author

SharmaShantanu

Bio: SharmaShantanu is an academic researcher from New Jersey Institute of Technology. The author has contributed to research in topics: Service (business) & Computer security. The author has co-authored 1 publications.

Papers
More filters
Journal ArticleDOI
28 Feb 2022
TL;DR: In this article, the authors argue that end-users need to trust data-capturing rules published by the systems, and that such a trust is misplaced in the context of smart buildings.
Abstract: Contemporary IoT environments, such as smart buildings, require end-users to trust data-capturing rules published by the systems. There are several reasons why such a trust is misplaced—IoT systems...

3 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: Data Station is introduced, a data escrow designed to enable the formation of data-sharing consortia with a Data Escrow that outperforms federated learning baselines in accuracy and runtime for the machine learning application and is orders of magnitude faster than alternative secure data- sharing frameworks.
Abstract: Pooling and sharing data increases and distributes its value. But since data cannot be revoked once shared, scenarios that require controlled release of data for regulatory, privacy, and legal reasons default to not sharing. Because selectively controlling what data to release is difficult, the few data-sharing consortia that exist are often built around data-sharing agreements resulting from long and tedious one-off negotiations. We introduce Data Station, a data escrow designed to enable the formation of data-sharing consortia. Data owners share data with the escrow knowing it will not be released without their consent. Data users delegate their computation to the escrow. The data escrow relies on delegated computation to execute queries without releasing the data first. Data Station leverages hardware enclaves to generate trust among participants, and exploits the centralization of data and computation to generate an audit log. We evaluate Data Station on machine learning and data-sharing applications while running on an untrusted intermediary. In addition to important qualitative advantages, we show that Data Station: i) outperforms federated learning baselines in accuracy and runtime for the machine learning application; ii) is orders of magnitude faster than alternative secure data-sharing frameworks; and iii) introduces small overhead on the critical path.

2 citations

Journal ArticleDOI
TL;DR: Data Station as discussed by the authors is a data escrow designed to enable the formation of data-sharing consortia, where data owners share data with the escrow knowing it will not be released without their consent.
Abstract: Pooling and sharing data increases and distributes its value. But since data cannot be revoked once shared, scenarios that require controlled release of data for regulatory, privacy, and legal reasons default to not sharing. Because selectively controlling what data to release is difficult, the few data-sharing consortia that exist are often built around data-sharing agreements resulting from long and tedious one-off negotiations. We introduce Data Station, a data escrow designed to enable the formation of data-sharing consortia. Data owners share data with the escrow knowing it will not be released without their consent. Data users delegate their computation to the escrow. The data escrow relies on delegated computation to execute queries without releasing the data first. Data Station leverages hardware enclaves to generate trust among participants, and exploits the centralization of data and computation to generate an audit log. We evaluate Data Station on machine learning and data-sharing applications while running on an untrusted intermediary. In addition to important qualitative advantages, we show that Data Station: i) outperforms federated learning baselines in accuracy and runtime for the machine learning application; ii) is orders of magnitude faster than alternative secure data-sharing frameworks; and iii) introduces small overhead on the critical path.

1 citations