VSS Made Simpler

DOI10.1007/978-3-030-26834-3_19MaRDI QIDQ6488939

Yvo G. Desmedt, Kirill Morozov

Publication date: 14 March 2024

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomness complexity of private computation
• Player simulation and general adversary structures in perfect multiparty computation
• Randomness versus fault-tolerance
• Secure multi-party computation made simple
• Amortizing randomness in private multiparty computations
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• Algebraic Curves in Cryptography
• Public Keys
• The Round Complexity of Perfectly Secure General VSS
• How to share a secret
• The Round Complexity of Verifiable Secret Sharing Revisited
• Improving the Round Complexity of VSS in Point-to-Point Networks
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Randomness in Private Computations
• The round complexity of verifiable secret sharing and secure multicast
• Asynchronous secure computation
• Perfectly-Secure MPC with Linear Communication Complexity
• Introduction to Coding Theory
• Theory of Cryptography

This page was built for publication: VSS Made Simpler