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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Bar Sadeh

dblp:292/7514 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2023
—ORCID · none

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

Security and privacy · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
1 paper
Cryptographic protocols and secure computation · 100%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
private information retrieval		 0.712023
Bounds on the Capacity of Private Information Retrieval Over Graphs · IEEE Trans. Inf. Forensics Secur. 2023
Information theory › channel capacity
capacity bounds		 0.712023
Bounds on the Capacity of Private Information Retrieval Over Graphs · IEEE Trans. Inf. Forensics Secur. 2023

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

graph theory · 1.3edge-coloring · 0.7edge coloring · 0.7
YearPublicationVenuePosition
2023 Bounds on the Capacity of Private Information Retrieval Over Graphs
abstract
In the private information retrieval (PIR) problem, a user wants to retrieve a file from a database without revealing any information about the desired file’s identity to the servers that store the database. In this paper, we study the PIR capacity of a graph-based replication system, in which each file is stored on two distinct servers according to an underlying graph. This paper aims to provide upper and lower bounds to the PIR capacity of graphs via various graph properties. In particular, we provide several upper bounds on the PIR capacity that apply to all graphs. We further improve the bounds for specific graph families (which turn out to be tight in certain cases) by utilizing the underlying graph structure. For the lower bounds, we establish optimal rate PIR schemes for star graphs via edge-coloring techniques. Lastly, we provide an improved PIR scheme for complete graphs, implying an improved general lower bound on all graphs’ PIR capacity.
Bar Sadeh, Itzhak Tamo
 IEEE Trans. Inf. Forensics Secur.1
2021 Bounds on the Capacity of PIR over Graphs
abstract
In the private information retrieval (PIR) problem, a user wants to retrieve a file from a database without revealing any information about the desired file's identity to the servers that store the database. In this paper, we study the PIR capacity of a graph-based replication system, in which each file is stored on two distinct servers according to an underlying graph. This paper aims to provide upper and lower bounds to the PIR capacity of graphs via various graph properties. In particular, we provide several upper bounds on the PIR capacity that apply to all graphs. We further improve the bounds for specific graph families (which turn out to be tight in certain cases) by utilizing the underlying graph structure. For the lower bounds, we establish optimal rate PIR retrieval schemes for star graphs via edge-coloring techniques. Lastly, we provide an improved PIR scheme for complete graphs, which implies an improved general lower bound on all graphs' PIR capacity.
Bar Sadeh, Itzhak Tamo
 ISIT1