default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin E. Diamond
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Benjamin E. Diamond, Jim Posen:
Proximity Testing with Logarithmic Randomness. IACR Commun. Cryptol. 1(1): 2 (2024)- [j3]Benjamin E. Diamond, Angus Gruen:
Proximity Gaps in Interleaved Codes. IACR Commun. Cryptol. 1(4): 8 (2024) - [i11]Benjamin E. Diamond, Jim Posen:
Polylogarithmic Proofs for Multilinears over Binary Towers. IACR Cryptol. ePrint Arch. 2024: 504 (2024) - [i10]Benjamin E. Diamond, Angus Gruen:
Proximity Gaps in Interleaved Codes. IACR Cryptol. ePrint Arch. 2024: 1351 (2024) - 2023
- [j2]Sahar Mazloom, Benjamin E. Diamond, Antigoni Polychroniadou, Tucker Balch:
An Efficient Data-Independent Priority Queue and its Application to Dark Pools. Proc. Priv. Enhancing Technol. 2023(2): 5-22 (2023) - [c3]Antigoni Polychroniadou, Gilad Asharov, Benjamin E. Diamond, Tucker Balch, Hans Buehler, Richard Hua, Suwen Gu, Greg Gimler, Manuela Veloso:
Prime Match: A Privacy-Preserving Inventory Matching System. USENIX Security Symposium 2023: 6417-6434 - [i9]Antigoni Polychroniadou, Gilad Asharov, Benjamin E. Diamond, Tucker Balch, Hans Buehler, Richard Hua, Suwen Gu, Greg Gimler, Manuela Veloso:
Prime Match: A Privacy-Preserving Inventory Matching System. CoRR abs/2310.09621 (2023) - [i8]Antigoni Polychroniadou, Gilad Asharov, Benjamin E. Diamond, Tucker Balch, Hans Buehler, Richard Hua, Suwen Gu, Greg Gimler, Manuela Veloso:
Prime Match: A Privacy-Preserving Inventory Matching System. IACR Cryptol. ePrint Arch. 2023: 400 (2023) - [i7]Benjamin E. Diamond, Jim Posen:
Proximity Testing with Logarithmic Randomness. IACR Cryptol. ePrint Arch. 2023: 630 (2023) - [i6]Sahar Mazloom, Benjamin E. Diamond, Antigoni Polychroniadou, Tucker Balch:
An Efficient Data-Independent Priority Queue and its Application to Dark Pools. IACR Cryptol. ePrint Arch. 2023: 1014 (2023) - [i5]Benjamin E. Diamond, Jim Posen:
Succinct Arguments over Towers of Binary Fields. IACR Cryptol. ePrint Arch. 2023: 1784 (2023) - 2022
- [j1]Benjamin E. Diamond, Amir Yehudayoff:
Explicit exponential lower bounds for exact hyperplane covers. Discret. Math. 345(11): 113114 (2022) - [i4]Benjamin E. Diamond:
On the Security of KOS. IACR Cryptol. ePrint Arch. 2022: 1371 (2022) - 2021
- [c2]Benjamin E. Diamond:
Many-out-of-Many Proofs and Applications to Anonymous Zether. SP 2021: 1800-1817 - [i3]Benjamin E. Diamond, Amir Yehudayoff:
Explicit Exponential Lower Bounds for Exact Hyperplane Covers. Electron. Colloquium Comput. Complex. TR21 (2021) - [i2]Benjamin E. Diamond:
Boolean Functions from Hyperplane Coverings. IACR Cryptol. ePrint Arch. 2021: 146 (2021) - 2020
- [c1]Tucker Balch, Benjamin E. Diamond, Antigoni Polychroniadou:
SecretMatch: inventory matching from fully homomorphic encryption. ICAIF 2020: 15:1-15:7 - [i1]Benjamin E. Diamond:
"Many-out-of-Many" Proofs with Applications to Anonymous Zether. IACR Cryptol. ePrint Arch. 2020: 293 (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 2025-02-12 00:03 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:
