College of Mathematics and informatics, Fujian Normal University, Fuzhou 350117, China; Fujian Provincial Key Lab of Network Security & Cryptology, Fujian Normal University, Fuzhou 350007, China 在期刊界中查找 在百度中查找 在本站中查找
College of Mathematics and informatics, Fujian Normal University, Fuzhou 350117, China; Fujian Provincial Key Lab of Network Security & Cryptology, Fujian Normal University, Fuzhou 350007, China 在期刊界中查找 在百度中查找 在本站中查找
College of Mathematics and informatics, Fujian Normal University, Fuzhou 350117, China; Fujian Provincial Key Lab of Network Security & Cryptology, Fujian Normal University, Fuzhou 350007, China 在期刊界中查找 在百度中查找 在本站中查找
College of Mathematics and informatics, Fujian Normal University, Fuzhou 350117, China; Fujian Provincial Key Lab of Network Security & Cryptology, Fujian Normal University, Fuzhou 350007, China 在期刊界中查找 在百度中查找 在本站中查找
Since the existing function secret sharing schemes require all participants to join in the reconstruction phase. Therefore, it cannot be flexibly applied to real-world scenarios. A function secret sharing scheme with thresholds is constructed in this study using polynomial techniques. According to the security model of function secret sharing, we proved that the proposed scheme has security in the sense of information theory. In addition, this study analyzes the function secret sharing scheme proposed by Yuan et al., and expounds the reason why their scheme does not satisfy the security of function secret sharing. Finally, a comprehensive comparison between the newly constructed scheme and the existing function secret sharing scheme is found. We note that the newly constructed scheme has higher level of security and higher efficiency through the comprehensive comparison.
[1] Shamir A. How to share a secret. Communications of the ACM, 1979, 22(11):612-613.[doi:10.1145/359168.359176
[2] Blakley GR. Safeguarding cryptographic keys. Proceedings of the AFIPS 1979 National Computer Conference. Montvale, NJ, USA. 1979. 313-317.
[3] Chor B, Kushilevitz E, Goldreich O, et al. Private information retrieval. Journal of the ACM, 1998, 45(6):965-981.[doi:10.1145/293347.293350
[4] Ostrovsky R, Shoup V. Private information storage (extended abstract). Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing. New York, NY, USA. 1997. 294-303.
[5] Gilboa N, Ishai Y. Distributed point functions and their applications. Proceedings of the 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques. Copenhagen, Denmark. 2014. 640-658.
[6] Boyle E, Gilboa N, Ishai Y. Function secret sharing. Proceedings of the 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Sofia, Bulgaria. 2015. 337-367.
[7] Boyle E, Couteau G, Gilboa N, et al. Homomorphic secret sharing:Optimizations and applications. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. Dallas, TX, USA. 2017. 2105-2122.
[8] Plantard T, Susilo W, Zhang ZF. Fully homomorphic encryption using hidden ideal lattice. IEEE Transactions on Information Forensics and Security, 2013, 8(12):2127-2137.[doi:10.1109/TIFS.2013.2287732
[9] Boyle E, Gilboa N, Ishai Y. Function secret sharing:Improvements and extensions. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. Vienna, Austria. 2016. 1292-1303.
[10] Håstad J, Impagliazzo R, Levin LA, et al. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 1999, 28(4):1364-1396.[doi:10.1137/s0097539793244708
[11] Yuan DZ, He MX, Zeng SK, et al. (t, p)-threshold point function secret sharing scheme based on polynomial interpolation and its application. Proceedings of 2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing. Shanghai, China. 2016. 269-275.
[12] Bellare M. A note on negligible functions. Journal of Cryptology, 2002, 15(4):271-284.[doi:10.1007/s00145-002-0116-x