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

A Characterization of Optimal-Rate Linear Homomorphic Secret Sharing Schemes, and Applications (2311.14842v1)

Published 24 Nov 2023 in cs.IT, cs.CR, 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 each server. Recent work (Fosli, Ishai, Kolobov, and Wootters, ITCS 2022) established a fundamental limitation on the download rate of linear HSS schemes for computing low-degree polynomials, and gave an example of HSS schemes that meet this limit. In this paper, we further explore optimal-rate linear HSS schemes for polynomials. Our main result is a complete characterization of such schemes, in terms of a coding-theoretic notion that we introduce, termed optimal labelweight codes. We use this characterization to answer open questions about the amortization required by HSS schemes that achieve optimal download rate. In more detail, the construction of Fosli et al. required amortization over $\ell$ instances of the problem, and only worked for particular values of $\ell$. We show that -- perhaps surprisingly -- the set of $\ell$'s for which their construction works is in fact nearly optimal, possibly leaving out only one additional value of $\ell$. We show this by using our coding-theoretic characterization to prove a necessary condition on the $\ell$'s admitting optimal-rate linear HSS schemes. We then provide a slightly improved construction of optimal-rate linear HSS schemes, where the set of allowable $\ell$'s is optimal in even more parameter settings. Moreover, based on a connection to the MDS conjecture, we conjecture that our construction is optimal for all parameter regimes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (28)
  1. On sets of vectors of a finite vector space in which every subset of basis size is a basis ii. Designs, Codes and Cryptography, 65:5 – 14, 2012.
  2. Homomorphic secret sharing: optimizations and applications. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pages 2105–2122, 2017.
  3. Efficient pseudorandom correlation generators: Silent OT extension and more. In CRYPTO, pages 489–518, 2019.
  4. Josh Cohen Benaloh. Secret sharing homomorphisms: Keeping shares of A secret sharing. In Andrew M. Odlyzko, editor, CRYPTO ’86, pages 251–260, 1986.
  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. Multiparty unconditionally secure protocols (extended abstract). In STOC, 1988.
  14. 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.
  15. General secure multi-party computation from any linear secret-sharing scheme. In EUROCRYPT, 2000.
  16. Private information retrieval. J. ACM, 1998.
  17. Breaking the circuit size barrier for secure computation under quasi-polynomial LPN. In EUROCRYPT 2021, Part II, pages 842–870, 2021.
  18. 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.
  19. Multi-party homomorphic secret sharing and sublinear mpc from sparse lpn. In Annual International Cryptology Conference, pages 315–348. Springer, 2023.
  20. Homomorphic secret sharing from Paillier encryption. In Provable Security, 2017.
  21. 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.
  22. F.R. Gantmacher. The Theory of Matrices. Chelsea Publishing Company, 1980.
  23. Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (Part III: Fundamental Electronic Science), 72(9):56–64, 1989.
  24. The rise of paillier: Homomorphic secret sharing and public-key silent OT. In EUROCRYPT 2021, Part I, pages 678–708, 2021.
  25. Large message homomorphic secret sharing from DCR and applications. In CRYPTO 2021, Part III, pages 687–717, 2021.
  26. Beniamino Segre. Curve razionali normali ek-archi negli spazi finiti. Annali di Matematica Pura ed Applicata, 39:357–379, 1955.
  27. William P. Wardlaw. Matrix representation of finite fields. Mathematics Magazine, 67:289–293, 1994.
  28. Jack Keil Wolf. Adding two information symbols to certain nonbinary bch codes and some applications. The Bell System Technical Journal, 48(7):2405–2424, 1969.
Citations (1)
View on Semantic Scholar

Summary

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

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