SCN
2008
Springer
13 years 4 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,...
ASIACRYPT
2003
Springer
13 years 8 months ago
2003
Springer
We propose a new public key trace and revoke scheme secure against adaptive chosen ciphertext attack. Our scheme is more efficient than the DF scheme suggested by Y. Dodis and N. F...
CRYPTO
1998
Springer
13 years 8 months ago
1998
Springer
A new public key cryptosystem is proposed and analyzed. The scheme is quite practical, and is provably secure against adaptive chosen ciphertext attack under standard intractabili...
CRYPTO
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. In this paper, we reconsider the notion of plaintext awareness. We present a new model for plaintext-aware encryption that is both natural and useful. We achieve plaintex...
AAECC
2006
Springer
13 years 10 months ago
2006
Springer
The Fujisaki-Okamoto (FO) conversion is widely known to be able to generically convert a weak public key encryption scheme, say one-way against chosen plaintext attacks (OW-CPA), t...
PROVSEC
2009
Springer
13 years 11 months ago
2009
Springer
Signcryption is a cryptographic primitive that provides authentication and confidentiality simultaneously in a single logical step. It is often required that multiple senders have...
DCC
2008
IEEE
14 years 4 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 ...