Improving the round complexity of VSS in point-to-point networks
From MaRDI portal
Publication:2389350
DOI10.1016/J.IC.2009.03.007zbMATH Open1184.68237OpenAlexW2059295401MaRDI QIDQ2389350FDOQ2389350
Authors: Chiu-Yuen Koo, Ranjit Kumaresan, Jonathan Katz 
Publication date: 15 July 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2009.03.007
Recommendations
Cites Work
- How to share a secret
- General secure multi-party computation from any linear secret-sharing scheme
- Perfectly secure message transmission
- A lower bound for the time to assure interactive consistency
- The Round Complexity of Verifiable Secret Sharing Revisited
- The round complexity of verifiable secret sharing and secure multicast
- Theory of Cryptography
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Sequential composition of protocols without simultaneous termination
- On expected constant-round protocols for Byzantine agreement
- Efficient player-optimal protocols for strong and differential consensus
- Round-Efficient Secure Computation in Point-to-Point Networks
- Title not available (Why is that?)
Cited In (8)
- Round-Efficient Secure Computation in Point-to-Point Networks
- The round complexity of perfectly secure general VSS
- Improving the Round Complexity of VSS in Point-to-Point Networks
- Verifiable secret sharing in a total of three rounds
- Cheating identifiable secret sharing scheme using symmetric bivariate polynomial
- The round complexity of statistical MPC with optimal resiliency
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- Dynamic and Verifiable Hierarchical Secret Sharing
This page was built for publication: Improving the round complexity of VSS in point-to-point networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389350)
