Multi-distribution bi-deniable inner product encryption based on Decision-LWE

被引:0
作者
Ding, Hangchao [1 ]
Tang, Huayun [2 ]
Jia, Chen [2 ]
Wang, Yanzhao [2 ]
机构
[1] China Cent Depository & Clearing Co Ltd, Postdoctoral Res Ctr, Beijing, Peoples R China
[2] China Cent Depository & Clearing Co Ltd, Beijing, Peoples R China
关键词
Multi-distribution model; bi-deniable encryption; Decision-LWE; inner product; Bi-Translucent Set; post-quantum cryptography;
D O I
10.3233/JHS-230181
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Bi-deniable Encryption scheme means that when the sender and the receiver are coerced, the coercer can obtain fake plaintext, random numbers, and secret keys. It's a solution strategy in the case of information leakage. Compared with traditional encryption, deniable encryption can provide secret communications in situations of coercion in the Post-Quantum era. Compared with sender-deniable encryption and receiver-deniable encryption, bi-deniable encryption can achieve secret communications in the situation that both sender and receiver are coerced by the coercer. So, we propose to design a bi-deniable encryption scheme under the multi-distribution model. In our bi-deniable encryption scheme, we construct a bi-deniable encryption scheme based on the assumption of Decision-Learning With Errors (DLWE) under the multi-distribution model. Firstly, the principle of Inner Product Predicate Encryption (IPPE) is applied in our scheme. Secondly, we apply the framework of Bi-Translucent Set (BTS), combined with inner product predicate encryption. Thirdly, we construct a series of probabilistic polynomial time algorithms, which apply linear transformation between different lattice structures, and Regev dual encryption. Fourthly, the statistical indistinguishability between the sampling algorithm with discrete Gaussian sampling algorithm, and the computational indistinguishability between LWE's ciphertext samples with uniform samples, the property of indistinguishability is applied in theorem proving, which obtain Indistinguishability under Chosen Plaintext Attacks (IND-CPA) security and the property of bi-deniability. Given the value range of the Gaussian parameter and security parameter in our scheme, the correctness of the bi-deniable encryption scheme is guaranteed. We also give the security proof of IND-CPA and bi-deniability's property by a series of games. The 'Inner-Product Bi-Translucent Set' Bi-Deniable Encryption scheme under the multi-distribution model is based on Decision-LWE assumption, and can avoid quantumresistant attacks. The bi-deniable encryption scheme is firstly constructed by the inner product with the Decision-LWE assumption, which can provide better properties of security and deniability.
引用
收藏
页码:445 / 459
页数:15
相关论文
共 25 条
[1]   Simple Functional Encryption Schemes for Inner Products [J].
Abdalla, Michel ;
Bourse, Florian ;
De Caro, Angelo ;
Pointcheval, David .
PUBLIC-KEY CRYPTOGRAPHY - PKC 2015, 2015, 9020 :733-751
[2]  
Agrawal S, 2011, LECT NOTES COMPUT SC, V7073, P21, DOI 10.1007/978-3-642-25385-0_2
[3]  
Agrawal S, 2010, LECT NOTES COMPUT SC, V6110, P553
[4]   Generating Shorter Bases for Hard Random Lattices [J].
Alwen, Joel ;
Peikert, Chris .
THEORY OF COMPUTING SYSTEMS, 2011, 48 (03) :535-553
[5]  
Apon Daniel., 2015, IACR CRYPTOL, V2015, P993
[6]  
Bendlin R, 2011, LECT NOTES COMPUT SC, V7073, P125, DOI 10.1007/978-3-642-25385-0_7
[7]  
Bo Meng, 2010, Journal of Networks, V5, P683, DOI 10.4304/jnw.5.6.683-690
[8]   CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM [J].
Bos, Joppe ;
Ducas, Leo ;
Kiltz, Eike ;
Lepoint, Tancrede ;
Lyubashevsky, Vadim ;
Schanck, John M. ;
Schwabe, Peter ;
Seiler, Gregor ;
Stehle, Damien .
2018 3RD IEEE EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY (EUROS&P 2018), 2018, :353-367
[9]  
Canetti R, 1997, LECT NOTES COMPUT SC, V1294, P90
[10]   Fully Deniable Interactive Encryption [J].
Canetti, Ran ;
Park, Sunoo ;
Poburinnaya, Oxana .
ADVANCES IN CRYPTOLOGY - CRYPTO 2020, PT I, 2020, 12170 :807-835