Cryptology ePrint Archive: Report 2011/407
Available versions in chronological order
20110730:025340 (posted 30-Jul-2011 02:53:40 UTC)
Oblivious RAM with O((log N)^3) Worst-Case Cost
Elaine Shi, Hubert Chan, Emil Stefanov, Mingfei Li
20111114:071619 (posted 14-Nov-2011 07:16:19 UTC)
Oblivious RAM with O((log N)^3) Worst-Case Cost
Elaine Shi, Hubert Chan, Emil Stefanov, Mingfei Li
20111114:072054 (posted 14-Nov-2011 07:20:54 UTC)
Oblivious RAM with O((log N)^3) Worst-Case Cost
Elaine Shi, Hubert Chan, Emil Stefanov, Mingfei Li
20111114:072740 (posted 14-Nov-2011 07:27:40 UTC)
Oblivious RAM with O((log N)^3) Worst-Case Cost
Elaine Shi, Hubert Chan, Emil Stefanov, Mingfei Li
20111114:073005 (posted 14-Nov-2011 07:30:05 UTC)
Oblivious RAM with O((log N)^3) Worst-Case Cost
Elaine Shi, Hubert Chan, Emil Stefanov, Mingfei Li
20111114:073814 (posted 14-Nov-2011 07:38:14 UTC)
Oblivious RAM with O((log N)^3) Worst-Case Cost
Elaine Shi, Hubert Chan, Emil Stefanov, Mingfei Li
20111114:074759 (posted 14-Nov-2011 07:47:59 UTC)
Oblivious RAM with O((log N)^3) Worst-Case Cost
Elaine Shi, Hubert Chan, Emil Stefanov, Mingfei Li
20111129:051758 (posted 29-Nov-2011 05:17:58 UTC)
Oblivious RAM with O((log N)^3) Worst-Case Cost
Elaine Shi, Hubert Chan, Emil Stefanov, Mingfei Li
[
Cryptology ePrint archive
]