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

Nishant Sinha 0003

dblp:07/201-3 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0002-5393-9965ORCID · verified

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

Systems, architecture and hardware · 2Software engineering, systems software and programming languages · 1

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
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
stream cipher cryptanalysis
0.312018
A TMDTO Attack Against Lizard · IEEE Trans. Computers 2018
Cryptographic primitives and cryptanalysis › generic attacks
time-memory-data tradeoff attack
0.312018
A TMDTO Attack Against Lizard · IEEE Trans. Computers 2018
Cryptographic primitives and cryptanalysis › symmetric cryptography
lightweight cryptography
0.112018
A TMDTO Attack Against Lizard · IEEE Trans. Computers 2018

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

conditional TMDTO · 0.3BSW sampling · 0.3
YearPublicationVenuePosition
2020 Formal Synthesis of Monitoring and Detection Systems for Secure CPS Implementations
abstract
We consider the problem of securing a given control loop implementation of a cyber-physical system (CPS) in the presence of Man-in-the-Middle attacks on data exchange between plant and controller over a compromised network. To this end, there exists various detection schemes which provide mathemat¬ical guarantees against such attacks for the theoretical control model. However, such guarantees may not hold for the actual control software implementation. In this article, we propose a formal approach towards synthesizing attack detectors with varying thresholds which can prevent performance degrading stealthy attacks while minimizing false alarms.
Ipsita Koley, Saurav Kumar Ghosh, Soumyajit Dey, Debdeep Mukhopadhyay, Amogh Kashyap K. N., Sachin Kumar Singh, Lavanya Lokesh, Jithin Nalu Purakkal, Nishant Sinha 0003
DATE9
2018 A TMDTO Attack Against Lizard
abstract
Lizard is a very recently proposed lightweight stream cipher that claims 60 bit security against distinguishing (related to state recovery) and 80 bit security against key recovery attack. This cipher has 121 bit state size. In this paper, we first note that using ψ key stream bits one can recover ψ unknown bits of the state when t state bits are fixed to a specific pattern. This is made possible by guessing the remaining state bits. We present certain values of ψ, t based on the state size that helps in mounting a generic conditional TMDTO attack following the BSW sampling. For Lizard, we obtain the preprocessing complexity as 267, and the maximum of Data, Time and Memory complexity during the online phase as 254. The parameters in the online phase are significantly less than 260.
Subhamoy Maitra, Nishant Sinha 0003, Akhilesh Siddhanti, Ravi Anand, Sugata Gangopadhyay
IEEE Trans. Computers2