How to Share a Secret
From MaRDI portal
Publication:5120696
DOI10.1007/3-540-39466-4_27zbMath1447.94064OpenAlexW1484820633WikidataQ27915506 ScholiaQ27915506MaRDI QIDQ5120696
Publication date: 15 September 2020
Published in: Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-39466-4_27
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Related Items (31)
ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls ⋮ An asymptotically perfect secret sharing scheme based on the Chinese Remainder Theorem ⋮ Unnamed Item ⋮ A collaborative secret sharing scheme based on the Chinese remainder theorem ⋮ Distributive weighted threshold secret sharing schemes ⋮ A verifiable framework of entanglement-free quantum secret sharing with information-theoretical security ⋮ A secure and efficient on-line/off-line group key distribution protocol ⋮ A perfect secret sharing scheme for general access structures ⋮ Homomorphic extensions of CRT-based secret sharing ⋮ On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme ⋮ Cryptography with weights: MPC, encryption and signatures ⋮ Bivariate polynomial-based secret sharing schemes with secure secret reconstruction ⋮ A new threshold changeable secret sharing scheme based on the Chinese remainder theorem ⋮ Selected application of the Chinese remainder theorem in multiparty computation ⋮ Constructing ideal secret sharing schemes based on Chinese remainder theorem ⋮ 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 ⋮ Secret sharing schemes for infinite sets of participants: a new design technique ⋮ Threshold quantum secret sharing based on single qubit ⋮ Verifiable threshold quantum secret sharing with sequential communication ⋮ Non-admissible tracks in Shamirs scheme ⋮ Elementary symmetric polynomials in Shamir's scheme ⋮ Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem ⋮ Realizing secret sharing with general access structure ⋮ Lattice-based treshold-changeability for standard CRT secret-sharing schemes ⋮ Threshold changeable secret sharing with secure secret reconstruction ⋮ An Ideal and Perfect (t, n) Multi-secret Sharing Scheme Based on Finite Geometry ⋮ Chinese remainder theorem-based secret image sharing with small-sized shadow images ⋮ Generalized Mignotte's Sequences Over Polynomial Rings ⋮ General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting ⋮ Dynamic threshold secret reconstruction and its application to the threshold cryptography
This page was built for publication: How to Share a Secret
