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

Shahar P. Cohen

dblp:316/4525 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0002-4609-5952ORCID · reported

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

Security and privacy · 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 primitives and cryptanalysis · 77% Cryptographic protocols and secure computation · 23%
Theoretical computer science
1 paper
Computational complexity · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › hash functions
collision-resistant hash functions		 0.612022
Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols · CRYPTO (3) 2022
Cryptographic protocols and secure computation › key exchange
secret key agreement		 0.212022
Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols · CRYPTO (3) 2022
Computational complexity
communication complexity		 0.212022
Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols · CRYPTO (3) 2022
YearPublicationVenuePosition
2022 Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols
Shahar P. Cohen, Moni Naor
 CRYPTO (3)1