Oblivious RAM compilers, introduced by Goldreich and Ostrovsky [JACM’96], compile any RAM program into one that is “memory-oblivious” (i.e., the access pattern to the memory is independent of the input). All previous ORAM schemes, however, completely break the locality of data accesses (by shuffling the data to pseudorandom positions in memory). In this work, we initiate the study of locality-f...

Recent techniques reduce ORAM communication complexity down to constant in the number of blocks N . However, they induce expensive homomorphic encryption on both the server and the client. In this paper, we present an alternative approach CH -ORAM. This ORAM features constant communication complexity without homomorphic encryption, in exchange for expanding the traditional ORAM setting from sin...

This paper tackles the open problem whether an Oblivious RAM can be shared among multiple clients in the presence of a fully malicious server. Current ORAM constructions rely on clients knowing the ORAM state to not reveal information about their access patter. With multiple clients, a straightforward approach requires clients exchanging updated state to maintain security. However, clients on t...

Outsourcing data to remote storage servers has become more and more popular, but the related security and privacy concerns have also been raised. To protect the pattern in which a user accesses the outsourced data, various oblivious RAM (ORAM) systems have been proposed. However, existing ORAM designs assume a single user or a group of mutuallytrusted users to access a remote storage, which mak...

The Beverton-Holt model is a classical population model which has been considered in the literature for the discrete-time case. Its continuous-time analogue is the well-known logistic model. In this paper, we consider a quantum calculus analogue of the Beverton-Holt equation. We use a recently introduced concept of periodic functions in quantum calculus in order to study the existence of period...