High-threshold AVSS with optimal communication complexity

DOI10.1007/978-3-662-64331-0_25MaRDI QIDQ2147255zbMATH OpenOpenAlexFDO

Authors Nicolas AlHaddad, Mayank Varia, Hai-Bin Zhang

Publication date 22 June 2022

Full work available at URL https://doi.org/10.1007/978-3-662-64331-0_25

zbMATH Keywords

\textsc{Haven}asynchronous verifiable secret sharing protocolsdual-threshold AVSS protocol

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Communication theory (94A05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 773999
• Publication:4502504
• Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
• Brief announcement: Efficient optimally resilient statistical AVSS and its applications
• Communication lower bounds via critical block sensitivity
• Communication lower bounds via critical block sensitivity
• On the communication complexity of reliable and secure message transmission in asynchronous networks
• Advances in Cryptology - EUROCRYPT 2004
• Optimal communication complexity of authenticated Byzantine agreement
• Design and Analysis of Distributed Averaging With Quantized Communication

Cites work

• scientific article; zbMATH DE number 1024051 (Why is no real title available?)
• scientific article; zbMATH DE number 7650353 (Why is no real title available?)
• A uniform-complexity treatment of encryption and zero-knowledge
• An asynchronous protocol for distributed computation of RSA inverses and its applications
• Asynchronous byzantine agreement protocols
• Asynchronous computational VSS with reduced communication complexity
• Asynchronous secure computation
• Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
• Constant-Size Commitments to Polynomials and Their Applications
• Efficient batch zero-knowledge arguments for low degree polynomials
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Fast Reed-Solomon interactive oracle proofs of proximity
• Fast asynchronous Byzantine agreement with optimal resilience
• How to share a secret
• Hybrid consensus: efficient consensus in the permissionless model
• Random oracles in constantipole
• Reaching Agreement in the Presence of Faults
• Transparent SNARKs from DARK compilers
• Vector commitments and their applications

Cited in

(3)

• HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures
• \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
• Bivariate proximity test-based asynchronous verifiable secret sharing

This page was built for publication: High-threshold AVSS with optimal communication complexity

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