Asynchronous Computational VSS with Reduced Communication Complexity

DOI10.1007/978-3-642-36095-4_17zbMath1312.94109OpenAlexW136358653MaRDI QIDQ4910244

Michael Backes, Aniket Kate, Amit Datta

Publication date: 18 March 2013

Published in: Topics in Cryptology – CT-RSA 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36095-4_17

zbMATH Keywords

communication complexityverifiable secret sharingpolynomial commitmentsasynchronous communication model

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

High-threshold AVSS with optimal communication complexity ⋮ Revisiting asynchronous fault tolerant computation with optimal resilience ⋮ Private polynomial commitments and applications to MPC ⋮ Reaching consensus for asynchronous distributed key generation ⋮ Proofs for inner pairing products and applications ⋮ \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation ⋮ Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification

This page was built for publication: Asynchronous Computational VSS with Reduced Communication Complexity