#cryptography #crypto #constant-time #oblivious-ram

no-std mc-oblivious-ram

Implementations of Oblivious RAM data structures

3 stable releases

2.2.0 Mar 12, 2022
2.0.0 Apr 17, 2021
1.0.0 Mar 9, 2021

#291 in Cryptography

Download history 923/week @ 2022-06-06 1675/week @ 2022-06-13 1123/week @ 2022-06-20 628/week @ 2022-06-27 573/week @ 2022-07-04 1126/week @ 2022-07-11 679/week @ 2022-07-18 563/week @ 2022-07-25 1464/week @ 2022-08-01 1777/week @ 2022-08-08 811/week @ 2022-08-15 631/week @ 2022-08-22 914/week @ 2022-08-29 1611/week @ 2022-09-05 1729/week @ 2022-09-12 2427/week @ 2022-09-19

6,681 downloads per month

GPL-3.0 license

160KB
2.5K SLoC

mc-oblivious-ram

This crate provides implementations of Oblivious RAM data structures, suitable for use in an Intel SGX environment.

In crate right now:

  • Adaptation of Path ORAM

lib.rs:

One of the main ideas in PathORAM is to use a position map, which is recursively an ORAM. The position map is built on top of an ORAM implementation.

Tuning the characteristics of the position map is important for overall performance, and the PathORAM doesn't really care about those details. So in this implementation, PathORAM contains Box, which allows for sizing and tuning to be done at runtime.

PositionMap also has slightly different initialization from ORAM. You want the PositionMap to begin in a random state, not a zeroed state. But writing random values to all the position maps on initialization is slow. To avoid the need for this, we "implicitly" initialize each position to a value which is the output of a secure block cipher.

The core PathORAM implementation, using PositionMap as a block box, appears in the path_oram module. PathORAM must also use the ORAMStorage to fetch, scan, and return branches in the storage and execute the path ORAM eviction algorithm.

Dependencies

~325KB