Anat Bremler-Barr

Anat Bremler-Barr

Auto-generated profile, based on publicly available information

Anat Bremler-Barr

Tel Aviv University

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
1 December 2002 in Distributed Computing
Verified
Journal Article
Closed access
PDF file
YAYehuda Afek
Yehuda Afek
ABAnat Bremler-Barr
Anat Bremler-Barr
HKHaim Kaplan
Haim Kaplan
ECEdith Cohen
Edith Cohen
MMMichael Merritt
Michael Merritt

5 February 2018 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
ABAnat Bremler-Barr
Anat Bremler-Barr
YHYotam Harchol
Yotam Harchol
DHDavid Hay
David Hay
YHYacov Hel-Or
Yacov Hel-Or
We present range encoding with no expansion (RENÉ) - a novel encoding scheme for short ranges on Ternary content addressable memory (TCAM), which, unlike previous solutions, does not impose row expansion, and uses bits proportionally to the maximal range length. We provide theoretical analysis to show that our encoding is the closest to the lower bound of number of bits used. In addition, we show several applications of our technique in the field of packet classification, and also, how the same technique could be used to efficiently solve other hard problems, such as the nearest-neighbor search problem and its variants. We show that using TCAM, one could solve such problems in much higher rates than previously suggested solutions, and outperform known lower bounds in traditional memory models. We show by experiments that the translation process of RENÉ on switch hardware induces only a negligible 2.5% latency overhead. Our nearest neighbor implementation on a TCAM device provides search rates that are up to four orders of magnitude higher than previous best prior-art solutions.

6 March 2019 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
YAYehuda Afek
Yehuda Afek
ABAnat Bremler-Barr
Anat Bremler-Barr
SFShir Landau Feibish
Shir Landau Feibish
We present a basic tool for zero day attack signature extraction. Given two large sets of messages, P the messages captured in the network at peacetime (i.e., mostly legitimate traffic) and A the messages captured during attack time (i.e., contains many attack messages), we present a tool for extracting a set S of strings that are frequently found in A and not in P, thus allowing the identification of the attack packets. This is an important tool in protecting sites on the Internet from worm attacks and distributed denial of service attacks and may also be useful for other problems, including command and control identification and the DNA-sequences analysis. The main contributions of this paper are the system we developed to extract the required signatures together with the string-heavy hitters problem definition and the algorithm for solving this problem. This algorithm finds popular strings of variable length in a set of messages, using, in a tricky way, the classic heavy-hitter algorithm as a building block. The algorithm runs in linear time requiring one-pass over the input. Our system makes use of this algorithm to extract the desired signatures. Furthermore, we provide an extended algorithm which is able to identify groups of signatures, often found together in the same packets, which further improves the quality of signatures generated by our system. Using our system, a yet unknown attack can be detected and stopped within minutes from attack start time.

1 April 2011
Verified
Conference Paper
Open access
UBUdi Ben-Porat
Udi Ben-Porat
ABAnat Bremler-Barr
Anat Bremler-Barr
HLHanoch Levy
Hanoch Levy
BPBernhard Plattner
Bernhard Plattner
Channel aware schedulers of modern wireless networks - such as the popular Proportional Fairness Scheduler (PFS) - improve throughput performance by exploiting channel fluctuations while maintaining fairness among the users. In order to simplify the analysis, PFS was introduced and vastly investigated in a model where frame losses do not occur, which is of course not the case in practical wireless networks. Recent studies focused on the efficiency of various implementations of PFS in a realistic model where frame losses can occur. In this work we show that the common straight forward adaptation of PFS to frame losses exposes the system to a malicious attack (which can alternatively be caused by malfunctioning user equipment) that can drastically degrade the performance of innocent users. We analyze the factors behind the vulnerability of the system and propose a modification of PFS designed for the frame loss model which is resilient to such malicious attack while maintaining the fairness properties of original PFS.

1 June 2017
Verified
Conference Paper
Closed access
ABAnat Bremler-Barr
Anat Bremler-Barr
DHDavid Hay
David Hay
IMIdan Moyal
Idan Moyal
LSLiron Schiff
Liron Schiff

9 December 2024
Verified
Conference Paper
Open access
DADaniel Alfasi
Daniel Alfasi
TSTal Shapira
Tal Shapira
ABAnat Bremler-Barr
Anat Bremler-Barr
The Common Vulnerabilities and Exposures (CVE) system is crucial for cybersecurity, providing standardized identification of vulnerabilities. In February 2024, the National Vulnerability Database (NVD) announced it could no longer enrich new CVEs due to increasing volumes, significantly impacting global security efforts. This paper introduces VulnScopper, an innovative approach to automate and enhance vulnerability enrichment using Graph Neural Networks (GNNs). VulnScopper combines Knowledge Graphs (KG) with Natural Language Processing (NLP) by leveraging ULTRA, a GNN-based knowledge graph foundation model, alongside a Large Language Model (LLM). VulnScopper's inductive approach enables it to handle unseen entities, overcoming a crucial limitation of previous CVE enrichment methods. We evaluate VulnScopper on the NVD dataset in inductive and transductive setups for CVE to Common Platform Enumerations (CPE) linking. Our results show that VulnScopper outperforms state-of-the-art techniques, achieving up to 60% Hits@10 accuracy in linking CVEs to CPE on unseen CVE records. We demonstrate VulnScopper's effectiveness on unseen 2023 CVEs, showcasing its ability to uncover new vulnerable products and potentially reduce vulnerability remediation time.