22 search results - page 3 / 5 » Chosen-Ciphertext Secure RSA-Type Cryptosystems |
SCN
2008
Springer
13 years 6 months ago
2008
Springer
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,...
PKC
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We define and discuss symmetric subgroup membership problems and their properties, including a relation to the Decision DiffieHellman problem. We modify the Cramer-Shoup...
DCC
2008
IEEE
14 years 5 months ago
2008
IEEE
In this paper, we formally prove that padding the plaintext with a random bit-string provides the semantic security against chosen plaintext attack (IND-CPA) for the McEliece (and ...
SYNASC
2007
IEEE
14 years 14 days ago
2007
IEEE
A trapdoor based on an extension of the RSA trapdoor is proposed. The same function as in the RSA cryptosystem is used, i.e. x modn, but there is no restriction for the exponent t...
ACNS
2004
Springer
13 years 11 months ago
2004
Springer
We study the data privacy of cryptosystems with All-or-Nothing transform (AONT). An AONT is an efficient computable transform with two properties: Given all the bits of its output...