Alexander Bienstock

I am a fifth year PhD student advised by Professor Yevgeniy Dodis and Professor Marshall Ball in the Cryptography Lab at NYU. I received my B.S. in Computer Science from Columbia University in May 2019, where I worked with Professor Allison Bishop. I am fortunate enough to be supported by an NSF Graduate Research Fellowship and a Google PhD Fellowship.

I am interested in applied cryptography, particularly secure Multi-Party Computation (MPC). My current research focuses on making MPC more practical, both for specific functionalities like Private Set Intersection, as well as for general computation. I have also studied Secure (Group) Messaging and Private Outsourced Storage protocols in the past.

Publications

Two Levels are Better than One: Dishonest Majority MPC with ~O(|C|) Total Communication
Honest Majority GOD MPC with O(depth(C)) Rounds and O(n|C|) Online Communication
Perfectly Secure Fluid MPC with Abort and Linear Communication Complexity
Batch PIR and Labeled PSI with Oblivious Ciphertext Compression
Towards Topology-Hiding Computation from Oblivious Transfer
Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps
On Linear Communication Complexity for (Maximally) Fluid MPC
ASMesh: Secure Messaging in Mesh Networks Using Stronger, Anonymous Double Ratchet
On the Worst-Case Inefficiency of CGKA
A More Complete Analysis of the Signal Double Ratchet Algorithm
Multicast Key Agreement, Revisited
Forward Secret Encrypted RAM: Lower Bounds and Applications
On the Price of Concurrency in Group Ratcheting Protocols
From discrete-log to lattices: maybe the real lessons were our broken schemes along the way?

Teaching

Fundamental Algorithms
Basic Algorithms
Computer Science Theory
Malware Analysis & Reverse Engineering
Computing in Context

Contact