A Comparison of Secret Sharing Schemes Based on Latin Squares and RSA
Liam Wagner

TL;DR
This paper critically compares Latin Squares-based and RSA-based secret sharing schemes, analyzing their security strengths and weaknesses to inform better application choices.
Contribution
It provides a detailed comparison of two prominent secret sharing schemes, highlighting their security features and limitations.
Findings
Latin Squares scheme offers unique security properties.
RSA scheme is well-established with proven security.
Both schemes have specific advantages and drawbacks.
Abstract
In recent years there has been a great deal of work done on secret sharing scehemes. Secret Sharing Schemes allow for the division of keys so that an authorised set of users may access information. In this paper we wish to present a critical comparison of two of these schemes based on Latin Squares, [Cooper et., al.] and RSA [Shoup]. These two protocols will be examined in terms of their positive and negative aspects of their secuirty.
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 · Cloud Data Security Solutions
