Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mohit Mishra

dblp:170/1880 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
2since 2021 · last 2021
0000-0002-6111-3565ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 3Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Systems and software security · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Systems and software security › exploitation
code reuse attack
0.412020
$\Delta$ΔBreakpad: Diversified Binary Crash Reporting · IEEE Trans. Dependable Secur. Comput. 2020
Systems and software security
crash reporting
0.412020
$\Delta$ΔBreakpad: Diversified Binary Crash Reporting · IEEE Trans. Dependable Secur. Comput. 2020
Systems and software security
exploitation
0.412020
$\Delta$ΔBreakpad: Diversified Binary Crash Reporting · IEEE Trans. Dependable Secur. Comput. 2020
Systems and software security
software diversity
0.412020
$\Delta$ΔBreakpad: Diversified Binary Crash Reporting · IEEE Trans. Dependable Secur. Comput. 2020
Compilers and program optimization › program instrumentation
compiler instrumentation
0.112020
$\Delta$ΔBreakpad: Diversified Binary Crash Reporting · IEEE Trans. Dependable Secur. Comput. 2020

Methods — techniques the papers use, named apart from their topics

debug information patching · 0.9binary diversification · 0.9
YearPublicationVenuePosition
2021 A Novel Method for Automated Suggestion of Similar Software Incidents Using 2-Stage Filtering: Findings on Primary Data
Badal Agrawal, Mohit Mishra, Varun Parashar
ICDAR (2)2
2021 Demo: Automatically Retrainable Self Improving Model for the Automated Classification of Software Incidents into Multiple Classes
abstract
Developers across most of the organizations face the issue of manually dealing with the classification of the software bug reports. Software bug reports often contain text and other useful information that are common for a particular type of bug. This information can be extracted using the techniques of Natural Language Processing and combined with the manual classification done by the developers until now to create a properly labelled data set for training a supervised learning model for automatically classifying the bug reports into their respective categories. Previous studies have only focused on binary classification of software incident reports as bug and non-bug. Our novel approach achieves an accuracy of 76.94% for a 10-factor classification problem on the bug repository created by Microsoft Dynamics 365 team. In addition, we propose a novel method for automatically retraining the model and updating it with developer feedback in case of misclassification that will significantly reduce the maintenance cost and effort.
Badal Agrawal, Mohit Mishra
ICDCS2
2020 $\Delta$ΔBreakpad: Diversified Binary Crash Reporting
abstract
This paper introduces ΔBreakpad. It extends the Breakpad crash reporting system to handle software diversity effectively and efficiently by replicating and patching the debug information of diversified software versions. Simple adaptations to existing open source compiler tools are presented that on the one hand introduce significant amounts of diversification in the code and stack layout of ARMv7 binaries to mitigate the widespread deployment of code injection and code reuse attacks, while on the other hand still supporting accurate crash reporting. An evaluation on SPEC2006 benchmarks demonstrates that the corresponding computational, storage, and communication overheads are small.
Bert Abrath, Bart Coppens 0001, Mohit Mishra, Jens Van den Broeck, Bjorn De Sutter
IEEE Trans. Dependable Secur. Comput.3
2017 RandHeap: Heap Randomization for Mitigating Heap Spray Attacks in Virtual Machines
abstract
Virtual machines are an integral component of our present software systems infrastructure, including the web, and are here to stay. Web browsers like Google Chrome and Mozilla Firefox uses virtual machines to execute JavaScript code. Java Virtual Machines (JVMs) use just-in-time compilers to compile Java byte code to machine code. However, with the increasing use of virtual machines, they are also susceptible to security attacks. One such class of attack is the heap spray attack, wherein the attacker populates the heap with malicious code and exploits a vulnerability to jump to the populated malicious code in the heap, thereby enabling arbitrary code execution. In this paper, we present RandHeap, a technique to randomize the heap layout to detect and prevent heap spray attacks. RandHeap randomizes the heap in three different ways: (i) by randomizing object layout, (ii) by randomizing array layout, and (iii) by encrypting data stored on the heap. Using RandHeap, we were able to detect and prevent several heap spray attacks. For the evaluation of RandHeap, we implemented the concept of RandHeap in Google V8 and JikesRVM. We executed Octane 2.0 Benchmarks on Google V8 and Dacapo 9.12 Benchmarks on JikesRVM. Observations show that heap randomization using RandHeap is accompanied with low overhead and modest memory requirement. We implemented heap spraying attacks in Google V8 and JikesRVM and found that RandHeap was able to detect and prevent the attacks successfully.
Abhinav Jangda, Mohit Mishra
PST2
2016 libmask: Protecting browser JIT engines from the devil in the constants
abstract
JavaScript (JS) engines are virtual machines that execute JavaScript code. These engines find frequent application in web browsers like Google Chrome, Mozilla Firefox, Microsoft Internet Explorer and Apple Safari. Since, the purpose of a JS engine is to produce executable code, it cannot be run in a non-executable environment, and is susceptible to attacks like Just-in-Time (JIT) Spraying, which embed return-oriented programming (ROP) gadgets in arithmetic or logical instructions as immediate offsets. This paper introduces libmask, a JIT compiler extension to prevent the JIT-spraying attacks as an effective alternative to XOR based constant blinding. libmask transforms constants into global variables and marks the memory area for these global variables as read only. Hence, any constant is referred to by a memory address making exploitation of arithmetic and logical instructions more difficult. Further, these memory addresses are randomized to further harden the security. The scheme has been implemented and evaluated as a librddy extension to Google V8 scripting engine with optimizations that contain performance overhead and make libmask a feasible approach. We demonstrate that libmask masks all the constants in JITed code, and effectively raise the bar for JIT-spray and JITROP attacks. The average overhead incurred upon memory is less than 300 kilobytes, while in most benchmarks the memory overhead is less than 10 KB. The average performance overhead observed with optimizations measures is 5.31%. Further, this new approach shows a modest performance improvement over currently deployed constant blinding technique in Google V8.
Abhinav, Mohit Mishra, Benoit Baudry
PST2
2016 Heuristic algorithm based on molecules optimizing their geometry in a crystal to solve the problem of integer factorization
Mohit Mishra, Utkarsh Chaturvedi, Kaushal K. Shukla
Soft Comput.1