Verifiable multi-secret sharing based on LFSR sequences
From MaRDI portal
Publication:442283
DOI10.1016/J.TCS.2012.05.006zbMATH Open1259.94064OpenAlexW2036724877MaRDI QIDQ442283FDOQ442283
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
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
- How to share a secret
- Public-key cryptosystems based on cubic finite field extensions
- A \((t,n)\) multi-secret sharing scheme
- New efficient and practical verifiable multi-secret sharing schemes
- A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing
- A multiple-level visual secret-sharing scheme without image size expansion
- A scheme for threshold multi-secret sharing
- A novel efficient \((t,n)\) threshold proxy signature scheme
- A new efficient \((t,n)\) verifiable multi-secret sharing (VMSS) based on YCH scheme
- General secret sharing based on the Chinese remainder theorem with applications in e-voting
- Title not available (Why is that?)
- Title not available (Why is that?)
- A verifiable multi-secret sharing scheme based on cellular automata
- Linear multi-secret sharing schemes based on multi-party computation
Cited In (10)
- New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system
- A method for analyzing repetitive pseudorandom sequences by the criterion of Markov chain entropy
- 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
- An asymptotically perfect secret sharing scheme based on the Chinese remainder theorem
- Perfect verification of modular scheme
- A verifiable multi-secret sharing scheme based on \(\ell\)-intersection pair of cyclic codes
- A new efficient \((t,n)\) verifiable multi-secret sharing (VMSS) based on YCH scheme
- Efficient verifiable multi-secret sharing scheme based on hash function
- A fully dynamic secret sharing scheme
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)
