Can I read Efficient Oblivious RAM with Logarithmic Cost on EtoBox?

Efficient Oblivious RAM with Logarithmic Cost by rohanravi186 is a document available to read on EtoBox.

What is Efficient Oblivious RAM with Logarithmic Cost about?

This paper presents a novel Oblivious RAM (O-RAM) construction that achieves O((log N)^3) worst-case cost while maintaining constant client-side storage. The proposed technique organizes O-RAM storage into a binary tree structure, allowing for efficient and oblivious data movement without the need for expensive sorting operations. This construction is noted for its practical performance, significantly outperforming previous schemes under realistic conditions.

Author

rohanravi186

Language

EN