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

DOI10.1007/978-3-540-70583-3_41MaRDI QIDQ3519526zbMATH OpenOpenAlexFDO

Authors Chiu-Yuen Koo, Ranjit Kumaresan, Jonathan 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

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

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

Cited in

(20)

• On expected constant-round protocols for Byzantine agreement
• Efficient asynchronous verifiable secret sharing and multiparty computation
• Verifiable quantum secret sharing based on a single qudit
• Asynchronous Byzantine agreement with optimal resilience
• Dynamic threshold secret reconstruction and its application to the threshold cryptography
• Improving the round complexity of VSS in point-to-point networks
• Optimal extension protocols for Byzantine broadcast and agreement
• Broadcast (and round) efficient verifiable secret sharing
• The round complexity of perfectly secure general VSS
• The round complexity of verifiable secret sharing: the statistical case
• Efficient statistical asynchronous verifiable secret sharing with optimal resilience
• Round-Efficient Secure Computation in Point-to-Point Networks
• Theory of Cryptography
• Asymptotically free broadcast in constant expected time via packed VSS
• VSS Made Simpler
• Lightweight noninteractive membership authentication and group key establishment for WSNs
• Efficient VSS free of computational assumption
• Asymptotically free broadcast in constant expected time via packed VSS
• PUFF: maximally \underline{p}roactive sec\underline{u}rity \underline{f}or \underline{f}ree in perfectly secure mpc with guaranteed output delivery
• Strong \((n, t, n)\) verifiable secret sharing scheme

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 Q3519526)