|
|
@@ -9,7 +9,7 @@ These scripts are in support of our paper:
|
|
|
|
|
|
Adithya Vadapalli, Ryan Henry, Ian Goldberg. Duoram: A Bandwidth-Efficient Distributed ORAM for 2- and 3-Party Computation. USENIX Security Symposium 2023. [https://eprint.iacr.org/2022/1747](https://eprint.iacr.org/2022/1747)
|
|
|
|
|
|
-It is a dockerization of [Doerner and shelat's published code](https://gitlab.com/neucrypt/floram/-/archive/floram-release/floram-floram-release.zip), with two small changes:
|
|
|
+It is a dockerization of [Doerner and shelat's published code](https://gitlab.com/neucrypt/floram/), with two small changes:
|
|
|
|
|
|
- Their benchmarking code (`bench_oram_read` and `bench_oram_write`) sets up the ORAM, and then does a number of read or a number of write operations. The _time_ to set up the ORAM is included in the reported time, but the _bandwidth_ to set up the ORAM is not included in the reported bandwith. We have [a patch](bench_oram.patch) to also measure the bandwidth of the setup, and report it separately from the bandwidth of the operations.
|
|
|
- We also add [a read/write benchmark](bench_oram_readwrite.oc) that does alternating reads and writes. If you ask for 128 operations, for example, it will do 128 reads and 128 writes, interleaved.
|
|
|
@@ -30,10 +30,10 @@ choosing.
|
|
|
- <code>./repro test</code>: Run a short (just a few seconds) "kick-the-tires" test.
|
|
|
You should see output like the following:
|
|
|
|
|
|
- <code>Running test experiment...
|
|
|
- Tue 21 Feb 2023 01:37:45 PM EST: Running read 16 1us 100gbit 2 ...
|
|
|
- Floram read 16 1us 100gbit 2 0.554001 s
|
|
|
- Floram read 16 1us 100gbit 2 3837.724609375 KiB</code>
|
|
|
+ Running test experiment...
|
|
|
+ Tue 21 Feb 2023 01:37:45 PM EST: Running read 16 1us 100gbit 2 ...
|
|
|
+ Floram read 16 1us 100gbit 2 0.554001 s
|
|
|
+ Floram read 16 1us 100gbit 2 3837.724609375 KiB
|
|
|
|
|
|
The last two lines are the output data points, telling you that a
|
|
|
Floram read test on an ORAM of size 2<sup>16</sup>, with a network
|
