Sciweavers

IACR
2011
110views more  IACR 2011»
12 years 4 months ago
On the (In)security of Hash-based Oblivious RAM and a New Balancing Scheme
With the gaining popularity of remote storage (e.g. in the Cloud), we consider the setting where a small, protected local machine wishes to access data on a large, untrusted remot...
Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
13 years 11 months ago
Priority Queues Resilient to Memory Faults
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
Allan Grønlund Jørgensen, Gabriel Mo...
ESA
2007
Springer
100views Algorithms» more  ESA 2007»
13 years 11 months ago
Radix Sorting with No Extra Space
It is well known that n integers in the range [1, nc ] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1, U] can be sorted i...
Gianni Franceschini, S. Muthukrishnan, Mihai Patra...