搜索结果: 1-15 共查到“军事学 oblivious RAM”相关记录33条 . 查询时间(0.08 秒)
Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHE
Homomorphic Encryption Oblivious RAM
font style='font-size:12px;'>
2019/6/24
Oblivious RAM (ORAM) is a cryptographic primitive that allows a client to hide access pattern to its data encrypted and stored at a remote server. Traditionally, ORAM algorithms assume the server acts...
Optimal Oblivious Priority Queues and Offline Oblivious RAM
Oblivious RAM Oblivious Priority Queue
font style='font-size:12px;'>
2019/3/4
In this work, we present the first asymptotically optimal oblivious priority queue, which matches the lower bound of Jacob, Larsen, and Nielsen (SODA'19). Our construction is conceptually simple, stat...
Sub-logarithmic Distributed Oblivious RAM with Small Block Size
Oblivious RAM Multi-Server Setting Secure Computation
font style='font-size:12px;'>
2019/1/26
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,...
Multi-Party Oblivious RAM based on Function Secret Sharing and Replicated Secret Sharing Arithmetic
cryptographic protocols RAM
font style='font-size:12px;'>
2019/1/2
In this work, we study the problem of constructing oblivious RAM for secure multi-party computation to obliviously access memory at private locations during secure computation. We build on recent two-...
OptORAMa: Optimal Oblivious RAM
Oblivious RAM ORAM
font style='font-size:12px;'>
2018/11/9
Oblivious RAM (ORAM), first introduced in the ground-breaking work of Goldreich and Ostrovsky (STOC '87 and J. ACM '96) is a technique for provably obfuscating programs' access patterns, such that the...
Is there an Oblivious RAM Lower Bound for Online Reads?
Oblivious RAM Lower Bounds Locally Decodable Codes
font style='font-size:12px;'>
2018/6/25
Oblivious RAM (ORAM), introduced by Goldreich and Ostrovsky (JACM 1996), can be used to read and write to memory in a way that hides which locations are being accessed. The best known ORAM schemes hav...
Yes, There is an Oblivious RAM Lower Bound!
oblivious RAM lower bound
font style='font-size:12px;'>
2018/5/11
An Oblivious RAM (ORAM) introduced by Goldreich and Ostrovsky [JACM'96] is a (possibly randomized) RAM, for which the memory access pattern reveals no information about the operations performed. The m...
PanORAMa: Oblivious RAM with Logarithmic Overhead
Oblivious RAM Oblivious Shuffle Oblivious Hash Table
font style='font-size:12px;'>
2018/5/2
the input has a certain level of entropy. We combine these two primitives to improve the shuffle time in our hierarchical ORAM construction by avoiding heavy oblivious shuffles and leveraging entropy ...
Oblivious RAM with Small Storage Overhead
ORAM perfect correctness
font style='font-size:12px;'>
2018/3/14
In this work, we present a new approach to constructing Oblivious RAM (ORAM). Somewhat surprisingly, and despite the large amount of research interest that ORAM has received, all existing ORAM constru...
PRO-ORAM: Constant Latency Read-Only Oblivious RAM
PRO-ORAM ORAM
font style='font-size:12px;'>
2018/3/5
Oblivious RAM is a well-known cryptographic primitive to hide data access patterns. However, the best known ORAM schemes require a logarithmic computation time in the general case which makes it infea...
Externally Verifiable Oblivious RAM
cryptographic protocols ORAM
font style='font-size:12px;'>
2017/2/20
We present the idea of externally verifiable oblivious RAM (ORAM). Our goal is to allow a client and server carrying out an ORAM protocol to have disputes adjudicated by a third party, allowing for th...
SE-ORAM: A Storage-Efficient Oblivious RAM for Privacy-Preserving Access to Cloud Storage
Cloud System Data Outsourcing Oblivious RAM
font style='font-size:12px;'>
2016/3/9
Oblivious RAM (ORAM) is a security-provable approach for protecting clients' access patterns to remote cloud storage. Recently, numerous ORAM constructions have been proposed to improve the communicat...
Unified Oblivious-RAM: Improving Recursive ORAM with Locality and Pseudorandomness
Oblivious Ram access pattern locality
font style='font-size:12px;'>
2016/1/25
Oblivious RAM (ORAM) is a cryptographic primitive that hides memory access patterns to untrusted storage. ORAM may be used in secure processors for encrypted computation and/or software protection. Wh...
Enhancing Oblivious RAM Performance Using Dynamic Prefetching
Oblivious RAM locality prefetching
font style='font-size:12px;'>
2016/1/23
Oblivious RAM (ORAM) is an established technique to hide the access pattern to an untrusted storage system. With ORAM, a curious adversary cannot tell what data address the user is accessing when obse...
Toward Robust Hidden Volumes using Write-Only Oblivious RAM
ORAM Hidden Volume Encryption Plausibly Deniable Encryption
font style='font-size:12px;'>
2016/1/9
With sensitive data being increasingly stored on mobile devices and laptops, hard disk encryption is more important than ever. In particular, being able to plausibly deny that a hard disk contains cer...