Alexander Bienstock

Orcid: 0000-0001-7640-4974

According to our database1, Alexander Bienstock authored at least 21 papers between 2020 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Generic Anonymity Wrapper for Messaging Protocols.
IACR Cryptol. ePrint Arch., 2025

Efficient, Scalable Threshold ML-DSA Signatures: An MPC Approach.
IACR Cryptol. ePrint Arch., 2025

Weakly Super-Invertible Matrices and Constant Communication Dishonest Majority MPC.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

2024
On Efficient Instantiations of Secure Multi-Party Computation in Practice
PhD thesis, 2024

Two Levels are Better than One: Dishonest Majority MPC with $\widetilde{O}(|C|)$ Total Communication.
IACR Cryptol. ePrint Arch., 2024

DMM: Distributed Matrix Mechanism for Differentially-Private Federated Learning using Packed Secret Sharing.
IACR Cryptol. ePrint Arch., 2024

Honest Majority GOD MPC with O(depth(C)) Rounds and Low Online Communication.
IACR Cryptol. ePrint Arch., 2024

Perfectly Secure Fluid MPC with Abort and Linear Communication Complexity.
IACR Commun. Cryptol., 2024

Batch PIR and Labeled PSI with Oblivious Ciphertext Compression.
Proceedings of the 33rd USENIX Security Symposium, 2024

Interval Key-Encapsulation Mechanism.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

Honest Majority GOD MPC with O(sfdepth(C)) Rounds and Low Online Communication.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps.
Proceedings of the 32nd USENIX Security Symposium, 2023

Towards Topology-Hiding Computation from Oblivious Transfer.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

On Linear Communication Complexity for (Maximally) Fluid MPC.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

ASMesh: Anonymous and Secure Messaging in Mesh Networks Using Stronger, Anonymous Double Ratchet.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
On the Worst-Case Inefficiency of CGKA.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Multicast Key Agreement, Revisited.
Proceedings of the Topics in Cryptology - CT-RSA 2022, 2022

A More Complete Analysis of the Signal Double Ratchet Algorithm.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Forward Secret Encrypted RAM: Lower Bounds and Applications.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

2020
From discrete-log to lattices: maybe the real lessons were our broken schemes along the way?
IACR Cryptol. ePrint Arch., 2020

On the Price of Concurrency in Group Ratcheting Protocols.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020


  Loading...