Jan-Hendrik Evertse

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

dblp:82/5471 · DBLP profile ↗

← Back

4ranked-venue papers

1as first author

0since 2021 · last 1992

—ORCID · none

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

Security and privacy · 4 · 1 first-author

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

4 papers

Cryptographic primitives and cryptanalysis · 58% Cryptographic protocols and secure computation · 37% Privacy and data protection · 6%

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

Topic	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › factorization-based signature RSA signature	1	1992	Which New RSA-Signatures Can be Computed from Certain Given RSA-Signatures? · J. Cryptol. 1992
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs proofs of knowledge	1	1986	Demonstrating Possession of a Discrete Logarithm Without Revealing It · CRYPTO 1986
Cryptographic protocols and secure computation › proof systems zero-knowledge proofs	1	1986	Demonstrating Possession of a Discrete Logarithm Without Revealing It · CRYPTO 1986
Cryptographic primitives and cryptanalysis block cipher cryptanalysis	1	1985	Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers · CRYPTO 1985

Year	Publication	Venue	Position
1992	Which New RSA-Signatures Can be Computed from Certain Given RSA-Signatures? Jan-Hendrik Evertse, Eugène van Heyst	J. Cryptol.	1
1986	A Secure and Privacy-protecting Protocol for Transmitting Personal Information Between Organizations David Chaum, Jan-Hendrik Evertse	CRYPTO	2
1986	Demonstrating Possession of a Discrete Logarithm Without Revealing It David Chaum, Jan-Hendrik Evertse, Jeroen van de Graaf, René Peralta 0001	CRYPTO	2
1985	Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers David Chaum, Jan-Hendrik Evertse	CRYPTO	2