中文
相关论文

相关论文: Single Round-trip Hierarchical ORAM via Succinct I…

200 篇论文

Oblivious RAM (ORAM) is a cryptographic primitive that allows a client to securely execute RAM programs over data that is stored in an untrusted server. Distributed Oblivious RAM is a variant of ORAM, where the data is stored in $m>1$…

密码学与安全 · 计算机科学 2018-11-20 Eyal Kushilevitz , Tamer Mour

Reducing the database space overhead is critical in big-data processing. In this paper, we revisit oblivious RAM (ORAM) using big-data standard for the database space overhead. ORAM is a cryptographic primitive that enables users to perform…

数据结构与算法 · 计算机科学 2018-04-24 Taku Onodera , Tetsuo Shibuya

Oblivious RAM (ORAM) is a cryptographic primitive which obfuscates the access patterns to a storage thereby preventing privacy leakage. So far in the current literature, only `fully functional' ORAMs are widely studied which can protect, at…

硬件体系结构 · 计算机科学 2017-09-12 Syed Kamran Haider , Marten van Dijk

Modern processors, e.g., Intel SGX, allow applications to isolate secret code and data in encrypted memory regions called enclaves. While encryption effectively hides the contents of memory, the sequence of address references issued by the…

密码学与安全 · 计算机科学 2017-12-22 Manuel Costa , Lawrence Esswood , Olga Ohrimenko , Felix Schuster , Sameer Wagh

Oblivious RAM (ORAM) allows a client to securely retrieve elements from outsourced servers without leakage about the accessed elements or their virtual addresses. Two-server ORAM, designed for secure two-party RAM computation, stores data…

密码学与安全 · 计算机科学 2025-04-17 Wei Wang , Xianglong Zhang , Peng Xu , Rongmao Chen , Laurence Tianruo Yang

We present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of client storage. Partly due to its simplicity, Path ORAM is the most practical ORAM scheme known to date with small client storage. We formally prove…

Oblivious RAM protocols (ORAMs) allow a client to access data from an untrusted storage device without revealing the access patterns. Typically, the ORAM adversary can observe both read and write accesses. Write-only ORAMs target a more…

密码学与安全 · 计算机科学 2019-08-20 Anrin Chakraborti , Radu Sion

Oblivious RAM (ORAM) is a renowned technique to hide the access patterns of an application to an untrusted memory. According to the standard ORAM definition presented by Goldreich and Ostrovsky, two ORAM access sequences must be…

密码学与安全 · 计算机科学 2017-10-24 Syed Kamran Haider , Omer Khan , Marten van Dijk

Oblivious RAM (ORAM) hides the memory access patterns, enhancing data privacy by preventing attackers from discovering sensitive information based on the sequence of memory accesses. The performance of ORAM is often limited by its inherent…

密码学与安全 · 计算机科学 2024-11-11 Haojie Ye , Yuchen Xia , Yuhan Chen , Kuan-Yu Chen , Yichao Yuan , Shuwen Deng , Baris Kasikci , Trevor Mudge , Nishil Talati

Oblivious RAM (ORAM) is a well-researched primitive to hide the memory access pattern of a RAM computation; it has a variety of applications in trusted computing, outsourced storage, and multiparty computation. In this paper, we study the…

数据结构与算法 · 计算机科学 2024-12-16 Thore Thießen , Jan Vahrenhold

Oblivious RAM (ORAM) is a provable secure primitive to prevent access pattern leakage on the memory bus. It serves as the intermediate layer between the trusted on-chip components and the untrusted external memory systems to modulate the…

硬件体系结构 · 计算机科学 2023-01-03 Gang Liu , Kenli Li , Zheng Xiao , Rujia Wang

Oblivious RAM (ORAM) and private information retrieval (PIR) are classic cryptographic primitives used to hide the access pattern to data whose storage has been outsourced to an untrusted server. Unfortunately, both primitives require…

密码学与安全 · 计算机科学 2019-04-12 Sarvar Patel , Giuseppe Persiano , Kevin Yeo

We present a new oblivious RAM that supports variable-sized storage blocks (vORAM), which is the first ORAM to allow varying block sizes without trivial padding. We also present a new history-independent data structure (a HIRB tree) that…

密码学与安全 · 计算机科学 2015-11-23 Daniel S. Roche , Adam J. Aviv , Seung Geol Choi

Algorithms for oblivious random access machine (ORAM) simulation allow a client, Alice, to obfuscate a pattern of data accesses with a server, Bob, who is maintaining Alice's outsourced data while trying to learn information about her data.…

密码学与安全 · 计算机科学 2017-09-20 Michael T. Goodrich

Oblivious RAM (ORAM), introduced in the context of software protection by Goldreich and Ostrovsky [JACM'96], aims at obfuscating the memory access pattern induced by a RAM computation. Ideally, the memory access pattern of an ORAM should be…

密码学与安全 · 计算机科学 2019-09-24 Pavel Hubáček , Michal Koucký , Karel Král , Veronika Slívová

An oblivious data structure is a data structure where the memory access patterns reveals no information about the operations performed on it. Such data structures were introduced by Wang et al. [ACM SIGSAC'14] and are intended for…

数据结构与算法 · 计算机科学 2018-10-26 Riko Jacob , Kasper Green Larsen , Jesper Buus Nielsen

In cloud databases, cloud computation over sensitive data uploaded by clients inevitably causes concern about data security and privacy. Even when encryption primitives and trusted computing environments are integrated into query processing…

数据库 · 计算机科学 2025-01-10 Xiao Hu , Zhiang Wu

The combination of Oblivious RAM (ORAM) with Trusted Execution Environments (TEE) has found numerous real-world applications due to their complementary nature. TEEs alleviate the performance bottlenecks of ORAM, such as network bandwidth…

密码学与安全 · 计算机科学 2025-07-15 Leqian Zheng , Zheng Zhang , Wentao Dong , Yao Zhang , Ye Wu , Cong Wang

Oblivious RAM (ORAM) protocols are powerful techniques that hide a client's data as well as access patterns from untrusted service providers. We present an oblivious cloud storage system, ObliviSync, that specifically targets one of the…

密码学与安全 · 计算机科学 2016-12-05 Adam J. Aviv , Seung Geol Choi , Travis Mayberry , Daniel S. Roche

We take an important step forward in making Oblivious RAM (O-RAM) practical. We propose an O-RAM construction achieving an amortized overhead of 20X-35X (for an O-RAM roughly 1 terabyte in size), about 63 times faster than the best existing…

密码学与安全 · 计算机科学 2015-03-19 Emil Stefanov , Elaine Shi , Dawn Song
‹ 上一页 1 2 3 10 下一页 ›