Improved Latin Square based Secret Sharing Scheme
Chi Sing Chum, Xiaowen Zhang

TL;DR
This paper enhances Latin square-based secret sharing schemes by integrating cryptographic hash functions and herding attack techniques to address inherent limitations, improving security and efficiency.
Contribution
It introduces a novel method combining cryptographic hash functions and herding attacks with Latin square schemes to overcome existing limitations.
Findings
Improved security against certain attacks
Enhanced efficiency in secret sharing
Better resistance to cryptanalysis
Abstract
This paper first reviews some basic properties of cryptographic hash function, secret sharing scheme, and Latin square. Then we discuss why Latin square or its critical set is a good choice for secret representation and its relationship with secret sharing scheme. Further we enumerate the limitations of Latin square in a secret sharing scheme. Finally we propose how to apply cryptographic hash functions, herding attack technique to a Latin square based secret sharing scheme to overcome these limitations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Chaos-based Image/Signal Encryption · Cryptographic Implementations and Security
