Demo Data from SIGIR 2026 / reviewers in the wild / expert
Henri Devillez
dblp:295/4646
· DBLP profile ↗
4ranked-venue papers
4as first author
4since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 3 · 3 first-author · 3 since 2021Theory of computation · 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
2 papers |
Cryptographic protocols and secure computation · 81% Cryptographic primitives and cryptanalysis · 19% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › electronic voting
cast-as-intended verification |
0.8 | 1 | 2024 | Can we cast a ballot as intended and be receipt free? · SP 2024 |
Cryptographic protocols and secure computation
electronic voting |
0.8 | 1 | 2024 | Can we cast a ballot as intended and be receipt free? · SP 2024 |
Cryptographic protocols and secure computation › electronic voting
receipt-freeness |
0.8 | 1 | 2024 | Can we cast a ballot as intended and be receipt free? · SP 2024 |
Cryptographic primitives and cryptanalysis
encryption |
0.6 | 1 | 2022 | Traceable Receipt-Free Encryption · ASIACRYPT (3) 2022 |
Cryptographic protocols and secure computation
traceability |
0.2 | 1 | 2022 | Traceable Receipt-Free Encryption · ASIACRYPT (3) 2022 |
Methods — techniques the papers use, named apart from their topics
prototype implementation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Can we cast a ballot as intended and be receipt free?abstractThis paper explores the interaction between receipt- freeness and cast-as-intended verifiability, a property that has been overlooked until now or assumed to be granted through procedural means in the context of receipt-free voting protocols.We first demonstrate that it is impossible to obtain a receipt-free voting protocol with cast-as-intended verifiability if the voting process is non-interactive, unless a trusted authority is available. We also demonstrate that, if a trusted voter registration authority is available, then cast-as-intended verifiability and receipt-freeness can be obtained.Furthermore, after extending standard receipt-freeness security definitions to an interactive voting (and corruption) setting, we demonstrate that the same security properties can be obtained using an interactive voting process.Finally, we discuss the performance of our protocols based on a prototype implementation. Henri Devillez, Olivier Pereira, Thomas Peters, Quentin Yang |
SP | 1 |
| 2022 | Traceable Receipt-Free Encryption
Henri Devillez, Olivier Pereira, Thomas Peters |
ASIACRYPT (3) | 1 |
| 2022 | How to Verifiably Encrypt Many Bits for an Election?
Henri Devillez, Olivier Pereira, Thomas Peters |
ESORICS (2) | 1 |
| 2021 | Two-Agent Tree Evacuation
Henri Devillez, Beni Egressy, Robin Fritsch, Roger Wattenhofer |
SIROCCO | 1 |