EDBT 2026 Demo / reviewers in the wild / expert
Nikhil Tripathi
dblp:99/3515
· DBLP profile ↗
17ranked-venue papers
4as first author
7since 2021 · last 2026
0000-0001-8944-8044ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 8 · 4 first-author · 4 since 2021Systems, architecture and hardware · 6Software engineering, systems software and programming languages · 4Artificial intelligence and machine learning · 2 · 2 since 2021Computer networks · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A Lightweight Reinforcement Learning Framework for Othello Agents: Exploring Reward Shaping and Efficient Exploration
Vanya Awasthi, Piyush Joshi, Atin Chowdhury, Nikhil Tripathi |
ICAART (3) | 4 |
| 2026 | Autonomous Control for Reusable Rocket Landing: Deriving a Robust Guidance through Deep Reinforcement Learning in a Custom 3D Simulation Environment
Atin Chowdhury, Piyush Joshi, Vanya Awasthi, Nikhil Tripathi |
ICAART (3) | 4 |
| 2025 | Detecting interest flooding attacks in NDN: A probability-based event-driven approach
Matta Krishna Kumari, Nikhil Tripathi |
Comput. Secur. | 2 |
| 2025 | Identifying communication sequence anomalies to detect DoS attacks against MQTT
Munmun Swain, Nikhil Tripathi, Kamalakanta Sethi |
Comput. Secur. | 2 |
| 2025 | Adaptive NDN caching: Leveraging dynamic behaviour for enhanced efficiency
Matta Krishna Kumari, Nikhil Tripathi |
J. Netw. Comput. Appl. | 2 |
| 2024 | Delays Have Dangerous Ends: Slow HTTP/2 DoS Attacks Into the Wild and Their Real-Time Detection Using Event Sequence AnalysisabstractJon Postel's robustness principle states that the communicating entities should be liberal while accepting the data. Several web servers on the Internet do follow this principle as they wait to receive the remaining portion of an incomplete web request. Unfortunately, this behaviour also makes them vulnerable to Slow Rate DoS attacks. A few approaches are known to counter Slow Rate DoS attacks against HTTP/1.1. However, those defence approaches are incompatible with HTTP/2 because of several operation differences between HTTP/1.1 and its successor, HTTP/2. Also, to the best of our knowledge, no defence scheme is known to detect Slow Rate DoS attacks against an HTTP/2 supporting web server inreal-time. To bridge this gap, in this article, we propose an event sequence analysis-based scheme to detect Slow HTTP/2 DoS attacks. Using extensive experiments, we show that the scheme can detect attacks in real-time with high accuracy and marginal computational overhead. As an aside, we also present a study on the behaviour of popular HTTP/2 servers on the Internet against Slow HTTP/2 DoS attacks. Surprisingly, we noticed that several of them are vulnerable to these attacks, thereby justifying the requirement for an effective real-time detection strategy. Nikhil Tripathi |
IEEE Trans. Dependable Secur. Comput. | 1 |
| 2021 | Preventing time synchronization in NTP broadcast mode
Nikhil Tripathi, Neminath Hubballi |
Comput. Secur. | 1 |
| 2018 | Slow rate denial of service attacks against HTTP/2 and detection
Nikhil Tripathi, Neminath Hubballi |
Comput. Secur. | 1 |
| 2017 | A closer look into DHCP starvation attack in wireless networks
Neminath Hubballi, Nikhil Tripathi |
Comput. Secur. | 2 |
| 2017 | An event based technique for detecting spoofed IP packets
Neminath Hubballi, Nikhil Tripathi |
J. Inf. Secur. Appl. | 2 |
| 2016 | How Secure are Web Servers? An Empirical Study of Slow HTTP DoS Attacks and DetectionabstractSlow HTTP Denial of Service (DoS) is an application layer DoS attack in which large number of incomplete HTTP requests are sent. If number of such open connections in the server exhaust a preset threshold, server does not accept any new connections thus creating DoS. In this paper we make twofold contributions. We do an empirical study on different HTTP servers for their vulnerability against slow HTTP DoS attacks. Subsequently we propose a method to detect Slow HTTP Dos attack. The proposed detection system is an anomaly detection system which measures the Hellinger distance between two probability distributions generated in training and testing phases. In the training phase it creates a normal profile as a probability distribution comprising of complete and incomplete HTTP requests. In case of Slow HTTP attack the proportion of incomplete messages is increased in the overall traffic and detection system leverages this for detection by generating another probability distribution and finding difference between two probability distributions. We experiment by collecting data from a real web server and report the detection performance of proposed detection system. Nikhil Tripathi, Neminath Hubballi |
ARES | 1 |
| 2016 | Sequential analysis driven reset optimization to improve power, area and routability
Srihari Yechangunja, Raj Shekhar, Nikhil Tripathi, Abhishek Mittal, Minyoung Mo, Kyung Tae Do, Jung Yun Choi |
DATE | 4 |
| 2015 | Clock domain crossing aware sequential clock gating
Mi-Suk Hong, Kyung Tae Do, Jung Yun Choi, Nikhil Tripathi |
DATE | 8 |
| 2014 | Energy optimization in Android applications through wakelock placementabstractEnergy efficiency is a critical factor in mobile systems, and a significant body of recent research efforts has focused on reducing the energy dissipation in mobile hardware and applications. The Android OS Power Manager provides programming interface routines called wakelocks for controlling the activation state of devices on a mobile system. An appropriate placement of wakelock acquire and release functions in the application can make a significant difference to the energy consumption. In this paper, we propose a data flow analysis based strategy for determining the placement of wakelock statements corresponding to the uses of devices in an application. Our experimental evaluation on a set of Android applications show significant (up to 32%) energy savings with the proposed optimization strategy. Faisal Alam, Preeti Ranjan Panda, Nikhil Tripathi, Namita Sharma 0001, Sanjiv Narayan |
DATE | 3 |
| 2005 | An Ultra Low Power System Architecture for Sensor Network ApplicationsabstractRecent years have seen a burgeoning interest in embedded wireless sensor networks with applications ranging from habitat monitoring to medical applications. Wireless sensor networks have several important attributes that require special attention to device design. These include the need for inexpensive, long-lasting, highly reliable devices coupled with very low performance requirements. Ultimately, the "holy grail" of this design space is a truly untethered device that operates off of energy scavenged from the ambient environment. In this paper, we describe an application-driven approach to the architectural design and implementation of a wireless sensor device that recognizes the event-driven nature of many sensor-network workloads. We have developed a full-system simulator for our sensor node design to verify and explore our architecture. Our simulation results suggest one to two orders of magnitude reduction in power dissipation over existing commodity-based systems for an important class of sensor network applications. We are currently in the implementation stage of design, and plan to tape out the first version of our system within the next year. Mark Hempstead, Nikhil Tripathi, Patrick Mauro, Gu-Yeon Wei, David Brooks 0001 |
ISCA | 2 |
| 2004 | Overview of a compiler for synthesizing MATLAB programs onto FPGAsabstractThis paper describes a behavioral synthesis tool called AccelFPGA which reads in high-level descriptions of digital signal processing (DSP) applications written in MATLAB, and automatically generates synthesizable register transfer level (RTL) models and simulation testbenches in VHDL or Verilog. The RTL models can be synthesized using commercial logic synthesis tools and place and route tools onto field-programmable gate arrays (FPGAs). This paper describes how powerful directives are used to provide high-level architectural tradeoffs for the DSP designer. Experimental results are reported on a set of eight MATLAB benchmarks that are mapped onto the Xilinx Virtex II and Altera Stratix FPGAs. Prithviraj Banerjee, Malay Haldar, Anshuman Nayak, Victor Kim, Vikram Saxena, Steven Parkes, Debabrata Bagchi, Satrajit Pal, Nikhil Tripathi, David Zaretsky, Juan Ramon Uribe |
IEEE Trans. Very Large Scale Integr. Syst. | 9 |
| 2003 | Making area-performance tradeoffs at the high level using the AccelFPGA compiler for FPGAsabstractApplications such as digital cell phones, 3G wireless receivers, and voice over IP, require DSP functions that are typically mapped onto general purpose DSP processors. With the introduction of advanced FPGA architectures which provide built-in DSP support such as the Xilinx Virtex-II, and the Altera Stratix, a new hardware alternative is available for DSP designers. DSP design has traditionally been divided into algorithm development and hardware/software implementation. The majority of DSP algorithm developers use the MATLAB language for prototyping their DSP algorithm. Hardware design teams take the specifications in MATLAB code and manually create an RTL model in VHDL or Verilog. This paper describes how area-performance tradeoffs can be performed quickly at the high-level using a behavioral synthesis tool called AccelFPGA which reads in high-level descriptions of DSP applications written in MATLAB, and automatically generates synthesizable RTL models in VHDL or Verilog. Experimental results are reported with the AccelFPGA compiler on a set of 8 MATLAB benchmarks that are mapped onto the Xilinx Virtex II and Altera Stratix FPGAs. Prithviraj Banerjee, Vikram Saxena, Juan Ramon Uribe, Malay Haldar, Anshuman Nayak, Victor Kim, Debabrata Bagchi, Satrajit Pal, Nikhil Tripathi |
FPGA | 9 |