Improving the Round Complexity of VSS in Point-to-Point Networks

DOI10.1007/978-3-540-70583-3_41zbMath1155.68319OpenAlexW1793668128MaRDI QIDQ3519526

Chiu-Yuen Koo, Ranjit Kumaresan, Jonathan N. Katz

Publication date: 19 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_41

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (11)

Optimal extension protocols for Byzantine broadcast and agreement ⋮ Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ Efficient VSS free of computational assumption ⋮ Asynchronous Byzantine agreement with optimal resilience ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ Verifiable quantum secret sharing based on a single qudit ⋮ Strong \((n, t, n)\) verifiable secret sharing scheme ⋮ On expected constant-round protocols for Byzantine agreement ⋮ Dynamic threshold secret reconstruction and its application to the threshold cryptography

This page was built for publication: Improving the Round Complexity of VSS in Point-to-Point Networks