IND-CCA Secure Cryptography Based on a Variant of the LPN Problem
In 2003 Michael Alekhnovich (FOCS 2003) introduced a novel variant of the learning parity with noise problem and showed that it implies IND-CPA secure public-key cryptography. In this paper we introduce the first public-key encryption-scheme based on this assumption which is IND-CCA secure in the standard model. Our main technical tool to achieve this is a novel all-but-one simulation technique based on the correlated products approach of Rosen and Segev (TCC 2009). Our IND-CCA1 secure scheme is asymptotically optimal with respect to ciphertext-expansion. To achieve IND-CCA2 security we use a technique of Dolev, Dwork and Naor (STOC 1991) based on one-time-signatures. For practical purposes, the efficiency of the IND-CCA2 scheme can be substantially improved by the use of additional assumptions to allow for more efficient signature schemes. Our results make Alekhnovich's variant of the learning parity with noise problem a promising candidate to achieve post quantum cryptography.
Advances in Cryptology - ASIACRYPT 2012
Döttling, N., Müller-Quade, J., & Nascimento, A. C. A. (2012). IND-CCA Secure Cryptography Based on a Variant of the LPN Problem. In X. Wang & K. Sako (Eds.), Advances in Cryptology - ASIACRYPT 2012 (pp. 485-503). Springer Berlin Heidelberg. Retrieved from http://link.springer.com/chapter/10.1007/978-3-642-34961-4_30