VSS Made Simpler

DOI10.1007/978-3-030-26834-3_19MaRDI QIDQ6488939zbMATH OpenFDO

Authors Yvo Desmedt, Kirill E. Morozov

Publication date 14 March 2024

Full work available at URL https://doi.org/10.1007/978-3-030-26834-3_19

Mathematics Subject Classification ID

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

Recommendations

• Broadcast (and round) efficient verifiable secret sharing
• Efficient VSS free of computational assumption
• Computational verifiable secret sharing revisited
• On the complexity of verifiable secret sharing and multiparty computation
• Verifiable secret sharing in a total of three rounds

Cites work

• Algebraic curves in cryptography
• Amortizing randomness in private multiparty computations
• Asynchronous secure computation
• Efficient secure multi-party computation. (Extended Abstract)
• General secure multi-party computation from any linear secret-sharing scheme
• How to share a secret
• Improving the Round Complexity of VSS in Point-to-Point Networks
• Introduction to Coding Theory
• Linear VSS and distributed commitments based on secret sharing and pairwise checks
• Perfectly-Secure MPC with Linear Communication Complexity
• Player simulation and general adversary structures in perfect multiparty computation
• Public keys
• Randomness complexity of private computation
• Randomness in Private Computations
• Randomness versus fault-tolerance
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Secure multi-party computation made simple
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• The round complexity of perfectly secure general VSS
• The round complexity of verifiable secret sharing and secure multicast
• The Round Complexity of Verifiable Secret Sharing Revisited
• Theory of Cryptography
• Unconditionally secure proactive secret sharing scheme with combinatorial structures

This page was built for publication: VSS Made Simpler

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