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

Avital Shafran

dblp:254/2733 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2025
—ORCID · none

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

Security and privacy · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 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
3 papers
Security and privacy of machine learning · 75% Cryptographic primitives and cryptanalysis · 25%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Artificial intelligence
1 paper
Segmentation and scene understanding · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval
retrieval-augmented generation
0.912025
Machine Against the RAG: Jamming Retrieval-Augmented Generation with Blocker Documents · USENIX Security Symposium 2025
Security and privacy of machine learning › retrieval-augmented generation security
knowledge poisoning
0.912025
Machine Against the RAG: Jamming Retrieval-Augmented Generation with Blocker Documents · USENIX Security Symposium 2025
Security and privacy of machine learning
retrieval-augmented generation security
0.912025
Machine Against the RAG: Jamming Retrieval-Augmented Generation with Blocker Documents · USENIX Security Symposium 2025
Cryptographic primitives and cryptanalysis › cryptanalysis
machine learning-based cryptanalysis
0.812024
Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods · CRYPTO (6) 2024
Security and privacy of machine learning
membership inference
0.512021
Membership Inference Attacks are Easier on Difficult Problems · ICCV 2021
Computer vision › Segmentation and scene understanding
medical image segmentation
0.112021
Membership Inference Attacks are Easier on Difficult Problems · ICCV 2021
Computer vision › Segmentation and scene understanding
semantic segmentation
0.112021
Membership Inference Attacks are Easier on Difficult Problems · ICCV 2021

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

retrieval jamming · 1.7blocker documents · 1.7reconstruction error · 1.0predictability error · 1.0gradient-based method · 0.8
YearPublicationVenuePosition
2025 Machine Against the RAG: Jamming Retrieval-Augmented Generation with Blocker Documents
Avital Shafran, Roei Schuster, Vitaly Shmatikov
USENIX Security Symposium1
2024 Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods
Avital Shafran, Eran Malach, Thomas Ristenpart, Gil Segev 0001, Stefano Tessaro
CRYPTO (6)1
2021 Crypto-Oriented Neural Architecture Design
abstract
Sending private data to Neural Network applications raises many privacy concerns. The cryptography community developed a variety of secure computation methods to address such privacy issues. As generic techniques for secure computation are typically prohibitively expensive, efforts focus on optimizing these cryptographic tools. Differently, we propose to optimize the design of crypto-oriented neural architectures, introducing a novel Partial Activation layer. The proposed layer is much faster for secure computation as it contains fewer non linear computations. Evaluating our method on three state-of-the-art architectures (SqueezeNet, ShuffleNetV2, and MobileNetV2) demonstrates significant improvement to the efficiency of secure inference on common evaluation metrics.
Avital Shafran, Gil Segev 0001, Shmuel Peleg, Yedid Hoshen
ICASSP1
2021 Membership Inference Attacks are Easier on Difficult Problems
abstract
Membership inference attacks (MIA) try to detect if data samples were used to train a neural network model, e.g. to detect copyright abuses. We show that models with higher dimensional input and output are more vulnerable to MIA, and address in more detail models for image translation and semantic segmentation, including medical image segmentation. We show that reconstruction-errors can lead to very effective MIA attacks as they are indicative of memorization. Unfortunately, reconstruction error alone is less effective at discriminating between non-predictable images used in training and easy to predict images that were never seen before. To overcome this, we propose using a novel predictability error that can be computed for each sample, and its computation does not require a training set. Our membership error, obtained by subtracting the predictability error from the reconstruction error, is shown to achieve high MIA accuracy on an extensive number of benchmarks.1
Avital Shafran, Shmuel Peleg, Yedid Hoshen
ICCV1