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

Juraj Belohorec

dblp:403/1284 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · unresolved

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

Security and privacy · 2 · 2 first-author · 2 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 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic commitments
polynomial commitment		 0.912025
On Extractability of the KZG Family of Polynomial Commitment Schemes · CRYPTO (6) 2025
YearPublicationVenuePosition
2026 Chopin: Optimal Pairing-Based Multilinear Polynomial Commitments from Bivariate KZG
Juraj Belohorec, Pavel Hubácek, Aleksi Kalsta, Kristýna Masková
 CRYPTO (9)1
2025 On Extractability of the KZG Family of Polynomial Commitment Schemes
Juraj Belohorec, Pavel Dvorák, Charlotte Hoffmann, Pavel Hubácek, Kristýna Masková, Martin Pastyrík
 CRYPTO (6)1