CCA2 Key-Privacy for Code-Based Encryption in the Standard Model
CCA2 Key-Privacy for Code-Based Encryption in the Standard Model
复制标题
DOI：
10.1007/978-3-319-59879-6_3
复制
发表时间：
2017-06
期刊：
影响因子：
--
通讯作者：
Yusuke Yoshida;Kirill Morozov;Keisuke Tanaka
中科院分区：
文献类型：
--
作者：
Yusuke Yoshida;Kirill Morozov;Keisuke Tanaka
McEliece和Niederreiter提出的基于代码的公钥加密方案是后量子世界的著名候选方案。在这项工作中，我们在标准模型中研究了这些方案的密钥隐私（或匿名）。具体来说，我们证明了以下两种构造加密的范式，如果底层基元满足underk-repetition:(1) rosensegev构造（TCC 2009），我们用Niederreiter方案实例化了它；(2) Döttling等人的构造（IEEE Transactions on Information Theory 2012），我们用McEliece方案和Niederreiter方案实例化了它。据我们所知，这些实例给出了标准模型中第一个基于IK-CCA2代码的方案。在我们的证明中，我们依赖于Yamakawa等人（AAECC 2007）的一个重要观察，即随机McEliece加密存在于标准模型中。作为附带结果，我们证明了随机化的Niederreiter加密也是如此。
The code-based public-key encryption schemes by McEliece and Niederreiter are famous candidates for the post-quantum world. In this work, we study key-privacy (or anonymity) for these schemes in the standard model. Specifically, we show that the following two paradigms for constructingencryption yieldencryption, if the underlying primitive satisfiesunderk-repetition: (1) The Rosen-Segev construction (TCC 2009), we instantiate it with the Niederreiter scheme; (2) The Döttling et al. construction (IEEE Transactions on Information Theory 2012), we instantiate it with both the McEliece scheme and the Niederreiter scheme. As far as we know, these instantiations give the first IK-CCA2 code-based schemes in the standard model. In our proofs, we rely on an important observation by Yamakawa et al. (AAECC 2007) that the randomized McEliece encryption isin the standard model. As a side result, we show that the randomized Niederreiter encryption isas well.