Secret Sharing Schemes with a large number of players from Toric Varieties
Johan P. Hansen

TL;DR
This paper introduces a general framework for creating linear secret sharing schemes from toric varieties, enabling schemes with a very large number of players and detailed threshold analysis.
Contribution
It develops a comprehensive method for constructing secret sharing schemes from toric varieties, including thresholds and multiplication conditions, especially applied to toric surfaces.
Findings
Schemes with up to (q-1)^r - 1 players constructed
Threshold bounds determined using cohomology and intersection theory
Conditions for strong multiplication established
Abstract
A general theory for constructing linear secret sharing schemes over a finite field from toric varieties is introduced. The number of players can be as large as for . We present general methods for obtaining the reconstruction and privacy thresholds as well as conditions for multiplication on the associated secret sharing schemes. In particular we apply the method on certain toric surfaces. The main results are ideal linear secret sharing schemes where the number of players can be as large as . We determine bounds for the reconstruction and privacy thresholds and conditions for strong multiplication using the cohomology and the intersection theory on toric surfaces.
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 · Coding theory and cryptography · Algebraic Geometry and Number Theory
