Daniel Noble

Orcid: 0000-0001-9449-159X

According to our database1, Daniel Noble authored at least 12 papers between 2019 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
On some Properties of Sticker Systems.
J. Autom. Lang. Comb., 2025

MetaDORAM: Info-Theoretic Distributed ORAM with Less Communication.
Proceedings of the 6th Conference on Information-Theoretic Cryptography, 2025

2024
MetaDORAM: Breaking the Log-Overhead Information Theoretic Barrier.
Electron. Colloquium Comput. Complex., 2024

2023
DORAM Revisited: Maliciously Secure RAM-MPC with Logarithmic Overhead.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Proactive Secret Sharing with Constant Communication.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

2022
3-Party Distributed ORAM from Oblivious Set Membership.
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

2021
An Intimate Analysis of Cuckoo Hashing with a Stash.
IACR Cryptol. ePrint Arch., 2021

Alibi: A Flaw in Cuckoo-Hashing Based Hierarchical ORAM Schemes and a Solution.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2020
Secure Computation over Lattices and Elliptic Curves.
IACR Cryptol. ePrint Arch., 2020

2019
Private Set Intersection with Linear Communication from General Assumptions.
Proceedings of the 18th ACM Workshop on Privacy in the Electronic Society, 2019

SoK: General Purpose Compilers for Secure Multi-Party Computation.
Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019

Honeycrisp: large-scale differentially private aggregation without a trusted core.
Proceedings of the 27th ACM Symposium on Operating Systems Principles, 2019


  Loading...