default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Bienstock
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Alexander Bienstock, Sarvar Patel, Joon Young Seo, Kevin Yeo:
Batch PIR and Labeled PSI with Oblivious Ciphertext Compression. USENIX Security Symposium 2024- [i16]Alexander Bienstock, Ujjwal Kumar, Antigoni Polychroniadou:
DMM: Distributed Matrix Mechanism for Differentially-Private Federated Learning using Packed Secret Sharing. CoRR abs/2410.16161 (2024) - [i15]Alexander Bienstock, Sarvar Patel, Joon Young Seo, Kevin Yeo:
Batch PIR and Labeled PSI with Oblivious Ciphertext Compression. IACR Cryptol. ePrint Arch. 2024: 215 (2024) - [i14]Alexander Bienstock, Kevin Yeo:
Two Levels are Better than One: Dishonest Majority MPC with $\widetilde{O}(|C|)$ Total Communication. IACR Cryptol. ePrint Arch. 2024: 503 (2024) - [i13]Alexander Bienstock, Yevgeniy Dodis, Paul Rösler, Daniel Wichs:
Interval Key-Encapsulation Mechanism. IACR Cryptol. ePrint Arch. 2024: 1454 (2024) - [i12]Amit Agarwal, Alexander Bienstock, Ivan Damgård, Daniel Escudero:
Honest Majority GOD MPC with O(depth(C)) Rounds and Low Online Communication. IACR Cryptol. ePrint Arch. 2024: 1479 (2024) - [i11]Alexander Bienstock, Ujjwal Kumar, Antigoni Polychroniadou:
DMM: Distributed Matrix Mechanism for Differentially-Private Federated Learning using Packed Secret Sharing. IACR Cryptol. ePrint Arch. 2024: 1665 (2024) - 2023
- [c9]Alexander Bienstock
, Paul Rösler, Yi Tang:
ASMesh: Anonymous and Secure Messaging in Mesh Networks Using Stronger, Anonymous Double Ratchet. CCS 2023: 1-15 - [c8]Alexander Bienstock, Daniel Escudero, Antigoni Polychroniadou:
On Linear Communication Complexity for (Maximally) Fluid MPC. CRYPTO (1) 2023: 263-294 - [c7]Marshall Ball, Alexander Bienstock, Lisa Kohl, Pierre Meyer:
Towards Topology-Hiding Computation from Oblivious Transfer. TCC (1) 2023: 349-379 - [c6]Alexander Bienstock, Sarvar Patel, Joon Young Seo, Kevin Yeo:
Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps. USENIX Security Symposium 2023: 301-318 - [i10]Alexander Bienstock, Daniel Escudero, Antigoni Polychroniadou:
On Linear Communication Complexity for (Maximally) Fluid MPC. IACR Cryptol. ePrint Arch. 2023: 839 (2023) - [i9]Marshall Ball, Alexander Bienstock, Lisa Kohl, Pierre Meyer:
Towards Topology-Hiding Computation from Oblivious Transfer. IACR Cryptol. ePrint Arch. 2023: 849 (2023) - [i8]Alexander Bienstock, Sarvar Patel, Joon Young Seo, Kevin Yeo:
Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps. IACR Cryptol. ePrint Arch. 2023: 903 (2023) - [i7]Alexander Bienstock, Paul Rösler, Yi Tang:
ASMesh: Anonymous and Secure Messaging in Mesh Networks Using Stronger, Anonymous Double Ratchet. IACR Cryptol. ePrint Arch. 2023: 1053 (2023) - 2022
- [c5]Alexander Bienstock, Jaiden Fairoze, Sanjam Garg, Pratyay Mukherjee, Srinivasan Raghuraman:
A More Complete Analysis of the Signal Double Ratchet Algorithm. CRYPTO (1) 2022: 784-813 - [c4]Alexander Bienstock, Yevgeniy Dodis, Yi Tang:
Multicast Key Agreement, Revisited. CT-RSA 2022: 1-25 - [c3]Alexander Bienstock, Yevgeniy Dodis, Sanjam Garg, Garrison Grogan, Mohammad Hajiabadi, Paul Rösler:
On the Worst-Case Inefficiency of CGKA. TCC (2) 2022: 213-243 - [i6]Alexander Bienstock, Jaiden Fairoze, Sanjam Garg, Pratyay Mukherjee, Srinivasan Raghuraman:
A More Complete Analysis of the Signal Double Ratchet Algorithm. IACR Cryptol. ePrint Arch. 2022: 355 (2022) - [i5]Alexander Bienstock, Yevgeniy Dodis, Sanjam Garg, Garrison Grogan, Mohammad Hajiabadi, Paul Rösler:
On the Worst-Case Inefficiency of CGKA. IACR Cryptol. ePrint Arch. 2022: 1237 (2022) - 2021
- [c2]Alexander Bienstock, Yevgeniy Dodis, Kevin Yeo:
Forward Secret Encrypted RAM: Lower Bounds and Applications. TCC (3) 2021: 62-93 - [i4]Alexander Bienstock, Yevgeniy Dodis, Kevin Yeo:
Forward Secret Encrypted RAM: Lower Bounds and Applications. IACR Cryptol. ePrint Arch. 2021: 244 (2021) - [i3]Alexander Bienstock, Yevgeniy Dodis, Yi Tang:
Multicast Key Agreement, Revisited. IACR Cryptol. ePrint Arch. 2021: 1570 (2021) - 2020
- [c1]Alexander Bienstock, Yevgeniy Dodis, Paul Rösler:
On the Price of Concurrency in Group Ratcheting Protocols. TCC (2) 2020: 198-228 - [i2]Alexander Bienstock, Allison Bishop, Eli Goldin, Garrison Grogan, Victor Lecomte:
From discrete-log to lattices: maybe the real lessons were our broken schemes along the way? IACR Cryptol. ePrint Arch. 2020: 164 (2020) - [i1]Alexander Bienstock, Yevgeniy Dodis, Paul Rösler:
On the Price of Concurrency in Group Ratcheting Protocols. IACR Cryptol. ePrint Arch. 2020: 1171 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-27 20:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
