A Threshold Public Key Encryption via Dual Regev Scheme

doi:10.13190/j.jbupt.2019-239

Journal of Beijing University of Posts and Telecommunications ›› 2020, Vol. 43 ›› Issue (4): 83-87.doi: 10.13190/j.jbupt.2019-239

• REPORTS • Previous Articles Next Articles

A Threshold Public Key Encryption via Dual Regev Scheme

LI Zeng-peng¹, WANG Jiu-ru², ZHANG Wen-yin², MA Chun-guang³

1. College of Computer Science and Technology, Qingdao University, Qingdao 266071, China;
2. School of Information Science and Engineering, Linyi University, Linyi 276000, China;
3. School of Computer Science and Engineering, Shandong University of Science and Technology, Jinan 266071, China

Received:2019-11-09 Published:2020-08-15

Abstract

Abstract: Aiming at the problem that Regev scheme cannot effectively resist key recovery attack, a threshold public key encryption scheme is proposed based on Gentry-Peikert-Vaikuntanathan (GPV) scheme. The scheme is mainly composed of a distributed key generation protocol and an effective non-interactive decryption protocol. It combines Shamir's secret sharing algorithm and Lagrangian algorithm, which make it resistant to static and passive adversary buying attacks. The correctness of the proposed scheme is proved through theoretical analysis. Moreover, under the universal composable framework, the security is verified.

Key words: lattice-based cryptography, threshold cryptosystem, learning with errors, security protocol

CLC Number:

TP309

LI Zeng-peng, WANG Jiu-ru, ZHANG Wen-yin, MA Chun-guang. A Threshold Public Key Encryption via Dual Regev Scheme[J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(4): 83-87.

References

[1] Bendlin R, Damgard I. Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems[C]//Theory of Cryptography Conference. Heidelberg:Springer, 2010:201-218.
[2] Regev O. On lattices, learning with errors, random linear codes, and cryptography[C]//Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing. New York:ACM, 2005:84-93.
[3] Frederiksen T. A multi-bit threshold variant of Regev's LWE-based cryptosystem[J/OL]. Cryptology ePrint Archive, 2011:1[2019-11-18]. http://daimi.au.dk/~jot2re/lwe/resources/report2.pdf.
[4] Li Zengpeng, Ma Chunguang, Wang Ding. Leakage resilient leveled FHE on multiple bit message[J]. IEEE Transactions on Big Data, 2017:7.
[5] Brakerski Z, Halevi S, Polychroniadou A. Four round secure computation without setup[J/OL]. Cryptology e Print Archive, 2017:386[2019-10-12]. http://eprint.iacr.org/2017/386.
[6] Brakerski Z, Gentry C, Halevi S. Packed ciphertexts in LWE-based homomorphic encryption[C]//16th International Conference on Practice and Theory in Public-Key Cryptography. Heidelberg:Springer, 2013:1-13.
[7] Boneh D, Gennaro R, Goldfeder S, et al. Threshold cryptosystems from threshold fully homomorphic encryption[C]//38th Annual International Cryptology Conference. Heidelberg:Springer, 2018:565-596.
[8] Boneh D, Gennaro R, Goldfeder S, et al. A lattice-based universal thresholdizer for cryptographic systems[J/OL]. IACR Cryptology ePrint Archive, 2017:251[2019-10-21]. https://eprint.iacr.org/2017/251.pdf.
[9] Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions[C]//40th Annual ACM Symposium on Theory of Computing. New York:ACM, 2008:197-206.
[10] Shamir A. How to share a secret[J]. Communications of the ACM, 1979, 22(11):612-613.
[11] Canetti R. Universally composable security:a new paradigm for cryptographic protocols[C]//42nd IEEE Symposium on Foundations of Computer Science. Los Alamitos:IEEE Computer Society, 2001:136-145.
[12] Peikert C, Vaikuntanathan V, Waters B. A framework for efficient and composable oblivious transfer[C]//28th Annual Intermational Cryptology Conference on Cryptology:Advances in Cryptology. Heidelberg:Spinger, 2008:554-571.
[13] Li Zengpeng, Wang Jiuru, Zhang Wenyin. Revisiting post-quantum hash proof systems over lattices for internet of thing authentications[J]. Journal of Ambient Intelligence and Humanized Computing, 2019:10.

A Threshold Public Key Encryption via Dual Regev Scheme

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 5

Recommended Articles

Metrics

Comments

[1]	TANG Yong-li, HU Ming-xing, YE Qing, QIN Pan-ke, YU Jin-xia. Improved Multi-Identity Based Fully Homomorphic Encryption Scheme over Lattices [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2018, 41(1): 125-133.
[2]	LU Xiu-hua, WEN Qiao-yan, JIN Zheng-ping, WANG Li-cheng, YANG Chun-li. Improvement of a Fuzzy Identity-Based Lattice Signature Scheme [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2015, 38(2): 55-58.
[3]	ZHANG Wei-ren, HU Yu-pu, YANG Xiao-yuan. A New Identity-Based Broadcast Encryption Scheme over Lattice [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2012, 35(6): 112-115.
[4]	. The Construction of Changeable Intruder Model in Model Checking [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2011, 34(2): 54-57.
[5]	LONG Shi-gong1 , LUO Wen-jun1，YUAN Chao-wei2 , LI Xiang1. The Guessing Attacks in the Strand Space Model [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2007, 30(1): 62-65.