EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Haven++: Batched and Packed Dual-Threshold Asynchronous Complete Secret Sharing with Applications

Nicolas Alhaddad, Mayank Varia, Ziling Yang

IACR Communications in Cryptology · 13.01.2025 · 1 (4)

DOI: 10.62056/a0qj5w7sf ↗

Kurz gefasst

Fachartikel in der Zeitschrift IACR Communications in Cryptology, online erschienen am 13.01.2025. Verfasst von Nicolas Alhaddad und 2 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 44 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: U.S. National Science Foundation, Defense Advanced Research Projects Agency.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Asynchronous complete secret sharing (ACSS) is a foundational primitive in the design of distributed algorithms and cryptosystems that require confidentiality. ACSS permits a dealer to distribute a secret to a collection of N servers so that everyone holds shares of a polynomial containing the dealer's secret. This work contributes a new ACSS protocol, called Haven++, that uses packing and batching to make asymptotic and concrete advances in the design and application of ACSS for large secrets. Haven++ allows the dealer to pack multiple secrets in a single sharing phase, and to reconstruct either one or all of them later. For even larger secrets, we contribute a batching technique to amortize the cost of proof generation and verification across multiple invocations of our protocol. The result is an asymptotic improvement in the worst-case amortized communication and computation complexity, both for ACSS itself and for its application to asynchronous distributed key generation. Our ADKG based on Haven++ achieves, for the first time, an optimal worst case amortized communication complexity of κN without a trusted setup. To show the practicality of Haven++, we implement it and find that it outperforms the work of Yurek et al. (NDSS 2022) by more than an order of magnitude when there are malicious, faulty parties.

Förderung

  • U.S. National Science Foundation
  • Defense Advanced Research Projects Agency

Zitieren

APA

Alhaddad, N., Varia, M., & Yang, Z. (2025). Haven++: Batched and Packed Dual-Threshold Asynchronous Complete Secret Sharing with Applications. IACR Communications in Cryptology, 1(4). https://doi.org/10.62056/a0qj5w7sf

Vancouver

Alhaddad N, Varia M, Yang Z. Haven++: Batched and Packed Dual-Threshold Asynchronous Complete Secret Sharing with Applications. IACR Communications in Cryptology. 2025;1(4). doi:10.62056/a0qj5w7sf

BibTeX
@article{Alhaddad2025,
  author = {Alhaddad, Nicolas and Varia, Mayank and Yang, Ziling},
  title = {Haven++: Batched and Packed Dual-Threshold Asynchronous Complete Secret Sharing with Applications},
  journal = {IACR Communications in Cryptology},
  year = {2025},
  volume = {1},
  number = {4},
  doi = {10.62056/a0qj5w7sf}
}
Kostenlos starten →