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

Erell Gachon

dblp:322/3445 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
0009-0001-2322-9823ORCID · reported

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

Security and privacy · 1 · 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 primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography › shortest vector problem
ideal-SVP		 0.612022
Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem · CRYPTO (2) 2022
Cryptographic primitives and cryptanalysis
post-quantum cryptography		 0.612022
Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem · CRYPTO (2) 2022
Cryptographic primitives and cryptanalysis › cryptographic hardness
knapsack problem		 0.212022
Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem · CRYPTO (2) 2022
YearPublicationVenuePosition
2022 Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem
Katharina Boudgoust, Erell Gachon, Alice Pellet-Mary
 CRYPTO (2)2