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 VLDB 2026 / reviewers in the wild / expert

Patrick Horster

dblp:h/PatrickHorster · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 1996
—ORCID · none

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

Security and privacy · 6 · 3 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
5 papers
Cryptographic primitives and cryptanalysis · 81% Cryptographic protocols and secure computation · 19%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures		 0.031996
Breaking and Repairing a Convertible Undeniable Signature Scheme · CCS 1996
Meta-ElGamal Signature Schemes · CCS 1994
Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and Their Applications · ASIACRYPT 1994
Cryptographic protocols and secure computation
electronic voting		 0.011996
Some Remarks on a Receipt-Free and Universally Verifiable Mix-Type Voting Scheme · ASIACRYPT 1996
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
multiparty signatures		 0.011996
On the Risk of Disruption in Several Multiparty Signature Schemes · ASIACRYPT 1996
Cryptographic protocols and secure computation › electronic voting
receipt-freeness		 0.011996
Some Remarks on a Receipt-Free and Universally Verifiable Mix-Type Voting Scheme · ASIACRYPT 1996
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › non-transferable signatures
undeniable signature		 0.011996
Breaking and Repairing a Convertible Undeniable Signature Scheme · CCS 1996
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
blind signatures		 0.011994
Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and Their Applications · ASIACRYPT 1994
Cryptographic primitives and cryptanalysis
discrete logarithm problem		 0.011994
Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and Their Applications · ASIACRYPT 1994
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › discrete logarithm signature
ECDSA		 0.011994
Meta-ElGamal Signature Schemes · CCS 1994
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › discrete logarithm signature
elgamal signature		 0.011994
Meta-ElGamal Signature Schemes · CCS 1994
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
message recovery signatures		 0.011994
Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and Their Applications · ASIACRYPT 1994

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

mix-net · 0.0cryptanalysis · 0.0meta-signature scheme · 0.0generalization · 0.0
YearPublicationVenuePosition
1996 Some Remarks on a Receipt-Free and Universally Verifiable Mix-Type Voting Scheme
Markus Michels, Patrick Horster
 ASIACRYPT2
1996 On the Risk of Disruption in Several Multiparty Signature Schemes
Markus Michels, Patrick Horster
 ASIACRYPT2
1996 Breaking and Repairing a Convertible Undeniable Signature Scheme
Markus Michels, Holger Petersen 0002, Patrick Horster
 CCS3
1994 Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and Their Applications
Patrick Horster, Markus Michels, Holger Petersen 0002
 ASIACRYPT1
1994 Meta-ElGamal Signature Schemes
abstract
There have been many approaches in the past to generalize the ElGamal signature scheme. In this paper we integrate all these approaches in a Meta-ElGamal signature scheme. We also investigate some new types of variations, that haven't been considered before. By this method we obtain in our example settings numerous variants of the ElGamal scheme. From these variants, we can extract new, highly efficient signature schemes, which haven't been proposed before. As an example, we present efficient DSA-variants.
Patrick Horster, Holger Petersen 0002, Markus Michels
 CCS1
1992 Cryptographic Protocols and Network Security
Patrick Horster, Hans-Joachim Knobloch
 SEC1