Two Generic Constructions of Probabilistic Cryptosystems and Their Applications

  title={Two Generic Constructions of Probabilistic Cryptosystems and Their Applications},
  author={Guilhem Castagnos},
In this paper, we build, in a generic way, two asymmetric cryptosystems with a careful study of their security. We present first an additively homomorphic scheme which generalizes, among others, the Paillier cryptosystem, and then, another scheme, built from a deterministic trapdoor function. Both schemes are proved semantically secure against chosen plaintext attacks in the standard security model and modify versions can be proved secure against adaptive chosen ciphertext attacks. By… 


Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
A general framework that allows one to construct secure encryption schemes in a generic fashion from language membership problems that satisfy certain technical requirements is introduced, as does the Cramer-Shoup scheme based on the Decision Diffie-Hellman assumption.
How to Enhance the Security of Public-Key Encryption at Minimum Cost
This paper presents a simple and efficient conversion from a semantically secure public-key encryption scheme against passive adversaries to a non-malleable (or semantically secure) public-key
A New Public-Key Cryptosystem as Secure as Factoring
This paper proposes a novel public-key cryptosystem, which is practical, provably secure and has some other interesting properties as follows: It can be proven to be as secure as the intractability of factoring n = p2q (in the sense of the security of the whole plaintext) against passive adversaries.
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
Three new trapdoor one-way functions are proposed that are based on elliptic curves over the ring Zn, which seem to be more secure than those schemes from the viewpoint of attacks without factoring such as low multiplier attacks.
A new public key cryptosystem based on higher residues
The probabilistic version of the scheme is an homomorphic encryption scheme whose expansion rate is much better than previously proposed such systems and has se- mantic security, relative to the hardness of computing higher residues for suitable moduli.
A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time
A new cryptosystem based on ideal arithmetic in quadratic orders, which is a probabilistic encryption scheme and has the homomorphy property, and the implementation shows that it is comparably as fast as the encryption time of the RSA cryptos system with e=216+1.
An efficient semantically secure elliptic curve cryptosystem based on KMOV
An elliptic curve scheme over the ring Zn2 is proposed, which is efficient and semantically secure in the standard model, and based on a new decisional assumption, namely, the Decisional Small-x eMultiples assumption.
A New Elliptic Curve Based Analogue of RSA
  • N. Demytko
  • Computer Science, Mathematics
  • 1993
A new public key cryptosystem based on elliptic curves over the ring Zn is described. The scheme can be used for both digital signature and encryption applications, does not expand the amount of data
Paillier's cryptosystem revisited
We re-examine Paillier's cryptosystem, and show that by choosing a particular discrete log base g, and by introducing an alternative decryption procedure, we can extend the scheme to allow an