Elisaweta Masserova

dblp:153/0946 · DBLP profile ↗
← Back
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
YearPublicationVenuePosition
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
EUROCRYPT2
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
FC2
2025 Brief Announcement: Towards Scalable YOSO MPC via Packed Secret-Sharing
abstract
The 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
PODC2
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 Patterns
abstract
Talek 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
ACSAC3