Asynchronous computational VSS with reduced communication complexity

DOI10.1007/978-3-642-36095-4_17MaRDI QIDQ4910244zbMATH OpenOpenAlexFDO

Authors Michael Backes, Amit Datta, Aniket Kate

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

asynchronous communication modelcommunication complexitypolynomial commitmentsverifiable secret sharing

Mathematics Subject Classification ID

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

Recommendations

• Computational verifiable secret sharing revisited
• Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
• Efficient statistical asynchronous verifiable secret sharing with optimal resilience
• Theory of Cryptography
• Broadcast (and round) efficient verifiable secret sharing

Cited in

(17)

• High-threshold AVSS with optimal communication complexity
• Revisiting asynchronous fault tolerant computation with optimal resilience
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
• Computational verifiable secret sharing revisited
• Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
• scientific article; zbMATH DE number 176544 (Why is no real title available?)
• Efficient statistical asynchronous verifiable secret sharing with optimal resilience
• Brief announcement: Efficient optimally resilient statistical AVSS and its applications
• Private polynomial commitments and applications to MPC
• 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
• Lightweight asynchronous verifiable secret sharing with optimal resilience
• Efficient VSS free of computational assumption
• Greyhound: fast polynomial commitments from lattices
• Bivariate proximity test-based asynchronous verifiable secret sharing
• HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures

This page was built for publication: Asynchronous computational VSS with reduced communication complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910244)