Verifiable multi-secret sharing based on LFSR sequences

DOI10.1016/J.TCS.2012.05.006MaRDI QIDQ442283zbMATHOpenAlexFDO

Authors Chunqiang Hu, Xiaofeng Liao, Xiuzhen Cheng

Publication date 10 August 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.05.006

zbMATH Keywords

cryptographythreshold schemeLFSR-based public key cryptosystemverifiable multi-secret sharing

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem
• New efficient and practical verifiable multi-secret sharing schemes
• A verifiable multi-secret-sharing scheme based on homogeneous linear recursion
• Verifiably multiplicative secret sharing
• Verifiably Multiplicative Secret Sharing
• An LWE-based verifiable threshold secret sharing scheme
• A new verifiable \((t,n)\) multi-secret-sharing scheme
• Dynamic multi-secret sharing scheme with verification
• Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures
• A verifiable threshold multi-secret sharing scheme

Cites work

• scientific article; zbMATH DE number 1500489 (Why is no real title available?)
• scientific article; zbMATH DE number 2085212 (Why is no real title available?)
• A \((t,n)\) multi-secret sharing scheme
• A multiple-level visual secret-sharing scheme without image size expansion
• A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing
• A new efficient \((t,n)\) verifiable multi-secret sharing (VMSS) based on YCH scheme
• A novel efficient \((t,n)\) threshold proxy signature scheme
• A scheme for threshold multi-secret sharing
• A verifiable multi-secret sharing scheme based on cellular automata
• General secret sharing based on the Chinese remainder theorem with applications in e-voting
• How to share a secret
• Linear multi-secret sharing schemes based on multi-party computation
• New efficient and practical verifiable multi-secret sharing schemes
• Public-key cryptosystems based on cubic finite field extensions

Cited in

(10)

• Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem
• A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme
• A method for analyzing repetitive pseudorandom sequences by the criterion of Markov chain entropy
• New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system
• A fully dynamic secret sharing scheme
• A new efficient \((t,n)\) verifiable multi-secret sharing (VMSS) based on YCH scheme
• An asymptotically perfect secret sharing scheme based on the Chinese remainder theorem
• Efficient verifiable multi-secret sharing scheme based on hash function
• Perfect verification of modular scheme
• A verifiable multi-secret sharing scheme based on \(\ell\)-intersection pair of cyclic codes

This page was built for publication: Verifiable multi-secret sharing based on LFSR sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442283)