Algebraic geometric secret sharing schemes over large fields are asymptotically threshold
DOI10.2140/pjm.2022.319.213zbMath1499.14047arXiv2101.01304OpenAlexW3128288149WikidataQ114045236 ScholiaQ114045236MaRDI QIDQ2171881
Fan Peng, Chang-An Zhao, Hao Chen
Publication date: 12 September 2022
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.01304
Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Computational aspects of algebraic curves (14Q05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Algebraic functions and function fields in algebraic geometry (14H05)
Cites Work
- Counting subset sums of finite Abelian groups
- Algebraic function fields and codes
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Twisted L-Functions and Monodromy. (AM-150)
- The Arithmetic Codex: Theory and Applications
- How to share a secret
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- Access Structures of Elliptic Secret Sharing Schemes
- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
- Extracting Correlations
- Bounds on the Threshold Gap in Secret Sharing and its Applications
- Secure Computation from Random Error Correcting Codes
- OT-Combiners via Secure Computation
- Secure Multiparty Computation and Secret Sharing
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algebraic geometric secret sharing schemes over large fields are asymptotically threshold
