Abstract
AbstractWe present new protocols for Asynchronous Verifiable Secret Sharing for Shamir (i.e., threshold $$t<n$$
t
<
n
) sharing of secrets. Our protocols:
Use only “lightweight” cryptographic primitives, such as hash functions;
Can share secrets over rings such as $${\mathbb {Z}}/(p^k)$$
Z
/
(
p
k
)
as well as finite fields $$\mathbb {F}_q$$
F
q
;
Provide optimal resilience, in the sense that they tolerate up to $$t < n/3$$
t
<
n
/
3
corruptions, where n is the total number of parties;
Are complete, in the sense that they guarantee that if any honest party receives their share then all honest parties receive their shares;
Employ batching techniques, whereby a dealer shares many secrets in parallel and achieves an amortized communication complexity that is linear in n, at least on the “happy path”, where no party provably misbehaves.
Publisher
Springer Science and Business Media LLC
Reference40 articles.
1. M. Abspoel, R. Cramer, I. Damgård, D. Escudero, C. Yuan, Efficient information-theoretic secure multiparty computation over $$\mathbb{Z}/p^k\mathbb{Z}$$ via galois rings. In D. Hofheinz and A. Rosen, editors, TCC 2019: 17th Theory of Cryptography Conference, Part I, volume 11891 of Lecture Notes in Computer Science, Nuremberg, Germany, Dec. 1–5, (Springer, Heidelberg, Germany, 2019), pp. 471–501
2. M. Abspoel, R. Cramer, I. Damgård, D. Escudero, M. Rambaud, C. Xing, C. Yuan, Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over $$\mathbb{Z}/p^k\mathbb{Z}$$. In S. Moriai and H. Wang, editors, Advances in Cryptology – ASIACRYPT 2020, Part III, volume 12493 of Lecture Notes in Computer Science, Daejeon, South Korea, Dec. 7–11, (Springer, Heidelberg, Germany, 2020), pp. 151–180
3. I. Abraham, P. Jovanovic, M. Maller, S. Meiklejohn, G. Stern, Bingo: Adaptivity and asynchrony in verifiable secret sharing and distributed key generation. In H. Handschuh and A. Lysyanskaya, editors, Advances in Cryptology – CRYPTO 2023, Part I, volume 14081 of Lecture Notes in Computer Science, Santa Barbara, CA, USA, Aug. 20–24, (Springer, Heidelberg, Germany, 2023), pp. 39–70,
4. A. Bandarupalli, A. Bhat, S. Bagchi, A. Kate, M. Reiter, HashRand: Efficient asynchronous random beacon without threshold cryptographic setup. Cryptology ePrint Archive, Paper 2023/1755, 2023. https://eprint.iacr.org/2023/1755.
5. M. Ben-Or, R. Canetti, O. Goldreich, Asynchronous secure computation. In 25th Annual ACM Symposium on Theory of Computing, San Diego, CA, USA, May 16–18, (ACM Press, 1993), pp. 52–61
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献