Journals / Hacettepe Journal of Mathematics and Statistics / 2020 / Cilt: 49 - Sayı: 2

Construction of arithmetic secret sharing schemes by using torsion limits

Pages
638–647
Publication Date
2022-10-18
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Furthermore, we give new bounds on the torsion limits of certain towers of function fields over finite fields.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Cascudo, Cramer, and Xing [Torsion limits and Riemann-Roch systems for function fields and applications, IEEE Trans.
📊
Key Findings & Data:Theory, 2014] gave a construction of arithmetic secret sharing schemes by using the torsion limits of algebraic function fields and Riemann-Roch systems.
💡
Conclusion & Impact:Furthermore, we give new bounds on the torsion limits of certain towers of function fields over finite fields.
🔬Design:Research Article
📍Scope:2014 Verileri
⚙️Variables:Algebraic function fields · torsion limits · Arithmetic secret sharing schemes

Abstract

Cascudo, Cramer, and Xing [Torsion limits and Riemann-Roch systems for function fields and applications, IEEE Trans. Inf. Theory, 2014] gave a construction of arithmetic secret sharing schemes by using the torsion limits of algebraic function fields and Riemann-Roch systems. In this work, we give some new conditions for the construction of arithmetic secret sharing schemes. Furthermore, we give new bounds on the torsion limits of certain towers of function fields over finite fields.

🔖

Cite This Article

Tutdere, S., Uzunkol, O. (2022). Construction of arithmetic secret sharing schemes by using torsion limits. Hacettepe Journal of Mathematics and Statistics, Cilt: 49 - Sayı: 2, 638–647. https://ajindex.com/articles/529567

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (16)

  1. S. Ballet, R. Rolland, and S. Tutdere, Lower bounds on the number of rational points of Jacobians over finite fields and application to algebraic function fields in towers, Moscow Math. J. 15 (3), 1–9, 2015
  2. A. Bassa, P. Beelen, A. Garcia, and H. Stichtenoth, Towers of function fields over non-prime finite fields, Moscow Math. J. 15 (1), 1–29, 2015
  3. A. Beimel, Secret-sharing schemes: A survey, IWCC 2011: LNCS 6639 Springer Verlag: 11–46, 2011
  4. I. Cascudo, R. Cramer, and C. Xing, The torsion-limit for algebraic function fields and its application to arithmetic secret sharing, CRYPTO 2011: LNCS 6841 Springer Verlag: 685–705, 2011
  5. I. Cascudo, R. Cramer, and C. Xing, Bounds on the threshold gap in secret sharing and its applications, IEEE Trans. Inf. Theory 59 (9), 5600–5612, 2013
  6. I. Cascudo, R. Cramer, and C. Xing, Torsion limits and Riemann-Roch systems for function fields and applications, IEEE Trans. Inf. Theory 60 (7), 3871–3888, 2014
  7. D. Chaum, C. Crépeau, and I. Damgaard, Multi-Party unconditionally secure protocols, Proceedings of STOC 1988: ACM Press, New York, 11–19, 1988
  8. H. Chen and R. Cramer, Algebraic geometric secret sharing schemes and secure multiparty computations over small fields, CRYPTO 2006: LNCS 4117 Springer Verlag: 516–531, 2006
  9. R. Cramer, I. Damgaard, and U. Maurer, General secure multi-party computation from any linear secret sharing scheme, EUROCRYPT 2000: LNCS 1807 Springer Verlag: 316–334, 2000
  10. O. Farràs, C. Padró, C. Xing, and A. Yang, Natural generalizations of threshold secret sharing IEEE Trans. Inf. Theory 60 (3), 1652–1664, 2014
  11. A. Garcia and H. Stichtenoth, A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound, Invent. Math. 121, 211–222, 1995
  12. F. Hess, H. Stichtenoth, and S. Tutdere, On invariants of towers of function fields over finite fields, J. Algebra Appl. 12 (4), 1250190, 2013
  13. T. Ignatenko and F.M.J. Willems, Biometric systems: Privacy and secrecy aspects, IEEE Trans. Inf. Forensics Secur. 4 (4), 956–973, 2009
  14. Y. Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai, Zero-knowledge from secure multi-party computation, Proceedings of 39th STOC: San Diego, Ca., USA: 21–30, 2007
  15. Y. Ishai, M. Prabhakaran, and A. Sahai, Founding cryptography on oblivious transfer efficiently CRYPTO 2008: LNCS 157 Springer Verlag: 572–591, 2008
  16. M. Ito, A. Saito, and T. Nishizeki, Multiple assignment scheme for sharing secret,