A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model [chapter]

Rafael Dowsley, Jörn Müller-Quade, Anderson C. A. Nascimento
2009 Lecture Notes in Computer Science  
The McEliece public-key encryption scheme has become an interesting alternative to cryptosystems based on number-theoretical problems. Differently from RSA and ElGamal, McEliece PKC is not known to be broken by a quantum computer. Moreover, even tough McEliece PKC has a relatively big key size, encryption and decryption operations are rather efficient. In spite of all the recent results in coding theory based cryptosystems, to the date, there are no constructions secure against chosen
more » ... attacks in the standard model -the de facto security notion for public-key cryptosystems. In this work, we show the first construction of a McEliece based public-key cryptosystem secure against chosen ciphertext attacks in the standard model. Our construction is inspired by a recently proposed technique by Rosen and Segev. A preliminary version of this work, enciphering just a single message rather than many possibly correlated ones, has appeared at the proceedings of CT- RSA -2009 [11].
doi:10.1007/978-3-642-00862-7_16 fatcat:qgeupsrjorexrhxvlorq5wkxpm