In this paper, we propose an IND-CCA2 secure Key-Encapsulation (KEM) in the standard model using the Niederreiter Encryption scheme. Also, we propose a PRIV-1CCA secure deterministic variant of the Niederreiter encryption scheme in the standard model. The security of these constructions are reduced to the hardness of the Syndrome Decoding problem and the Goppa Code Distinguishability problem. To the best of our knowledge, the proposed constructions are the first of its kind under coding-based assumption in the standard model that do not use the к-repetition paradigm initiated by Rosen and Segev at Theory of Cryptography Conference (TCC), 2009.
CITATION STYLE
Preetha Mathew, K., Vasant, S., & Pandu Rangan, C. (2014). Efficient code based hybrid and deterministic encryptions in the standard model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8565, pp. 517–535). Springer Verlag. https://doi.org/10.1007/978-3-319-12160-4_31
Mendeley helps you to discover research relevant for your work.