EDBT 2026 Demo / reviewers in the wild / expert
Markus Stadler
dblp:62/6779
· DBLP profile ↗
10ranked-venue papers
2as first author
0since 2021 · last 1999
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 10 · 2 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
6 papers |
Cryptographic protocols and secure computation · 45% Cryptographic primitives and cryptanalysis · 35% Blockchain and cryptocurrency security · 8% |
Topics — the 13 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › private information retrieval
computational private information retrieval |
0.0 | 1 | 1999 | Computationally Private Information Retrieval with Polylogarithmic Communication · EUROCRYPT 1999 |
Cryptographic protocols and secure computation
private information retrieval |
0.0 | 1 | 1999 | Computationally Private Information Retrieval with Polylogarithmic Communication · EUROCRYPT 1999 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › non-transferable signatures
designated confirmer signatures |
0.0 | 1 | 1998 | Generic Constructions for Secure and Efficient Confirmer Signature Schemes · EUROCRYPT 1998 |
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures |
0.0 | 1 | 1998 | Generic Constructions for Secure and Efficient Confirmer Signature Schemes · EUROCRYPT 1998 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
group signature |
0.0 | 1 | 1997 | Efficient Group Signature Schemes for Large Groups (Extended Abstract) · CRYPTO 1997 |
Authentication and access control › anonymous credentials
anonymity revocation |
0.0 | 1 | 1996 | An Efficient Fair Payment System · CCS 1996 |
Blockchain and cryptocurrency security
fair payment |
0.0 | 1 | 1996 | An Efficient Fair Payment System · CCS 1996 |
Cryptographic protocols and secure computation › secret sharing › verifiable secret sharing
publicly verifiable secret sharing |
0.0 | 1 | 1996 | Publicly Verifiable Secret Sharing · EUROCRYPT 1996 |
Cryptographic protocols and secure computation
secret sharing |
0.0 | 1 | 1996 | Publicly Verifiable Secret Sharing · EUROCRYPT 1996 |
Cryptographic protocols and secure computation › secure computation protocols › setup assumptions
trusted third party |
0.0 | 1 | 1996 | An Efficient Fair Payment System · CCS 1996 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
blind signatures |
0.0 | 1 | 1995 | Fair Blind Signatures · EUROCRYPT 1995 |
Privacy and data protection › anonymity
anonymous payment |
0.0 | 1 | 1996 | An Efficient Fair Payment System · CCS 1996 |
Privacy and data protection › anonymity
traceable anonymity |
0.0 | 1 | 1996 | An Efficient Fair Payment System · CCS 1996 |
Methods — techniques the papers use, named apart from their topics
cryptographic protocol design · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | Computationally Private Information Retrieval with Polylogarithmic Communication
Christian Cachin, Silvio Micali, Markus Stadler |
EUROCRYPT | 3 |
| 1998 | On the Security of Some Variants of the RSA Signature Scheme
Markus Michels, Markus Stadler |
ESORICS | 2 |
| 1998 | Generic Constructions for Secure and Efficient Confirmer Signature Schemes
Markus Michels, Markus Stadler |
EUROCRYPT | 2 |
| 1997 | Efficient Group Signature Schemes for Large Groups (Extended Abstract)
Jan Camenisch, Markus Stadler |
CRYPTO | 2 |
| 1997 | Digital Payment Systems With Passive Anonymity-Revoking TrusteesabstractAnonymity of the participants is an important requirement for some applications in electronic commerce, in particular for payment systems. Because anonymity could be in conflict with law enforcement, for instance in cases of blackmailing or money laundering, it has been proposed to design systems i n which a trustee or a set of trustees can selectively revoke the anonymity of the participants involved in a suspicious transaction. From an operational point of view, it can be an important requirement that such trustees are neither involved in payment transactions nor in the opening of an account, but only in case of a justified suspicion. In this paper we present an efficient anonymous digital payment systems satisfying this requirement. The described basic protocol for anonymity revocation can be used in on-line or off-line payment systems. Jan Camenisch, Ueli Maurer, Markus Stadler |
J. Comput. Secur. | 3 |
| 1996 | An Efficient Fair Payment SystemabstractMany proposed payment systems allow the payer to remain anonymous during a transaction.However, this unconditional privacy protection could be misused by criminals, e.g. for blackmailing or money laundering.With a fair payment system, anonymous payments are still possible, but the anonymity can be removed with the help of a trusted party which need not be involved in the transaction itself.In this paper, we present an efficient fair payment system and we discuss its security. Jan Camenisch, Jean-Marc Piveteau, Markus Stadler |
CCS | 3 |
| 1996 | Digital Payment Systems with Passive Anonymity-Revoking Trustees
Jan Camenisch, Ueli Maurer, Markus Stadler |
ESORICS | 3 |
| 1996 | Publicly Verifiable Secret Sharing
Markus Stadler |
EUROCRYPT | 1 |
| 1995 | Fair Blind Signatures
Markus Stadler, Jean-Marc Piveteau, Jan Camenisch |
EUROCRYPT | 1 |
| 1994 | An Efficient Electronic Payment System Protecting Privacy
Jan Camenisch, Jean-Marc Piveteau, Markus Stadler |
ESORICS | 3 |