IACR News item: 22 November 2015
Juan Carlos Ku-Cauich, Guillermo Morales-Luna
ePrint Report
We introduce a linear code based on resilient maps on vector spaces over finite fields, we give a basis of this code and upper and lower
bounds for its minimal distance. Then the use of the introduced code
for building vector space secret sharing schemes is explained and an
estimation of the robustness of the schemes against cheaters is provided.
Additional news items may be found on the IACR news page.