New dynamic and verifiable multi-secret sharing schemes based on LFSR public key cryptosystem

2019/06/11 by Jing Yang, Fang-Wei Fu, Yang, Jing +1
Computer Science · #11T71 #68R01 #94A60 #94A62 #C.2.3 #Cryptography and Security (cs.CR) #D.4.6 #FOS: Computer and information sciences #H.4.3 #K.6.5 #Social and Information Networks (cs.SI) #acm:11T71 #acm:68R01 #acm:94A60 #acm:94A62 #cs.CR #cs.SI #msc:11T71 #msc:68R01 #msc:94A60 #msc:94A62

paper · pdf · doi:10.48550/arxiv.1906.04611

21 pages, 1 figures, 4 tables

arxiv created 2019/06/11 · arxiv updated 2019/06/12

Abstract

A verifiable multi-secret sharing (VMSS) scheme enables the dealer to share multiple secrets, and the deception of both participants and the dealer can be detected. After analyzing the security of VMSS schemes proposed by Mashhadi and Dehkordi in 2015, we illustrate that they cannot detect some deception of the dealer. By using nonhomogeneous linear recursion and LFSR public key cryptosystem, we introduce two new VMSS schemes. Our schemes can not only overcome the drawback mentioned above, but also have shorter private/public key length at the same safety level. Besides, our schemes have dynamism.

Related

• New (k,l,m)-verifiable multi-secret sharing schemes based on XTR public key system
• Post-quantum Multi-stage Secret Sharing Schemes using Inhomogeneous Linear Recursion and Ajtai's Function
• A Novel Approach for Verifiable Secret Sharing by using a One Way Hash Function
• Threshold Multi Secret Sharing Using Elliptic Curve and Pairing
• Publicly Verifiable Secret Sharing: Generic Constructions and Lattice-Based Instantiations in the Standard Model