We study the problem of single database private information retrieval, and present a solution
with only logarithmic server-side communication complexity and a solution with only …

In this work, we design a new, efficient and practical Rabin-like cryptosystem without using
the Jacobi symbol, redundancy in the message and avoiding the demands of extra …

Privacy and efficient data processing are crucial research areas in the field of outsourcing
computing. Thus, the contribution of the paper is twofold. First of all, we develop a secure …

Public key cryptography has been invented to overcome some key management problems
in open networks. Although nearly all aspects of public key cryptography rely on the …

In this paper, we study some RSA-based semantically secure encryption schemes (IND-
CPA) in the standard model. We first derive the exactly tight one-wayness of Rabin-Paillier …

In this work, we introduce a new, efficient and practical scheme based on the Rabin
cryptosystem without using the Jacobi symbol, message redundancy technique or the needs …

We consider the problem of adding the functionality of delegated decryption on top of usual
encryption schemes. An appropriate security model is described for such schemes. Our …

At Eurocrypt'99, Paillier showed a cryptographic application of the group ℤ n 2*, the
multiplicative group modulo n 2 where n is some RSA modulus. In this paper, we have …

Phenomenal demands for all kind of real-time e-commerce transactions and internet usage
insist security as an essential part for protecting sensitive data. Many organizations use …

The application of the group of signed quadratic residues (SQR) is first introduced by
Hofheinz and Kiltz. The group SQR satisfies most of all properties of the group of quadratic …