Demo Data from SIGIR 2026 / reviewers in the wild / expert
Lea Nürnberger
dblp:341/2109
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0001-9074-1993ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 2 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 · 91% Cryptographic primitives and cryptanalysis · 9% |
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 › secure computation on encrypted data
multiparty homomorphic encryption |
0.8 | 1 | 2024 | Poster: Multiparty Private Set Intersection from Multiparty Homomorphic Encryption · CCS 2024 |
Cryptographic protocols and secure computation › private set intersection
multi-party private set intersection |
0.8 | 1 | 2024 | Poster: Multiparty Private Set Intersection from Multiparty Homomorphic Encryption · CCS 2024 |
Cryptographic protocols and secure computation
private set intersection |
0.8 | 1 | 2024 | Poster: Multiparty Private Set Intersection from Multiparty Homomorphic Encryption · CCS 2024 |
Cryptographic primitives and cryptanalysis
homomorphic encryption |
0.2 | 1 | 2024 | Poster: Multiparty Private Set Intersection from Multiparty Homomorphic Encryption · CCS 2024 |
Methods — techniques the papers use, named apart from their topics
multiparty homomorphic encryption · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Poster: Multiparty Private Set Intersection from Multiparty Homomorphic EncryptionabstractWe revisit the problem of constructing protocols for multiparty private set intersection (MPSI) in light of the recent advances in multiparty homomorphic encryption (MHE). In MPSI, N ≥ 2 parties jointly compute the intersection of their respective private set. Kissner and Song proposed an MHE-based MPSI scheme in 2005, but their approach was limited by the then-available HE schemes. Today, however, MHE schemes have become both more versatile and more efficient. As an early result, we implemented the MPSI approach of Kissner et al. with the recently proposed Helium framework (CCS 2024) for MHE-based MPC. We show that even this simple protocol can outperform the state-of-the-art implementation (in the passive-adversary setting) by Kolesnikov et al. (CCS 2017), both in terms of latency and communication cost. Christian Mouchet, Sylvain Chatel, Lea Nürnberger, Wouter Lueks |
CCS | 3 |
| 2023 | Optimisations and Tradeoffs for HElib
Anamaria Costache, Lea Nürnberger, Rachel Player |
CT-RSA | 2 |