The following pages link to ObliVM (Q40860):
Displaying 7 items.
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation (Q1687724) (← links)
- On compiling Boolean circuits optimized for secure multi-party computation (Q1696583) (← links)
- JIMU: faster LEGO-based secure computation using additive homomorphic hashes (Q1703939) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649) (← links)
- Oblivious RAM with \textit{worst-case} logarithmic overhead (Q2139650) (← links)
- Asymptotically Tight Bounds for Composing ORAM with PIR (Q5738784) (← links)