Algebraic geometric secret sharing schemes over large fields are asymptotically threshold (Q2171881): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.2140/pjm.2022.319.213 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 2101.01304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3202940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Threshold Gap in Secret Sharing and its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Computation from Random Error Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Access Structures of Elliptic Secret Sharing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Arithmetic Codex: Theory and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Multiparty Computation and Secret Sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: OT-Combiners via Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Oblivious Transfer – Efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting Correlations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twisted L-Functions and Monodromy. (AM-150) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting subset sums of finite Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic function fields and codes / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.2140/PJM.2022.319.213 / rank
 
Normal rank

Latest revision as of 08:29, 17 December 2024

scientific article
Language Label Description Also known as
English
Algebraic geometric secret sharing schemes over large fields are asymptotically threshold
scientific article

    Statements

    Algebraic geometric secret sharing schemes over large fields are asymptotically threshold (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2022
    0 references
    In this paper algebraic geometric geometric secret sharing schemes are studied. Such a secret sharing scheme is defined by a smooth projective absolutely irreducible algebraic curve \(C\) over a finite field \(\mathbb{F}_q\). We consider a subset \(\{Q, P_0, P_1,\ldots , P_n\}\) of \( C(\mathbb{F}_q)\) and the divisors \(D = P_0+\cdots + P_n\) and \(G = mQ\) for some \(Q \not \in supp(D)\). Then we have the secret sharing scheme from the algebraic geometric code \(C_{\Omega}(D,G)\), with the set of players \(\mathcal{P} = \{P_1,\ldots , P_n\}\). Let \(g\) be the genus of \(C\). Suppose that \(q \rightarrow \infty\) and \(\lim_{q\rightarrow \infty} g/q^{1/2} = 0\). Further, suppose that \(m = \delta n\), where \( \delta\) is a constant between 0 and \(2/3\), and that \(m \) and \(n\) go to infinity as \(q\) tends to infinity. Finally, suppose that \(|C(\mathbb{F}_q)| - |\mathcal{P}|\) is bounded by a constant \(c\) as \(q\) tends to infinity. Then, it is proved that when \(0 \leq m - t < g\), the proportion of qualified subsets approaches 0, and when \(g \leq m - t < 2g\), the proportion of qualified subsets approaches to 1. Moreover, the case when the size \(q\) of the base field is fixed and the genus goes to infinity is also analysed.
    0 references
    algebraic geometric secret sharing
    0 references
    quasithreshold
    0 references
    threshold
    0 references
    algebraic-geometry codes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references