Secret-sharing with a class of ternary codes
From MaRDI portal
Publication:1583097
DOI10.1016/S0304-3975(00)00207-3zbMath0951.68029WikidataQ127114041 ScholiaQ127114041MaRDI QIDQ1583097
David R. Kohel, Cunsheng Ding, San Ling
Publication date: 26 October 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (18)
Secret sharing schemes based on additive codes over \(\mathrm{GF}(4)\) ⋮ Unnamed Item ⋮ New classes of codes over \(R_{q,p,m}=\mathbb{Z}_{p^m}[u_1, u_2, \dots , u_q/ \langle u_i^2=0,u_iu_j=u_ju_i\rangle\) and their applications] ⋮ Secret sharing schemes from binary linear codes ⋮ On the minimum number of minimal codewords ⋮ Some codes over \(\mathcal{R} = \mathcal{R}_1\mathcal{R}_2\mathcal{R}_3\) and their applications in secret sharing schemes ⋮ Recursive hiding of biometrics-based secret sharing scheme using adversary structure ⋮ The weight distribution of a class of \(p\)-ary cyclic codes and their applications ⋮ Error-correcting codes and cryptography ⋮ Secret sharing schemes for compartmented access structures ⋮ Multisecret-sharing schemes and bounded distance decoding of linear codes ⋮ Two classes of ternary codes and their weight distributions ⋮ On the maximum number of minimal codewords ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A novel secret sharing scheme based on minimal linear codes ⋮ A geometric characterization of minimal codes and their asymptotic performance ⋮ A family of group character codes
Cites Work
This page was built for publication: Secret-sharing with a class of ternary codes
