Lightweight asynchronous verifiable secret sharing with optimal resilience

Cites Work

GNUC: a new universal composability framework
Title not available (Why is that?)
Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
Scalable and Unconditionally Secure Multiparty Computation
Asynchronous secure computation
Perfectly-Secure MPC with Linear Communication Complexity
Theory of Cryptography
Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
\(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
Asynchronous byzantine agreement protocols
Universally Composable Synchronous Computation
An Efficient Framework for Unconditionally Secure Multiparty Computation
Title not available (Why is that?)
Robust Multiparty Computation with Linear Communication Complexity
Asynchronous Secure Multiparty Computation in Constant Time
Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings
Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
Asynchronous Multi-Party Computation with Quadratic Communication
On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
\textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation

Cited In (1)

Linear-communication asynchronous complete secret sharing with optimal resilience

This page was built for publication: Lightweight asynchronous verifiable secret sharing with optimal resilience

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570529)