Shantanu Sharma

Shantanu Sharma

Auto-generated profile, based on publicly available information

Shantanu Sharma

New Jersey Institute of Technology, Newark, NJ, USA

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 July 2017 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
SDShlomi Dolev
Shlomi Dolev
PFPatricia Florissi
Patricia Florissi
EGEhud Gudes
Ehud Gudes
SSShantanu Sharma
Shantanu Sharma
ISIdo Singer
Ido Singer
Hadoop and Spark are widely used distributed processing frameworks for large-scale data processing in an efficient and fault-tolerant manner on private or public clouds. These big-data processing systems are extensively used by many industries, e.g., Google, Facebook, and Amazon, for solving a large class of problems, e.g., search, clustering, log analysis, different types of join operations, matrix multiplication, pattern matching, and social network analysis. However, all these popular systems have a major drawback in terms of locally distributed computations, which prevent them in implementing geographically distributed data processing. The increasing amount of geographically distributed massive data is pushing industries and academia to rethink the current big-data processing systems. The novel frameworks, which will be beyond state-of-the-art architectures and technologies involved in the current system, are expected to process geographically distributed data at their locations without moving entire raw datasets to a single location. In this paper, we investigate and discuss challenges and requirements in designing geographically distributed data processing frameworks and protocols. We classify and study batch processing (MapReduce-based systems), stream processing (Spark-based systems), and SQL-style processing geo-distributed frameworks, models, and algorithms with their overhead issues.

8 August 2019 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
SDShlomi Dolev
Shlomi Dolev
PGPeeyush Gupta
Peeyush Gupta
YLYin Li
Yin Li
SMSharad Mehrotra
Sharad Mehrotra
SSShantanu Sharma
Shantanu Sharma
Data outsourcing allows data owners to keep their data at untrusted clouds that do not ensure the privacy of data and/or computations. One useful framework for fault-tolerant data processing in a distributed fashion is MapReduce, which was developed for trusted private clouds. This paper presents algorithms for data outsourcing based on Shamir's secret-sharing scheme and for executing privacy-preserving SQL queries such as count, selection including range selection, projection, and join while using MapReduce as an underlying programming model. Our proposed algorithms prevent an adversary from knowing the database or the query while also preventing output-size and access-pattern attacks. Interestingly, our algorithms do not involve the database owner, which only creates and distributes secret-shares once, in answering any query, and hence, the database owner also cannot learn the query. Logically and experimentally, we evaluate the efficiency of the algorithms on the following parameters: (i) the number of communication rounds (between a user and a server), (ii) the total amount of bit flow (between a user and a server), and (iii) the computational load at the user and the server.

1 April 2019
Verified
Conference Paper
Open access
SMSharad Mehrotra
Sharad Mehrotra
SSShantanu Sharma
Shantanu Sharma
JUJeffrey Ullman
Jeffrey Ullman
AMAnurag Mishra
Anurag Mishra
Despite extensive research on cryptography, secure and efficient query processing over outsourced data remains an open challenge. This paper continues along the emerging trend in secure data processing that recognizes that the entire dataset may not be sensitive, and hence, non-sensitivity of data can be exploited to overcome limitations of existing encryption-based approaches. We propose a new secure approach, entitled query binning (QB) that allows non-sensitive parts of the data to be outsourced in clear-text while guaranteeing that no information is leaked by the joint processing of non-sensitive data (in clear-text) and sensitive data (in encrypted form). QB maps a query to a set of queries over the sensitive and non-sensitive data in a way that no leakage will occur due to the joint processing over sensitive and non-sensitive data. Interestingly, in addition to improve performance, we show that QB actually strengthens the security of the underlying cryptographic technique by preventing size, frequency-count, and workload-skew attacks.

1 May 2019 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
PDF file
PGPeeyush Gupta
Peeyush Gupta
YLYin Li
Yin Li
SMSharad Mehrotra
Sharad Mehrotra
NPNisha Panwar
Nisha Panwar
SSShantanu Sharma
Shantanu Sharma
SASumaya Almanee
Sumaya Almanee
Despite extensive research on cryptography, secure and efficient query processing over outsourced data remains an open challenge. We develop communication-efficient and information-theoretically secure algorithms for privacy-preserving aggregation queries using multi-party computation (MPC). Specifically, query processing techniques over secret-shared data outsourced by single or multiple database owners are developed. These algorithms allow a user to execute queries on the secret-shared database and also prevent the network and the (adversarial) clouds to learn the user's queries, results, or the database. We further develop (non-mandatory) privacy-preserving result verification algorithms that detect malicious behaviors, and experimentally validate the efficiency of our approach over large datasets, the size of which prior approaches to secret-sharing or MPC systems have not scaled to.

27 October 2021 in ACM Transactions on Internet of Things
Verified
Journal Article
Open access
NPNisha Panwar
Nisha Panwar
SSShantanu Sharma
Shantanu Sharma
GWGuoxi Wang
Guoxi Wang
SMSharad Mehrotra
Sharad Mehrotra
NVNalini Venkatasubramanian
Nalini Venkatasubramanian
ASArdalan Amiri Sani
Ardalan Amiri Sani
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 may violate the rules deliberately or IoT devices may transfer user data to a malicious third-party due to cyberattacks, leading to the loss of individuals’ privacy or service integrity. To address such concerns, we propose IoT Notary , a framework to ensure trust in IoT systems and applications. IoT Notary provides secure log sealing on live sensor data to produce a verifiable “proof-of-integrity,” based on which a verifier can attest that captured sensor data adhere to the published data-capturing rules. IoT Notary is an integral part of TIPPERS, a smart space system that has been deployed at the University of California, Irvine to provide various real-time location-based services on the campus. We present extensive experiments over real-time WiFi connectivity data to evaluate IoT Notary , and the results show that IoT Notary imposes nominal overheads. The secure logs only take 21% more storage, while users can verify their one day’s data in less than 2 s even using a resource-limited device.

1 May 2015
Verified
Conference Paper
Closed access
SSShantanu Sharma
Shantanu Sharma
MKMohit Kumar
Mohit Kumar
PDPradip K. Das
Pradip K. Das
The accuracy of speech recognition systems, to a large extent, depends on the feature sets used for representing the recorded speech data. It has been a continuous process to derive better feature sets for more accurate speech recognition using ASR (Automatic Speech Recognition) systems. Many feature sets and their different combinations have been tried to achieve better accuracy but a feature set providing completely accurate results has not yet been formulated. These large feature sets consume significant amount of memory, together with computing and power requirements and they do not always contribute to improve the recognition rate. The paper investigates the relevance of individual features within the feature sets incorporated in speech recognition systems. The goal is to identify the features that do not contribute significantly in recognition or perhaps causing a fall in the recognition accuracy. The results of the experiments show that about 60% reduction of feature set is feasible with marginal loss of recognition accuracy using our method. The results of the analysis will further be used to formulate better feature sets, smaller than the traditional features with improved accuracy of ASR systems.