Alexander Bienstock

dblp:275/2933 · DBLP profile ↗
← Back
16ranked-venue papers
13as first author
15since 2021 · last 2026
0000-0001-7640-4974ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 15 · 12 first-author · 14 since 2021Theory of computation · 4 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 Actively Secure MPC with O(|C|) Computation and Communication via CRT
Alexander Bienstock, Daniel Escudero 0001, Antigoni Polychroniadou
CRYPTO (8)1
2025 Generic Anonymity Wrapper for Messaging Protocols
abstract
Modern messengers use advanced end-to-end encryption protocols to protect message content even if user secrets are ever temporarily exposed. Yet, encryption alone does not prevent user tracking, as protocols often attach metadata, such as sequence numbers, public keys, or even plain user identifiers. This metadata reveals the social network as well as communication patterns between users. Existing protocols that hide metadata in Signal (i.e., Sealed Sender), for MLS-like constructions (Hashimoto et al., CCS 2022), or in mesh networks (Bienstock et al., CCS 2023) are relatively inefficient or specially tailored for only particular settings. Moreover, all existing practical solutions reveal crucial metadata upon exposures of user secrets.
Lea Thiemt, Paul Rösler, Alexander Bienstock, Rolfe Schmidt, Yevgeniy Dodis
CCS3
2025 Weakly Super-Invertible Matrices and Constant Communication Dishonest Majority MPC
Alexander Bienstock, Kevin Yeo
EUROCRYPT (5)1
2025 DMM: Distributed Matrix Mechanism for Differentially-Private Federated Learning Based on Constant-Overhead Linear Secret Resharing
abstract
Federated Learning (FL) solutions with central Differential Privacy (DP) have seen large improvements in their utility in recent years arising from the matrix mechanism, while FL solutions with distributed (more private) DP have lagged behind. In this work, we introduce the distributed matrix mechanism to achieve the best-of-both-worlds; better privacy of distributed DP and better utility from the matrix mechanism. We accomplish this using a novel cryptographic protocol that securely transfers sensitive values across client committees of different training iterations with constant communication overhead. This protocol accommodates the dynamic participation of users required by FL, including those that may drop out from the computation. We provide experiments which show that our mechanism indeed significantly improves the utility of FL models compared to previous distributed DP mechanisms, with little added overhead.
Alexander Bienstock, Ujjwal Kumar, Antigoni Polychroniadou
ICML1
2024 Honest Majority GOD MPC with O(sfdepth(C)) Rounds and Low Online Communication
Alexander Bienstock, Ivan Damgård, Daniel Escudero 0001
ASIACRYPT (6)2
2024 Interval Key-Encapsulation Mechanism
Alexander Bienstock, Yevgeniy Dodis, Paul Rösler, Daniel Wichs
ASIACRYPT (2)1
2024 Batch PIR and Labeled PSI with Oblivious Ciphertext Compression
Alexander Bienstock, Sarvar Patel, Joon Young Seo, Kevin Yeo
USENIX Security Symposium1
2023 ASMesh: Anonymous and Secure Messaging in Mesh Networks Using Stronger, Anonymous Double Ratchet
abstract
The majority of secure messengers have single, centralized service providers that relay ciphertexts between users to enable asynchronous communication. However, in some scenarios such as mass protests in censored networks, relying on a centralized provider is fatal. Mesh messengers attempt to solve this problem by building ad hoc networks in which user clients perform the ciphertext-relaying task. Yet, recent analyses of widely deployed mesh messengers discover severe security weaknesses (Albrecht et al. CT-RSA'21 & USENIX Security'22).
Alexander Bienstock, Paul Rösler, Yi Tang 0012
CCS1
2023 On Linear Communication Complexity for (Maximally) Fluid MPC
Alexander Bienstock, Daniel Escudero 0001, Antigoni Polychroniadou
CRYPTO (1)1
2023 Towards Topology-Hiding Computation from Oblivious Transfer
Marshall Ball, Alexander Bienstock, Lisa Kohl, Pierre Meyer
TCC (1)2
2023 Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps
Alexander Bienstock, Sarvar Patel, Joon Young Seo, Kevin Yeo
USENIX Security Symposium1
2022 A More Complete Analysis of the Signal Double Ratchet Algorithm
Alexander Bienstock, Jaiden Fairoze, Sanjam Garg, Pratyay Mukherjee, Srinivasan Raghuraman
CRYPTO (1)1
2022 Multicast Key Agreement, Revisited
Alexander Bienstock, Yevgeniy Dodis, Yi Tang 0012
CT-RSA1
2022 On the Worst-Case Inefficiency of CGKA
Alexander Bienstock, Yevgeniy Dodis, Sanjam Garg, Garrison Grogan, Mohammad Hajiabadi, Paul Rösler
TCC (2)1
2021 Forward Secret Encrypted RAM: Lower Bounds and Applications
Alexander Bienstock, Yevgeniy Dodis, Kevin Yeo
TCC (3)1
2020 On the Price of Concurrency in Group Ratcheting Protocols
Alexander Bienstock, Yevgeniy Dodis, Paul Rösler
TCC (2)1