A verifiable multi-secret-sharing scheme based on homogeneous linear recursion
From MaRDI portal
Recommendations
- New efficient and practical verifiable multi-secret sharing schemes
- 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 verifiable threshold multi-secret sharing scheme
- Efficient verifiable multi-secret sharing scheme based on hash function
Cited in
(16)- Three \((t, n )\)-secret image sharing schemes based on homogeneous linear recursion
- A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme
- New multi-stage secret sharing in the standard model
- New efficient and practical verifiable multi-secret sharing schemes
- A verifiable multi-organization multi-secret-sharing scheme
- scientific article; zbMATH DE number 5811700 (Why is no real title available?)
- Multiple participants enrollment in a publicly verifiable secret sharing scheme
- A leakproof multi-secret sharing scheme based on environment sensing
- Verifiable multi-secret sharing based on LFSR sequences
- Recursive hiding of biometrics-based secret sharing scheme using adversary structure
- A new verifiable (t,n) multi-secret-sharing scheme
- A new secret sharing scheme adversary fuzzy structure based on automata
- Efficient verifiable multi-secret sharing scheme based on hash function
- Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem
- Secure multi-level threshold multi-secret sharing
- A verifiable multi-secret sharing scheme based on cellular automata
This page was built for publication: A verifiable multi-secret-sharing scheme based on homogeneous linear recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170746)
