IACR News item: 16 October 2012
Preetha Mathew K, Sachin Vasant, C Pandu Rangan
ePrint Reportcompared to the modular exponentiation required in number-theoretic schemes. Courtois, Finiasz and Sendrier proposed the only practical code-based signature(CFS signature) [7]. It can be used to realise
many cryptographic primitives. But the signature is currently not provably secure due to the existence
of the high rate distinguisher [11]. In this paper, we make use of an alternate key-construct for the CFS
signature, and thus prove its existential unforgeability under chosen message attacks (EUF-CMA). Also,
we propose a code-based signcryption scheme and proved its security. To the best of our knowledge,
this is the first code-based, provably secure signature and signcryption scheme in literature.
Additional news items may be found on the IACR news page.