Demo Data from SIGIR 2026 / reviewers in the wild / expert
Elisaweta Masserova
dblp:153/0946
· DBLP profile ↗
9ranked-venue papers
0as first author
8since 2021 · last 2026
0009-0002-8970-9624ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 8 · 7 since 2021Systems, architecture and hardware · 1 · 1 since 2021Theory of computation · 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
4 papers |
Cryptographic protocols and secure computation · 100% | |
| Theoretical computer science
2 papers |
Algorithmic game theory and mechanism design · 54% Distributed computing theory · 46% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 4 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation
secure multiparty computation |
1.7 | 2 | 2025 | Brief Announcement: Towards Scalable YOSO MPC via Packed Secret-Sharing · PODC 2025 Towards Scalable YOSO MPC via Packed Secret-Sharing · ASIACRYPT (5) 2025 |
Cryptographic protocols and secure computation › coin flipping
multiparty coin tossing |
1.0 | 1 | 2026 | Game Theory Does Not Always Help: The Case of Statistical Multi-party Coin Tossing · EUROCRYPT 2026 |
Cryptographic protocols and secure computation
distributed randomness |
0.9 | 1 | 2025 | Efficient Distributed Randomness Generation from Minimal Assumptions Where PArties Speak Sequentially Once · EUROCRYPT (5) 2025 |
Distributed computing theory › distributed algorithms
distributed protocols |
0.3 | 1 | 2025 | Efficient Distributed Randomness Generation from Minimal Assumptions Where PArties Speak Sequentially Once · EUROCRYPT (5) 2025 |
Methods — techniques the papers use, named apart from their topics
game theory · 2.0packed secret-sharing · 0.9packed secret sharing · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Feasibility of Broadcast with Dynamic Committees
Gabriel Dettling, Chen-Da Liu-Zhang, Elisaweta Masserova, Matthieu Rambaud, Antoine Urban |
CRYPTO (8) | 3 |
| 2026 | Game Theory Does Not Always Help: The Case of Statistical Multi-party Coin Tossing
Chen-Da Liu-Zhang, Elisaweta Masserova, João Ribeiro 0002, Sri Aravinda Krishnan Thyagarajan |
EUROCRYPT | 2 |
| 2025 | Towards Scalable YOSO MPC via Packed Secret-Sharing
Daniel Escudero 0001, Elisaweta Masserova, Antigoni Polychroniadou |
ASIACRYPT (5) | 2 |
| 2025 | Efficient Distributed Randomness Generation from Minimal Assumptions Where PArties Speak Sequentially Once
Chen-Da Liu-Zhang, Elisaweta Masserova, João Ribeiro 0002, Pratik Soni, Sri Aravinda Krishnan Thyagarajan |
EUROCRYPT (5) | 2 |
| 2025 | Rapidash: Atomic Swaps Secure Under User-Miner Collusion
Hao Chung, Elisaweta Masserova, Elaine Shi, Sri Aravinda Krishnan Thyagarajan |
FC | 2 |
| 2025 | Brief Announcement: Towards Scalable YOSO MPC via Packed Secret-SharingabstractThe YOSO (You Only Speak Once) model, introduced by Gentry et al. (CRYPTO 2021), helps to achieve strong security guarantees in cryptographic protocols for large-scale distributed settings. Daniel Escudero 0001, Elisaweta Masserova, Antigoni Polychroniadou |
PODC | 2 |
| 2024 | Improved YOSO Randomness Generation with Worst-Case Corruptions
Chen-Da Liu-Zhang, Elisaweta Masserova, João Ribeiro 0002, Pratik Soni, Sri Aravinda Krishnan Thyagarajan |
FC (2) | 2 |
| 2021 | Blockchains Enable Non-interactive MPC
Vipul Goyal, Elisaweta Masserova, Bryan Parno, Yifan Song 0001 |
TCC (2) | 2 |
| 2020 | Talek: Private Group Messaging with Hidden Access PatternsabstractTalek is a private group messaging system that sends messages through potentially untrustworthy servers, while hiding both data content and the communication patterns among its users. Talek explores a new point in the design space of private messaging; it guarantees access sequence indistinguishability, which is among the strongest guarantees in the space, while assuming an anytrust threat model, which is only slightly weaker than the strongest threat model currently found in related work. Our results suggest that this is a pragmatic point in the design space, since it supports strong privacy and good performance: we demonstrate a 3-server Talek cluster that achieves throughput of 9,433 messages/second for 32,000 active users with 1.7-second end-to-end latency. To achieve its security goals without coordination between clients, Talek relies on information-theoretic private information retrieval. To achieve good performance and minimize server-side storage, Talek introduces new techniques and optimizations that may be of independent interest, e.g., a novel use of blocked cuckoo hashing and support for private notifications. The latter provide a private, efficient mechanism for users to learn, without polling, which logs have new messages. Raymond Cheng 0001, William Scott 0002, Elisaweta Masserova, Irene Zhang, Vipul Goyal, Thomas E. Anderson, Arvind Krishnamurthy, Bryan Parno |
ACSAC | 3 |