default search action
Daniel Noble
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i9]Daniel Noble, Brett Hemenway, Rafail Ostrovsky:
MetaDORAM: Breaking the Log-Overhead Information Theoretic Barrier. Electron. Colloquium Comput. Complex. TR24 (2024) - [i8]Daniel Noble, Brett Hemenway Falk, Rafail Ostrovsky:
MetaDORAM: Breaking the Log-Overhead Information Theoretic Barrier. IACR Cryptol. ePrint Arch. 2024: 11 (2024) - 2023
- [c7]Brett Hemenway Falk, Daniel Noble, Tal Rabin:
Proactive Secret Sharing with Constant Communication. TCC (2) 2023: 337-373 - [c6]Brett Hemenway, Daniel Noble, Rafail Ostrovsky, Matan Shtepel, Jacob Zhang:
DORAM Revisited: Maliciously Secure RAM-MPC with Logarithmic Overhead. TCC (1) 2023: 441-470 - [i7]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky, Matan Shtepel, Jacob Zhang:
DORAM revisited: Maliciously secure RAM-MPC with logarithmic overhead. IACR Cryptol. ePrint Arch. 2023: 578 (2023) - [i6]Brett Hemenway Falk, Daniel Noble, Tal Rabin:
Proactive Secret Sharing with Constant Communication. IACR Cryptol. ePrint Arch. 2023: 942 (2023) - 2022
- [c5]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
3-Party Distributed ORAM from Oblivious Set Membership. SCN 2022: 437-461 - 2021
- [c4]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
Alibi: A Flaw in Cuckoo-Hashing Based Hierarchical ORAM Schemes and a Solution. EUROCRYPT (3) 2021: 338-369 - [i5]Daniel Noble:
An Intimate Analysis of Cuckoo Hashing with a Stash. IACR Cryptol. ePrint Arch. 2021: 447 (2021) - [i4]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
3-Party Distributed ORAM from Oblivious Set Membership. IACR Cryptol. ePrint Arch. 2021: 1463 (2021) - 2020
- [i3]Brett Hemenway Falk, Daniel Noble:
Secure Computation over Lattices and Elliptic Curves. IACR Cryptol. ePrint Arch. 2020: 926 (2020) - [i2]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
Alibi: A Flaw in Cuckoo-Hashing based Hierarchical ORAM Schemes and a Solution. IACR Cryptol. ePrint Arch. 2020: 997 (2020)
2010 – 2019
- 2019
- [c3]Edo Roth, Daniel Noble, Brett Hemenway Falk, Andreas Haeberlen:
Honeycrisp: large-scale differentially private aggregation without a trusted core. SOSP 2019: 196-210 - [c2]Marcella Hastings, Brett Hemenway, Daniel Noble, Steve Zdancewic:
SoK: General Purpose Compilers for Secure Multi-Party Computation. IEEE Symposium on Security and Privacy 2019: 1220-1237 - [c1]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
Private Set Intersection with Linear Communication from General Assumptions. WPES@CCS 2019: 14-25 - 2018
- [i1]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
Private Set Intersection with Linear Communication from General Assumptions. IACR Cryptol. ePrint Arch. 2018: 238 (2018)
Coauthor Index
aka: Brett Hemenway Falk
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-08-10 01:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint