Demo Data from EDBT 2026 / reviewers in the wild / expert
Bhavesh Sharma
dblp:275/3503
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 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 protocols and secure computation · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Program verification · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › electronic voting
verifiable mix nets |
0.5 | 1 | 2021 | Did you mix me? Formally Verifying Verifiable Mix Nets in Electronic Voting · SP 2021 |
Cryptographic protocols and secure computation › electronic voting
verifiable voting |
0.5 | 1 | 2021 | Did you mix me? Formally Verifying Verifiable Mix Nets in Electronic Voting · SP 2021 |
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
0.5 | 1 | 2021 | Did you mix me? Formally Verifying Verifiable Mix Nets in Electronic Voting · SP 2021 |
Program verification › security property verification
verified cryptographic implementation |
0.1 | 1 | 2021 | Did you mix me? Formally Verifying Verifiable Mix Nets in Electronic Voting · SP 2021 |
Methods — techniques the papers use, named apart from their topics
theorem proving · 1.0formal methods · 1.0code extraction · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Did you mix me? Formally Verifying Verifiable Mix Nets in Electronic VotingabstractVerifiable mix nets, and specifically proofs of (correct) shuffle, are a fundamental building block in numerous applications: these zero-knowledge proofs allow the prover to produce a public transcript which can be perused by the verifier to confirm the purported shuffle. They are particularly vital to verifiable electronic voting, where they underpin almost all voting schemes with non-trivial tallying methods. These complicated pieces of cryptography are a prime location for critical errors which might allow undetected modification of the outcome.The best solution to preventing these errors is to machine-check the cryptographic properties of the design and implementation of the mix net. Particularly crucial for the integrity of the outcome is the soundness of the design and implementation of the verifier (software). Unfortunately, several different encryption schemes are used in many different slight variations which makes it infeasible to machine-check every single case individually. However, a particular optimised variant of the Terelius-Wikström mix net is, and has been, widely deployed in elections including national elections in Norway, Estonia and Switzerland, albeit with many slight variations and several different encryption schemes.In this work, we develop the logical theory and formal methods tools to machine-check the design and implementation of all these variants of Terelius-Wikström mix nets, for all the different encryption schemes used; resulting in provably correct mix nets for all these different variations. We do this carefully to ensure that we can extract a formally verified implementation of the verifier (software) which is compatible with existing deployed implementations of the Terelius-Wikström mix net. This gives us provably correct implementations of the verifiers for more than half of the national elections which have used verifiable mix nets.Our implementation of a proof of correct shuffle is the first to be machine-checked to be cryptographically correct and able to verify proof transcripts from national elections. We demonstrate the practicality of our implementation by verifying transcripts produced by the Verificatum mix net system and the CHVote e-voting system from Switzerland. Thomas Haines, Rajeev Goré, Bhavesh Sharma |
SP | 3 |