Salvato in:
Dettagli Bibliografici
Autori principali: Yu, Jiping, Zhu, Xiaowei, Chen, Kun, Feng, Guanyu, Chen, Yunyi, Fan, Xiaoyu, Chen, Wenguang
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:https://arxiv.org/abs/2512.24255
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866908740624580608
author Yu, Jiping
Zhu, Xiaowei
Chen, Kun
Feng, Guanyu
Chen, Yunyi
Fan, Xiaoyu
Chen, Wenguang
author_facet Yu, Jiping
Zhu, Xiaowei
Chen, Kun
Feng, Guanyu
Chen, Yunyi
Fan, Xiaoyu
Chen, Wenguang
contents Trusted processors provide a way to perform joint computations while preserving data privacy. To overcome the performance degradation caused by data-oblivious algorithms to prevent information leakage, we explore the benefits of oblivious memory (OM) integrated in processors, to which the accesses are unobservable by adversaries. We focus on graph analytics, an important application vulnerable to access-pattern attacks. With a co-design between storage structure and algorithms, our prototype system is 100x faster than baselines given an OM sized around the per-core cache which can be implemented on existing processors with negligible overhead. This gives insights into equipping trusted processors with OM.
format Preprint
id arxiv_https___arxiv_org_abs_2512_24255
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle How Would Oblivious Memory Boost Graph Analytics on Trusted Processors?
Yu, Jiping
Zhu, Xiaowei
Chen, Kun
Feng, Guanyu
Chen, Yunyi
Fan, Xiaoyu
Chen, Wenguang
Cryptography and Security
Trusted processors provide a way to perform joint computations while preserving data privacy. To overcome the performance degradation caused by data-oblivious algorithms to prevent information leakage, we explore the benefits of oblivious memory (OM) integrated in processors, to which the accesses are unobservable by adversaries. We focus on graph analytics, an important application vulnerable to access-pattern attacks. With a co-design between storage structure and algorithms, our prototype system is 100x faster than baselines given an OM sized around the per-core cache which can be implemented on existing processors with negligible overhead. This gives insights into equipping trusted processors with OM.
title How Would Oblivious Memory Boost Graph Analytics on Trusted Processors?
topic Cryptography and Security
url https://arxiv.org/abs/2512.24255