In this paper we study public-key encryption schemes based on error-correcting codes that are IND-CCA2 secure in the standard model. In particular, we analyze a protocol due to Dowsley, Muller-Quade and Nascimento, based on a work of Rosen and Segev. The original formulation of the protocol contained some ambiguities and incongruences, which we point out and correct; moreover, the protocol deviates substantially from the work it is based on. We then present a construction which resembles more closely the original Rosen-Segev framework, and show how this can be instantiated with the McEliece scheme
This paper studies a variant of the McEliece cryptosystem able to ensure that the code used as the p...
This paper studies a variant of the McEliece cryptosystem able to ensure that the code used as the p...
Cryptography based on error correcting codes appeared in 1968, in the early years of public key cryp...
In this paper we study public-key encryption schemes based on error-correcting codes that are IND-CC...
The McEliece public-key encryption scheme has become an interesting alternative to cryptosystems bas...
Recently, a few chosen-ciphertext secure (CCA2-secure) variants of the McEliece public-key encryptio...
International audienceIn this paper we present efficient implementations of McEliece variants using ...
International audienceIn this paper we present efficient implementations of McEliece variants using ...
This paper proposes an encryption scheme secureagainst chosen cipher text attack, built on the Niede...
We propose a new variant of the McEliece cryptosystem which ensures that the code used as the public...
This paper studies a variant of the McEliece cryptosystem able to ensure that the code used as the p...
The security of currently used asymmetric cryptosystems is based on the problems of discrete logarit...
The first code-based public-key cryptosystem was introduced in 1978 by McEliece. The public key spec...
The first code-based public-key cryptosystem was introduced in 1978 by McEliece. The public key spec...
One main construct for code-based public key cryptosystems is the McEliece framework that hedges upo...
This paper studies a variant of the McEliece cryptosystem able to ensure that the code used as the p...
This paper studies a variant of the McEliece cryptosystem able to ensure that the code used as the p...
Cryptography based on error correcting codes appeared in 1968, in the early years of public key cryp...
In this paper we study public-key encryption schemes based on error-correcting codes that are IND-CC...
The McEliece public-key encryption scheme has become an interesting alternative to cryptosystems bas...
Recently, a few chosen-ciphertext secure (CCA2-secure) variants of the McEliece public-key encryptio...
International audienceIn this paper we present efficient implementations of McEliece variants using ...
International audienceIn this paper we present efficient implementations of McEliece variants using ...
This paper proposes an encryption scheme secureagainst chosen cipher text attack, built on the Niede...
We propose a new variant of the McEliece cryptosystem which ensures that the code used as the public...
This paper studies a variant of the McEliece cryptosystem able to ensure that the code used as the p...
The security of currently used asymmetric cryptosystems is based on the problems of discrete logarit...
The first code-based public-key cryptosystem was introduced in 1978 by McEliece. The public key spec...
The first code-based public-key cryptosystem was introduced in 1978 by McEliece. The public key spec...
One main construct for code-based public key cryptosystems is the McEliece framework that hedges upo...
This paper studies a variant of the McEliece cryptosystem able to ensure that the code used as the p...
This paper studies a variant of the McEliece cryptosystem able to ensure that the code used as the p...
Cryptography based on error correcting codes appeared in 1968, in the early years of public key cryp...