High-threshold AVSS with optimal communication complexity

DOI10.1007/978-3-662-64331-0_25zbMath1491.94075OpenAlexW3189321855MaRDI QIDQ2147255

Nicolas AlHaddad, Hai-Bin Zhang, Mayank Varia

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

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

Related Items (1)

\textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation

Cites Work

• Unnamed Item
• Unnamed Item
• Asynchronous byzantine agreement protocols
• A uniform-complexity treatment of encryption and zero-knowledge
• Efficient batch zero-knowledge arguments for low degree polynomials
• Transparent SNARKs from DARK compilers
• An asynchronous protocol for distributed computation of RSA inverses and its applications
• How to share a secret
• Constant-Size Commitments to Polynomials and Their Applications
• Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Reaching Agreement in the Presence of Faults
• Asynchronous Computational VSS with Reduced Communication Complexity
• Vector Commitments and Their Applications
• Fast Reed-Solomon Interactive Oracle Proofs of Proximity
• Random oracles in constantipole
• Fast asynchronous Byzantine agreement with optimal resilience
• Asynchronous secure computation
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

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