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

Adi Sosnovich

dblp:132/1783 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2018
—ORCID · none

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

Software engineering, systems software and programming languages · 2 · 1 first-authorTheory of computation · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSecurity and privacy · 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
Network security · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

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

TopicWeightPapersLastEvidence papers
Network security › protocol security
protocol vulnerability discovery
0.212013
Finding Security Vulnerabilities in a Network Protocol Using Parameterized Systems · CAV 2013
Automated reasoning and model checking
parameterized verification
0.012013
Finding Security Vulnerabilities in a Network Protocol Using Parameterized Systems · CAV 2013

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

parameterized model checking · 0.3network protocol analysis · 0.3
YearPublicationVenuePosition
2018 A Model-Driven Framework for Automated Generation and Verification of Cloud Solutions from Requirements
Hamid R. Motahari Nezhad, Taiga Nakamura, Adi Sosnovich, Peifeng Yin, Karen Yorav
ICSOC3
2015 Analyzing Internet Routing Security Using Model Checking
Adi Sosnovich, Orna Grumberg, Gabi Nakibly
LPAR1
2014 OSPF vulnerability to persistent poisoning attacks: a systematic analysis
abstract
Open Shortest Path First (OSPF) is one of the most widely deployed interior gateway routing protocols on the Internet. The most common attack vector against OSPF is spoofing of routing advertisements on behalf of a remote router. OSPF employs a self-defense "fight-back" mechanism that quickly reverts the effects of such attacks. Nonetheless, some attacks that evade the fight-back mechanism have been discovered, making it possible to persistently falsify routing advertisements. This type of attacks are the most serious threat to a routing protocol since they allow an attacker to gain persistent control over how traffic is routed throughout the network. This shows that despite its maturity, the OSPF specification is not without security flaws and may have still-unknown vulnerabilities. In this work we systematically analyze -- manually and by formal verification -- the OSPF specification for additional vulnerabilities in the fight-back mechanism. Our analysis uncovered a fundamental security flaw in OSPF that allows a simple means for an attacker to evade the fight-back mechanism. Most major router vendors acknowledged the existence of this vulnerability in their products. Fortunately, our analysis strongly indicates that no other vulnerabilities in the fight-back mechanism are likely to exist.
Gabi Nakibly, Adi Sosnovich, Eitan Menahem, Ariel Waizel, Yuval Elovici
ACSAC2
2013 Finding Security Vulnerabilities in a Network Protocol Using Parameterized Systems
Adi Sosnovich, Orna Grumberg, Gabi Nakibly
CAV1