搜索结果: 1-15 共查到“RAM”相关记录144条 . 查询时间(0.048 秒)
2024年11月5日，美国杜克大学尼古拉斯环境学院杰出教授Oren Ram应邀到访中国林科院生态所，并作题为“Mechanisms regulating tree water uptake in a patchy woodland-grass system and consequences to net ecosystem carbon exchange:Setting limits to man...
中国科学院微电子研究所专利：一种用于可配置位宽RAM的读取路径选择及控制电路
中国科学院微电子研究所专利：一种用于可配置位宽RAM的写入路径选择及控制电路
Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHE
Homomorphic Encryption Oblivious RAM
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
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...
Quantum cryptanalysis in the RAM model: Claw-finding attacks on SIKE
quantum cryptanalysis SIDH
2019/2/27
We introduce models of computation that enable direct comparisons between classical and quantum algorithms. Incorporating previous work on quantum computation and error correction, we justify the use ...
Sub-logarithmic Distributed Oblivious RAM with Small Block Size
Oblivious RAM Multi-Server Setting Secure Computation
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
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
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...
生态学与进化生物学实验室尼泊尔籍博士后Babu Ram Paudel博士与合作导师李庆军研究员通过量化不同生殖障碍的相对作用，以期解决关键科学问题“喜马拉雅高山姜科植物紫花象牙参和图杰象牙参在同域分布群体中如何保持各自独立的物种身份”。研究发现这两种同域分布的象牙参属植物是通过不同的开花物候及不同传粉昆虫（图杰象牙参通过熊蜂传粉，紫花象牙参通过长喙虻传粉）实现生殖隔离。研究结果表明，合子前隔离在生...
Is there an Oblivious RAM Lower Bound for Online Reads?
Oblivious RAM Lower Bounds Locally Decodable Codes
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...
We give a construction of an adaptive garbled RAM scheme. In the adaptive setting, a client first garbles a ``large'' persistent database which is stored on a server. Next, the client can provide mult...
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
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 ...
We show that PRAMs can be obliviously simulated with perfect security, incurring only O(logNloglogN) blowup in parallel runtime, O(log3N) blowup in total work, and O(1) blowup in space relative to the...