A modular approach to key safeguarding
From MaRDI portal
Publication:5120697
DOI10.1109/TIT.1983.1056651zbMath1447.94018WikidataQ27915587 ScholiaQ27915587MaRDI QIDQ5120697
Publication date: 15 September 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (43)
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 ⋮ Threshold cryptography based on Asmuth-Bloom secret sharing ⋮ Unnamed Item ⋮ Randomized component based secure secret reconstruction in insecure networks ⋮ On ASGS framework: general requirements and an example of implementation ⋮ A collaborative secret sharing scheme based on the Chinese remainder theorem ⋮ Ramp secret image sharing ⋮ 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 ⋮ Optimal codes from Fibonacci polynomials and secret sharing schemes ⋮ Robust Threshold Schemes Based on the Chinese Remainder Theorem ⋮ A perfect secret sharing scheme for general access structures ⋮ Revisiting group oriented secret sharing schemes ⋮ 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 ⋮ Ramp scheme based on CRT for polynomial ring over finite field ⋮ 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 ⋮ Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes ⋮ A Lossless Linear Algebraic Secret Image Sharing Scheme ⋮ A new secret sharing scheme ⋮ Threshold quantum secret sharing based on single qubit ⋮ Verifiable threshold quantum secret sharing with sequential communication ⋮ Finding the maximal adversary structure from any given access structure ⋮ 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 ⋮ Continuous variable quantum secret sharing with 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 ⋮ Chinese remainder theorem-based secret image sharing with small-sized shadow images ⋮ A rational threshold signature model and protocol based on different permissions ⋮ Generalized Mignotte's Sequences Over Polynomial Rings ⋮ General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting ⋮ Sharing DSS by the Chinese remainder theorem ⋮ Dynamic threshold secret reconstruction and its application to the threshold cryptography
This page was built for publication: A modular approach to key safeguarding
