Improving the round complexity of VSS in point-to-point networks

DOI10.1016/J.IC.2009.03.007MaRDI QIDQ2389350zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• Improving the Round Complexity of VSS in Point-to-Point Networks
• Broadcast (and round) efficient verifiable secret sharing
• The round complexity of perfectly secure general VSS
• Theory of Cryptography
• The Round Complexity of Verifiable Secret Sharing Revisited

Cites work

• scientific article; zbMATH DE number 503254 (Why is no real title available?)
• A lower bound for the time to assure interactive consistency
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Efficient player-optimal protocols for strong and differential consensus
• General secure multi-party computation from any linear secret-sharing scheme
• How to share a secret
• On expected constant-round protocols for Byzantine agreement
• Perfectly secure message transmission
• Round-Efficient Secure Computation in Point-to-Point Networks
• Sequential composition of protocols without simultaneous termination
• The Round Complexity of Verifiable Secret Sharing Revisited
• The round complexity of verifiable secret sharing and secure multicast
• Theory of Cryptography

Cited in

(11)

• Round-Efficient Secure Computation in Point-to-Point Networks
• The round complexity of verifiable secret sharing and secure multicast
• Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
• The round complexity of statistical MPC with optimal resiliency
• Cheating identifiable secret sharing scheme using symmetric bivariate polynomial
• Improving the Round Complexity of VSS in Point-to-Point Networks
• Perfect (parallel) broadcast in constant expected rounds via statistical VSS
• The round complexity of perfectly secure general VSS
• Dynamic and verifiable hierarchical secret sharing
• Verifiable secret sharing in a total of three rounds
• Broadcast (and round) efficient verifiable 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)