VSS Made Simpler
From MaRDI portal
Recommendations
Cites work
- Algebraic curves in cryptography
- Amortizing randomness in private multiparty computations
- Asynchronous secure computation
- General secure multi-party computation from any linear secret-sharing scheme
- How to share a secret
- scientific article; zbMATH DE number 1583776 (Why is no real title available?)
- scientific article; zbMATH DE number 1942444 (Why is no real title available?)
- scientific article; zbMATH DE number 1440891 (Why is no real title available?)
- Improving the Round Complexity of VSS in Point-to-Point Networks
- Introduction to Coding Theory
- 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
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)