A Latin square autotopism secret sharing scheme
Lists
Only you see this
Abstract
We present a novel secret sharing scheme where the secret is an autotopism (a symmetry) of a Latin square. Previously proposed secret sharing schemes involving Latin squares have many drawbacks: (a) Latin squares contain $$n^2$$ n 2 entries, which may be too large, (b) partial information about the secret may be directly revealed, (c) a subsequently discovered subtle “flaw”, (d) difficulty in initialization and reconstruction, (e) difficulty in verification, and (f) difficulty in generalizing to a multi-level scheme. We carefully analyze the security of the proposed scheme, and identify how it overcomes all of these problems.
BibTeX
@article{stones2016latin,
author = {Rebecca J. Stones and Ming Su and Xiaoguang Liu and Gang Wang and Sheng Lin},
title = {{A Latin square autotopism secret sharing scheme}},
journal = {Des. Codes Cryptogr.},
year = {2016},
doi = {10.1007/s10623-015-0123-1},
}| Secret Sharing for Generic Theoretic Cryptography | arXiv · 2022 |
| A Dynamic Secret Sharing Scheme Based on Factorization | Computer · 2011 |
| Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes | Asiacrypt · 2004 |
| Secret Sharing with Binary Shares | arXiv · 2018 |
| Sharing a Secret Image in Binary Images with Verification | J. Inf. Hiding Multim. Signal Process · 2011 |
| A Novel Proactive Multi-secret Sharing Scheme | Int. J. Netw. Secur · 2015 |