A Comparison of Secret Sharing Schemes Based on Latin Squares and RSA
Liam Wagner
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.
Create a lesson
Related papers
Bilateral Protection for Private LoRA Inference with Intel TDX
Xiaodong Li, Mingyuan Ma, Dongbo Yan
Can Benign Skills Induce Misaligned Behavior in LLM Agents?
Xuanye Zhang, Yongsen Zheng, Kaiyu Zhou et al.
The Native Menace: Host-to-Browser Cross-Boundary Attacks via Native Messaging
Jyotirmay Chauhan, Rownak Islam, Jason Polakis
When Debate Amplifies Risk: Social-Bias Vulnerabilities in Multi-Agent Safety Deliberation
Qinghua Mao, Xi Lin, Yuxin Qi et al.
VerfGraph: Efficient Zero-Knowledge Verifiable Graph Query Evaluation System
Tianyi Ma, Yuncong Zhang, Yuanzhuo Yu et al.
ScrambleMark: Zero-Query Watermark-Agnostic Black-Box Evasion of Modern Speech Watermarking
Binhao Ma, Weikang Ding, Hanqing Guo et al.