Demo Data from EDBT 2026 / reviewers in the wild / expert
Esther Hänggi
dblp:10/2303
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2013
0000-0002-9760-8535ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 2 first-authorSecurity and privacy · 2 · 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
1 paper |
Cryptographic protocols and secure computation · 100% | |
| Theoretical computer science
2 papers |
Quantum computing and quantum information · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › commitment schemes
bit commitment |
0.2 | 1 | 2013 | Secure Bit Commitment From Relativistic Constraints · IEEE Trans. Inf. Theory 2013 |
Quantum computing and quantum information › quantum cryptography
quantum key distribution |
0.1 | 1 | 2010 | Efficient Device-Independent Quantum Key Distribution · EUROCRYPT 2010 |
Quantum computing and quantum information
quantum cryptography |
0.0 | 1 | 2013 | Secure Bit Commitment From Relativistic Constraints · IEEE Trans. Inf. Theory 2013 |
Methods — techniques the papers use, named apart from their topics
uncertainty principle · 0.3no-signaling principle · 0.3quantum cryptography · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Classical, quantum and nonsignalling resources in bipartite games
Gilles Brassard, Anne Broadbent, Esther Hänggi, André Allan Méthot, Stefan Wolf 0001 |
Theor. Comput. Sci. | 3 |
| 2013 | The impossibility of non-signaling privacy amplification
Esther Hänggi, Renato Renner, Stefan Wolf 0001 |
Theor. Comput. Sci. | 1 |
| 2013 | Secure Bit Commitment From Relativistic ConstraintsabstractWe investigate two-party cryptographic protocols that are secure under assumptions motivated by physics, namely special relativity and quantum mechanics. In particular, we discuss the security of bit commitment in the so-called split models, i.e., models in which at least one of the parties is not allowed to communicate during certain phases of the protocol. We find the minimal splits that are necessary to evade the Mayers-Lo-Chau no-go argument and present protocols that achieve security in these split models. Furthermore, we introduce the notion of local versus global command, a subtle issue that arises when the split committer is required to delegate noncommunicating agents to open the commitment. We argue that classical protocols are insecure under global command in the split model we consider. On the other hand, we provide a rigorous security proof in the global command model for Kent's quantum protocol. The proof employs two fundamental principles of modern physics, the no-signaling property of relativity and the uncertainty principle of quantum mechanics. Jedrzej Kaniewski, Marco Tomamichel, Esther Hänggi, Stephanie Wehner |
IEEE Trans. Inf. Theory | 3 |
| 2011 | Tight Bounds for Classical and Quantum Coin Flipping
Esther Hänggi, Jürg Wullschleger |
TCC | 1 |
| 2010 | Efficient Device-Independent Quantum Key Distribution
Esther Hänggi, Renato Renner, Stefan Wolf 0001 |
EUROCRYPT | 1 |