Algebraic Geometric Secret Sharing Schemes over Large Fields Are Asymptotically Threshold
Fan Peng, Hao Chen, Chang-An Zhao

TL;DR
This paper demonstrates that algebraic geometric secret sharing schemes over large finite fields become asymptotically threshold schemes as the field size increases, with most subsets either reconstructing the secret or having no information.
Contribution
It proves that over large fields, these schemes are asymptotically threshold, extending understanding of their threshold properties in the limit.
Findings
Almost all subsets of size between T and T+g-1 have no information about the secret.
Almost all subsets of size between T+g and T+2g-1 can reconstruct the secret.
Schemes become asymptotically threshold as the field size q approaches infinity with g/√q → 0.
Abstract
In Chen-Cramer Crypto 2006 paper \cite{cc} algebraic geometric secret sharing schemes were proposed such that the "Fundamental Theorem in Information-Theoretically Secure Multiparty Computation" by Ben-Or, Goldwasser and Wigderson \cite{BGW88} and Chaum, Cr\'{e}peau and Damg{\aa}rd \cite{CCD88} can be established over constant-size base finite fields. These algebraic geometric secret sharing schemes defined by a curve of genus over a constant size finite field is quasi-threshold in the following sense, any subset of players (non qualified) has no information of the secret and any subset of players (qualified) can reconstruct the secret. It is natural to ask that how far from the threshold these quasi-threshold secret sharing schemes are? How many subsets of players can recover the secret or have no information of the secret?…
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 · Complexity and Algorithms in Graphs
