Demo Data from SIGIR 2026 / reviewers in the wild / expert
Marta Mularczyk
dblp:204/5151
· DBLP profile ↗
11ranked-venue papers
0as first author
6since 2021 · last 2026
0000-0002-9462-1275ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 11 · 6 since 2021Theory of computation · 3
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 · 62% Cryptographic primitives and cryptanalysis · 38% |
Topics — the 13 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key encryption |
1.4 | 2 | 2024 | Updatable Public-Key Encryption, Revisited · EUROCRYPT (6) 2024 Post-Quantum Multi-Recipient Public Key Encryption · CCS 2023 |
Cryptographic protocols and secure computation › key exchange › group key agreement
continuous group key agreement |
1.2 | 2 | 2023 | Fork-Resilient Continuous Group Key Agreement · CRYPTO (4) 2023 Server-Aided Continuous Group Key Agreement · CCS 2022 |
Cryptographic protocols and secure computation › secure messaging
secure group messaging |
1.1 | 2 | 2022 | On the Insider Security of MLS · CRYPTO (2) 2022 Server-Aided Continuous Group Key Agreement · CCS 2022 |
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
updatable public-key encryption |
0.8 | 1 | 2024 | Updatable Public-Key Encryption, Revisited · EUROCRYPT (6) 2024 |
Cryptographic protocols and secure computation › key exchange
group key agreement |
0.7 | 1 | 2023 | Fork-Resilient Continuous Group Key Agreement · CRYPTO (4) 2023 |
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
multi-recipient encryption |
0.7 | 1 | 2023 | Post-Quantum Multi-Recipient Public Key Encryption · CCS 2023 |
Cryptographic primitives and cryptanalysis
post-quantum cryptography |
0.7 | 1 | 2023 | Post-Quantum Multi-Recipient Public Key Encryption · CCS 2023 |
Cryptographic protocols and secure computation
communication complexity |
0.6 | 1 | 2022 | Server-Aided Continuous Group Key Agreement · CCS 2022 |
Cryptographic protocols and secure computation › secure messaging
end-to-end encryption |
0.6 | 1 | 2022 | Server-Aided Continuous Group Key Agreement · CCS 2022 |
Cryptographic protocols and secure computation › secure messaging › secure group messaging
messaging layer security |
0.6 | 1 | 2022 | On the Insider Security of MLS · CRYPTO (2) 2022 |
Cryptographic protocols and secure computation › secure messaging
ratcheting |
0.4 | 1 | 2019 | Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging · EUROCRYPT (1) 2019 |
Cryptographic protocols and secure computation
secure messaging |
0.4 | 1 | 2019 | Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging · EUROCRYPT (1) 2019 |
Cryptographic protocols and secure computation
key exchange |
0.1 | 1 | 2019 | Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging · EUROCRYPT (1) 2019 |
Methods — techniques the papers use, named apart from their topics
security analysis · 1.3post-quantum construction · 0.7server-aided protocol design · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Lattice-Based Updatable KEM for Group Messaging
Joël Alwen, Georg Fuchsbauer, Marta Mularczyk, Doreen Riepel |
CRYPTO (10) | 3 |
| 2024 | Updatable Public-Key Encryption, Revisited
Joël Alwen, Georg Fuchsbauer, Marta Mularczyk |
EUROCRYPT (6) | 3 |
| 2023 | Post-Quantum Multi-Recipient Public Key EncryptionabstractA multi-message multi-recipient PKE (mmPKE) encrypts a batch of messages, in one go, to a corresponding set of independently chosen receiver public keys. The resulting ''multi-recipient ciphertext'' can be then be reduced (by any 3rd party) to a shorter, receiver specific, ''invidual ciphertext.'' Finally, to recover the i-th message in the batch from their indvidual ciphertext the i-th receiver only needs their own decryption key. A special case of mmPKE is multi-recipient PKE (mPKE) where all receivers are sent the same message. By treating (m)mPKE and their KEM counterparts as a stand-alone primitives we allow for more efficient constructions than trivially composing individual PKE/KEM instances. This is especially valuable in the post-quantum setting, where PKE/KEM ciphertexts and public keys tend to be far larger than their classic counterparts. Joël Alwen, Dominik Hartmann, Eike Kiltz, Marta Mularczyk, Peter Schwabe |
CCS | 4 |
| 2023 | Fork-Resilient Continuous Group Key Agreement
Joël Alwen, Marta Mularczyk, Yiannis Tselekounis |
CRYPTO (4) | 2 |
| 2022 | Server-Aided Continuous Group Key AgreementabstractContinuous Group Key Agreement (CGKA) -- or Group Ratcheting -- lies at the heart of a new generation of scalable End-to-End secure (E2E) cryptographic multi-party applications. One of the most important (and first deployed) CGKAs is ITK which underpins the IETF's upcoming Messaging Layer Security E2E secure group messaging standard. To scale beyond the group sizes possible with earlier E2E protocols, a central focus of CGKA protocol design is to minimize bandwidth requirements (i.e. communication complexity). Joël Alwen, Dominik Hartmann, Eike Kiltz, Marta Mularczyk |
CCS | 4 |
| 2022 | On the Insider Security of MLS
Joël Alwen, Daniel Jost 0001, Marta Mularczyk |
CRYPTO (2) | 3 |
| 2020 | Continuous Group Key Agreement with Active Security
Joël Alwen, Sandro Coretti, Daniel Jost 0001, Marta Mularczyk |
TCC (2) | 4 |
| 2019 | Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging
Daniel Jost 0001, Ueli Maurer, Marta Mularczyk |
EUROCRYPT (1) | 3 |
| 2019 | A Unified and Composable Take on Ratcheting
Daniel Jost 0001, Ueli Maurer, Marta Mularczyk |
TCC (2) | 3 |
| 2018 | Topology-Hiding Computation Beyond Semi-Honest Adversaries
Rio LaVigne, Chen-Da Liu-Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, Daniel Tschudi |
TCC (2) | 5 |
| 2017 | Privacy-preserving Regression on Partially Encrypted Data
Matús Harvan, Thomas Locher, Marta Mularczyk, Yvonne-Anne Pignolet |
SECRYPT | 3 |