Nikhil Ravi

Nikhil Ravi

Auto-generated profile, based on publicly available information

Nikhil Ravi

Department of Electrical and Computer Engineering, Cornell Tech, New York City, NY, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
17 June 2022 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
NRNikhil Ravi
Nikhil Ravi
ASAnna Scaglione
Anna Scaglione
SKSachin Kadam
Sachin Kadam
RGReinhard Gentz
Reinhard Gentz
SPSean Peisert
Sean Peisert
ASAram Shumavon
Aram Shumavon
The proliferation of smart meters has resulted in a large amount of data being generated. It is increasingly apparent that methods are required for allowing a variety of stakeholders to leverage the data in a manner that preserves the privacy of the consumers. The sector is scrambling to define policies, such as the so called ‘15/15 rule’, to respond to the need. However, the current policies fail to adequately guarantee privacy. In this paper, we address the problem of allowing third parties to apply $K$ -means clustering, obtaining customer labels and centroids for a set of load time series by applying the framework of differential privacy. We leverage the method to design an algorithm that generates differentially private synthetic load data consistent with the labeled data. We test our algorithm’s utility by answering summary statistics such as average daily load profiles for a 2-dimensional synthetic dataset and a real-world power load dataset.

1 January 2021 in Applied Energy
Verified
Journal Article
Closed access
SSShammya Saha
Shammya Saha
NRNikhil Ravi
Nikhil Ravi
KHKári Hreinsson
Kári Hreinsson
JBJaejong Baek
Jaejong Baek
ASAnna Scaglione
Anna Scaglione
NJNathan Johnson
Nathan Johnson

1 May 2019
Verified
Conference Paper
Closed access
NRNikhil Ravi
Nikhil Ravi
ASAnna Scaglione
Anna Scaglione
ANAngelia Nedić
Angelia Nedić
In this paper, we consider the problem of solving a distributed (consensus-based) optimization problem in a network that contains regular and malicious nodes (agents). The regular nodes are performing a distributed iterative algorithm to solve their associated optimization problem, while the malicious nodes inject false data with a goal to steer the iterates to a point that serves their own interest. The problem consists of detecting and isolating the malicious agents, thus allowing the regular nodes to solve their optimization problem. We propose a method to dwarf data injection attacks on distributed optimization algorithms, which is based on the idea that the malicious nodes (individually or in collaboration) tend to give themselves away when broadcasting messages with the intention to drive the consensus value away from the optimal point for the regular nodes in the network. In particular, we provide a new gradient-based metric to detect the neighbors that are likely to be malicious. We also provide some simulation results demonstrating the performance of the proposed approach.

1 January 2019 in IFAC-PapersOnLine
Verified
Journal Article
Closed access
NRNikhil Ravi
Nikhil Ravi
ASAnna Scaglione
Anna Scaglione

23 June 2023 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
RRRaksha Ramakrishna
Raksha Ramakrishna
ASAnna Scaglione
Anna Scaglione
TWTong Wu
Tong Wu
NRNikhil Ravi
Nikhil Ravi
SPSean Peisert
Sean Peisert
In this paper, we present a notion of differential privacy (DP) for data that comes from different classes. Here, the class-membership is private information that needs to be protected. The proposed method is an output perturbation mechanism that adds noise to the release of query response such that the analyst is unable to infer the underlying class-label. The proposed DP method is capable of not only protecting the privacy of class-based data but also meets quality metrics of accuracy and is computationally efficient and practical. We illustrate the efficacy of the proposed method empirically while outperforming the baseline additive Gaussian noise mechanism.We also examine a real-world application and apply the proposed DP method to the autoregression and moving average (ARMA) forecasting method, protecting the privacy of the underlying data source. Case studies on the real-world advanced metering infrastructure (AMI) measurements of household power consumption validate the excellent performance of the proposed DP method while also satisfying the accuracy of forecasted power consumption measurements.

17 November 2016
Verified
Conference Paper
Closed access
ANA N Nagamani
A N Nagamani
RNR Nikhil
R Nikhil
MNManish Nagaraj
Manish Nagaraj
VAVinod Kumar Agrawal
Vinod Kumar Agrawal
Power dissipation has become the major concern for circuit design and implementation. Reversible Logic is the best alternative to Irreversible Logic in terms of low power consumption. Circuits designed using reversible logic have a wide array of applications. The Quantum Cost, Garbage Outputs, Ancillary Inputs and Delay are some of the parameters of reversible circuits that can be used to determine their efficiency and compare them with existing works. Optimization of these parameters are highly essential. Garbage Outputs is an important parameter that must be considered. This paper presents a design for a Reversible Radix-4 Booth Multiplier that is optimized in Garbage Cost and Ancillary inputs. The design proposed is capable of both signed and unsigned multiplication. The optimization in Garbage Cost ensures lower heat dissipation. The Encoded Booth Algorithm or Radix-4 Booth Algorithm reduces the number of partial products generated in signed multiplication to half the number generated using a Radix-2 signed multiplier making it suitable for Digital Signal Processors. The design proposed is compared to existing multiplier circuits and the parameters are tabulated.