How to share a secret
From MaRDI portal
Publication:5120696
Recommendations
Cited in
(51)- How to share a secret with cheaters
- ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls
- Distributive weighted threshold secret sharing schemes
- Constructing ideal secret sharing schemes based on Chinese remainder theorem
- Threshold quantum secret sharing based on single qubit
- Verifiable threshold quantum secret sharing with sequential communication
- A collaborative secret sharing scheme based on the Chinese remainder theorem
- Homomorphic extensions of CRT-based secret sharing
- On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
- A new threshold changeable secret sharing scheme based on the Chinese remainder theorem
- Selected application of the Chinese remainder theorem in multiparty computation
- Secret sharing schemes for infinite sets of participants: a new design technique
- Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem
- Realizing secret sharing with general access structure
- Threshold changeable secret sharing with secure secret reconstruction
- Chinese remainder theorem-based secret image sharing with small-sized shadow images
- Dynamic threshold secret reconstruction and its application to the threshold cryptography
- A secure and efficient on-line/off-line group key distribution protocol
- A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme
- Multilevel threshold secret sharing based on the Chinese remainder theorem
- A verifiable framework of entanglement-free quantum secret sharing with information-theoretical security
- Generalized Mignotte's sequences over polynomial rings
- General secret sharing based on the Chinese remainder theorem with applications in e-voting
- How to Leak a Secret and Reap the Rewards Too
- On secret sharing protocols
- How to share a secret
- An asymptotically perfect secret sharing scheme based on the Chinese remainder theorem
- How to Share a Secret, Infinitely
- A generalization of Mignotte's secret sharing scheme
- scientific article; zbMATH DE number 4139670 (Why is no real title available?)
- scientific article; zbMATH DE number 124015 (Why is no real title available?)
- scientific article; zbMATH DE number 177621 (Why is no real title available?)
- A generalization of the Mignotte's scheme over Euclidean domains and applications to secret image sharing
- An ideal and perfect \((t, n)\) multi-secret sharing scheme based on finite geometry
- Non-admissible tracks in Shamirs scheme
- scientific article; zbMATH DE number 5180844 (Why is no real title available?)
- A perfect secret sharing scheme for general access structures
- Cryptography with weights: MPC, encryption and signatures
- Bivariate polynomial-based secret sharing schemes with secure secret reconstruction
- Traceable secret sharing: strong security and efficient constructions
- Scalable multiparty computation from non-linear secret sharing
- Traceable bottom-up secret sharing and law and order on community social key recovery
- On a fundamental domain in a special linear group
- Reducing the share size of weighted threshold secret sharing schemes via Chow parameters approximation
- A fundamental domain in the special linear group \(\mathrm{SL}_2(\mathbb{F}_p[x])\) and secret sharing on its basis
- On Mignotte secret sharing schemes over Gaussian integers
- A construction of evolving k-threshold secret sharing scheme over a polynomial ring
- A construction of evolving 3-threshold secret sharing scheme with perfect security and smaller share size
- Traceable secret sharing revisited
- Elementary symmetric polynomials in Shamir's scheme
- Lattice-based treshold-changeability for standard CRT secret-sharing schemes
This page was built for publication: How to share a secret
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5120696)
