High-threshold AVSS with optimal communication complexity
From MaRDI portal
Publication:2147255
DOI10.1007/978-3-662-64331-0_25zbMATH Open1491.94075OpenAlexW3189321855MaRDI QIDQ2147255FDOQ2147255
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
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
- scientific article; zbMATH DE number 7774283
- Design and Analysis of Distributed Averaging With Quantized Communication
Data encryption (aspects in computer science) (68P25) Communication theory (94A05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- How to share a secret
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Reaching Agreement in the Presence of Faults
- Asynchronous secure computation
- Title not available (Why is that?)
- Efficient batch zero-knowledge arguments for low degree polynomials
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Fast asynchronous Byzantine agreement with optimal resilience
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Vector Commitments and Their Applications
- Asynchronous byzantine agreement protocols
- A uniform-complexity treatment of encryption and zero-knowledge
- Constant-Size Commitments to Polynomials and Their Applications
- Random oracles in constantipole
- Transparent SNARKs from DARK compilers
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Title not available (Why is that?)
- Hybrid consensus: efficient consensus in the permissionless model
- An asynchronous protocol for distributed computation of RSA inverses and its applications
- Asynchronous Computational VSS with Reduced Communication Complexity
Cited In (1)
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)
