Lightweight asynchronous verifiable secret sharing with optimal resilience

DOI10.1007/S00145-024-09505-6MaRDI QIDQ6570529zbMATH OpenFDO

Authors Victor Shoup, N. P. Smart

Publication date 10 July 2024

Published in Journal of Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00145-024-09505-6

zbMATH Keywords

Galois ringsasynchronousverifiable-secret-sharing

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient statistical asynchronous verifiable secret sharing with optimal resilience
• Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
• Asynchronous computational VSS with reduced communication complexity
• Efficient asynchronous verifiable secret sharing and multiparty computation
• Batch secret sharing for secure multi-party computation in asynchronous network

Cites work

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

Cited in

(6)

• Randomized agreement, verifiable secret sharing and multi-party computation in granular synchrony
• \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
• Computationally efficient asynchronous MPC with linear communication and low additive overhead
• Fast batched asynchronous distributed key generation
• Bivariate proximity test-based asynchronous verifiable secret sharing
• 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)