Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Improved Trade-offs Between Amortization and Download Bandwidth for Linear HSS (2403.08719v2)

Published 13 Mar 2024 in cs.IT and math.IT

Abstract: A Homomorphic Secret Sharing (HSS) scheme is a secret-sharing scheme that shares a secret $x$ among $s$ servers, and additionally allows an output client to reconstruct some function $f(x)$ using information that can be locally computed by each server. A key parameter in HSS schemes is download rate, which quantifies how much information the output client needs to download from the servers. Often, download rate is improved by amortizing over $\ell$ instances of the problem, making $\ell$ also a key parameter of interest. Recent work (Fosli, Ishai, Kolobov, and Wootters 2022) established a limit on the download rate of linear HSS schemes for computing low-degree polynomials and constructed schemes that achieve this optimal download rate; their schemes required amortization over $\ell = \Omega(s \log(s))$ instances of the problem. Subsequent work (Blackwell and Wootters, 2023) completely characterized linear HSS schemes that achieve optimal download rate in terms of a coding-theoretic notion termed optimal labelweight codes. A consequence of this characterization was that $\ell = \Omega(s \log(s))$ is in fact necessary to achieve optimal download rate. In this paper, we characterize all linear HSS schemes, showing that schemes of any download rate are equivalent to a generalization of optimal labelweight codes. This equivalence is constructive and provides a way to obtain an explicit linear HSS scheme from any linear code. Using this characterization, we present explicit linear HSS schemes with slightly sub-optimal rate but with much improved amortization $\ell = O(s)$. Our constructions are based on algebraic geometry codes (specifically Hermitian codes and Goppa codes).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (30)
  1. Homomorphic secret sharing: optimizations and applications. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pages 2105–2122, 2017.
  2. Efficient pseudorandom correlation generators: Silent OT extension and more. In CRYPTO, pages 489–518, 2019.
  3. Josh Cohen Benaloh. Secret sharing homomorphisms: Keeping shares of A secret sharing. In Andrew M. Odlyzko, editor, CRYPTO ’86, pages 251–260, 1986.
  4. Elwyn Berlekamp. Goppa codes. IEEE Transactions on Information Theory, 19(5):590–592, 1973.
  5. Hiding instances in multioracle queries. In STACS 90, pages 37–48, 1990.
  6. Security with low communication overhead. In CRYPTO ’90, pages 62–76, 1990.
  7. Function secret sharing. In EUROCRYPT 2015, Part II, pages 337–367, 2015.
  8. Breaking the circuit size barrier for secure computation under DDH. In Matthew Robshaw and Jonathan Katz, editors, Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part I, volume 9814 of Lecture Notes in Computer Science, pages 509–539. Springer, 2016.
  9. Function secret sharing: Improvements and extensions. In Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi, editors, Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, October 24-28, 2016, pages 1292–1303. ACM, 2016.
  10. Foundations of homomorphic secret sharing. In Anna R. Karlin, editor, 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11-14, 2018, Cambridge, MA, USA, volume 94 of LIPIcs, pages 21:1–21:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
  11. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In STOC, 1988.
  12. Homomorphic secret sharing from lattices without FHE. In EUROCRYPT 2019, Part II, pages 3–33, 2019.
  13. A characterization of optimal-rate linear homomorphic secret sharing schemes, and applications. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2023.
  14. Multiparty unconditionally secure protocols (extended abstract). In STOC, 1988.
  15. Share conversion, pseudorandom secret-sharing and applications to secure computation. In Joe Kilian, editor, Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings, volume 3378 of Lecture Notes in Computer Science, pages 342–362. Springer, 2005.
  16. General secure multi-party computation from any linear secret-sharing scheme. In EUROCRYPT, 2000.
  17. Private information retrieval. J. ACM, 1998.
  18. Breaking the circuit size barrier for secure computation under quasi-polynomial LPN. In EUROCRYPT 2021, Part II, pages 842–870, 2021.
  19. Spooky encryption and its applications. In Matthew Robshaw and Jonathan Katz, editors, Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part III, volume 9816 of Lecture Notes in Computer Science, pages 93–122. Springer, 2016.
  20. Multi-party homomorphic secret sharing and sublinear mpc from sparse lpn. In Annual International Cryptology Conference, pages 315–348. Springer, 2023.
  21. Homomorphic secret sharing from Paillier encryption. In Provable Security, 2017.
  22. On the download rate of homomorphic secret sharing. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2022.
  23. Valerii Denisovich Goppa. Codes associated with divisors. Problemy Peredachi Informatsii, 13(1):33–39, 1977.
  24. Essential coding theory. Draft from http://www.cse.buffalo.edu/atri/courses/coding-theory/book, 2019.
  25. Algebraic curves over a finite field, volume 20. Princeton University Press, 2008.
  26. Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (Part III: Fundamental Electronic Science), 72(9):56–64, 1989.
  27. The rise of paillier: Homomorphic secret sharing and public-key silent OT. In EUROCRYPT 2021, Part I, pages 678–708, 2021.
  28. Large message homomorphic secret sharing from DCR and applications. In CRYPTO 2021, Part III, pages 687–717, 2021.
  29. Henning Stichtenoth. Algebraic Function Fields and Codes. Springer Publishing Company, Incorporated, 2nd edition, 2008.
  30. M. Van der Vlugt. The true dimension of certain binary goppa codes. IEEE Transactions on Information Theory, 36(2):397–398, 1990.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets