Verifiable multi-secret sharing based on LFSR sequences
From MaRDI portal
Publication:442283
DOI10.1016/J.TCS.2012.05.006zbMath1259.94064OpenAlexW2036724877MaRDI QIDQ442283
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
Related Items (6)
An asymptotically perfect secret sharing scheme based on the Chinese Remainder Theorem ⋮ 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 ⋮ A fully dynamic secret sharing scheme ⋮ Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem ⋮ New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system
Cites Work
- Unnamed Item
- Unnamed Item
- A verifiable multi-secret sharing scheme based on cellular automata
- Linear multi-secret sharing schemes based on multi-party computation
- A \((t,n)\) multi-secret sharing scheme
- A multiple-level visual secret-sharing scheme without image size expansion
- New efficient and practical verifiable multi-secret sharing schemes
- A scheme for threshold multi-secret sharing
- A novel efficient \((t,n)\) threshold proxy signature scheme
- 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
- General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
- How to share a secret
- Public-key cryptosystems based on cubic finite field extensions
This page was built for publication: Verifiable multi-secret sharing based on LFSR sequences
