scientific article
From MaRDI portal
Publication:3043938
zbMath1055.94539MaRDI QIDQ3043938
Michaël Quisquater, Joos Vandewalle, Bart Preneel
Publication date: 9 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2274/22740199.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Authentication, digital signatures and secret sharing (94A62)
Related Items (18)
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 ⋮ A collaborative secret sharing scheme based on the Chinese remainder theorem ⋮ Abelian sharing, common informations, and linear rank inequalities ⋮ Distributive weighted threshold secret sharing schemes ⋮ 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 ⋮ 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 ⋮ AC-RRNS: anti-collusion secured data sharing scheme for cloud storage ⋮ Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes ⋮ Lattice-based treshold-changeability for standard CRT secret-sharing schemes ⋮ A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem ⋮ Generalized Mignotte's Sequences Over Polynomial Rings ⋮ General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
This page was built for publication:
