Paper 2015/1124

Secret Sharing Schemes Based on Resilient Boolean Maps

Juan Carlos Ku-Cauich and Guillermo Morales-Luna

Abstract

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.

Metadata
Available format(s)
PDF
Publication info
Preprint. MAJOR revision.
Keywords
Secret sharing schemesCheater detectionResilient mapsVector linear codes
Contact author(s)
jckc35 @ hotmail com
History
2018-03-23: revised
2015-11-22: received
See all versions
Short URL
https://ia.cr/2015/1124
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/1124,
      author = {Juan Carlos Ku-Cauich and Guillermo Morales-Luna},
      title = {Secret Sharing Schemes Based on Resilient Boolean Maps},
      howpublished = {Cryptology ePrint Archive, Paper 2015/1124},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/1124}},
      url = {https://eprint.iacr.org/2015/1124}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.