Abstract

Oblivious RAM with Worst-Case Logarithmic Overhead

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title
Journal
Date
Author
Implementing and Analyzing a Recursive Technique for Building Path Oblivious RAM
Qutaibah Malluhi ... Ryan Riley
-
Qutaibah Malluhi, et. al.Qutaibah Malluhi ... Ryan Riley
01 Jan 2018
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness
Uzi Vishkin ... Elaine Shi
Journal of Cryptology | VOL. 32
Uzi Vishkin, et. al.Uzi Vishkin ... Elaine Shi
09 Aug 2018
ρ
Ali Shafiee ... Chandrasekhar Nagarajan
-
Ali Shafiee, et. al.Ali Shafiee ... Chandrasekhar Nagarajan
04 Apr 2019
ReadPRO: Read Prioritization Scheduling in ORAM for Efficient Obfuscation in Main Memories
Joydeep Rakshit ... Kartik Mohanram
-
Joydeep Rakshit, et. al.Joydeep Rakshit ... Kartik Mohanram
01 Oct 2018
View more papers

More From: Journal of Cryptology

Paper Title
Journal
Date
Author
Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors
Danilo Francati ... Daniele Venturi
Journal of Cryptology | VOL. 37
Danilo Francati, et. al.Danilo Francati ... Daniele Venturi
14 May 2024
Compact NIZKs from Standard Assumptions on Bilinear Maps
Shuichi Katsumata ... Takashi Yamakawa
Journal of Cryptology | VOL. 37
Shuichi Katsumata, et. al.Shuichi Katsumata ... Takashi Yamakawa
13 May 2024
Watermarking PRFs and PKE Against Quantum Adversaries
Fuyuki Kitagawa ... Ryo Nishimaki
Journal of Cryptology | VOL. 37
Fuyuki Kitagawa, et. al.Fuyuki Kitagawa ... Ryo Nishimaki
26 Apr 2024
Cryptographic Primitives with Hinting Property
Navid Alamati ... Sikhar Patranabis
Journal of Cryptology | VOL. 37
Navid Alamati, et. al.Navid Alamati ... Sikhar Patranabis
23 Apr 2024
View more papers