关注
Daniel Noble
Daniel Noble
在 seas.upenn.edu 的电子邮件经过验证
标题
引用次数
引用次数
年份
Sok: General purpose compilers for secure multi-party computation
M Hastings, B Hemenway, D Noble, S Zdancewic
2019 IEEE Symposium on Security and Privacy (SP), 1220-1237, 2019
2242019
Honeycrisp: large-scale differentially private aggregation without a trusted core
E Roth, D Noble, BH Falk, A Haeberlen
Proceedings of the 27th ACM Symposium on Operating Systems Principles, 196-210, 2019
672019
Private set intersection with linear communication from general assumptions
B Hemenway Falk, D Noble, R Ostrovsky
Proceedings of the 18th ACM Workshop on Privacy in the Electronic Society, 14-25, 2019
652019
Alibi: A flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
B Hemenway Falk, D Noble, R Ostrovsky
Annual International Conference on the Theory and Applications of …, 2021
122021
3-Party Distributed ORAM from Oblivious Set Membership
D Noble, R Ostrovsky, BH Falk
Security and Cryptography for Networks: 13th International Conference, SCN …, 2022
11*2022
Explicit, Closed-form, General bounds for Cuckoo Hashing with a Stash
D Noble
Cryptology ePrint Archive, 2021
9*2021
Alibi: A flaw in cuckoo-hashing based hierarchical oram schemes and a solution
BH Falk, D Noble, R Ostrovsky
Cryptology ePrint Archive, 2020
72020
Secure computation over lattices and elliptic curves
BH Falk, D Noble
Cryptology ePrint Archive, 2020
62020
DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
B Falk, D Noble, R Ostrovsky, M Shtepel, J Zhang
Theory of Cryptography Conference, 441-470, 2023
32023
Honeycrisp: Large-scale differentially private aggregation without a trusted core (extended version)
E Roth, D Noble, BH Falk, A Haeberlen
Tech. rep., Technical Report MS-CIS-19-03, University of Pennsylvania, 2019
22019
Distributed oblivious RAM: progress and pitfalls
DG Noble
University of Pennsylvania, 2024
12024
MetaDORAM: Info-Theoretic Distributed ORAM with Less Communication
BH Falk, D Noble, R Ostrovsky
Cryptology ePrint Archive, 2024
12024
MetaDORAM: Breaking the Log-Overhead Information Theoretic Barrier.
D Noble, BH Falk, R Ostrovsky
IACR Cryptol. ePrint Arch. 2024, 11, 2024
12024
Proactive Secret Sharing with Constant Communication
BH Falk, D Noble, T Rabin
Theory of Cryptography Conference, 337-373, 2023
12023
Private Set Intersection with Linear Communication from General Assumptions.
BH Falk, D Noble, R Ostrovsky
IACR Cryptol. ePrint Arch. 2018, 238, 2018
2018
系统目前无法执行此操作,请稍后再试。
文章 1–15