.png){kind=icon}
.png){kind=icon}
Return
Bivariate Proximity Test-Based Asynchronous Verifiable Secret Sharing
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-031-97260-7_15.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present an Asynchronous Verifiable Secret Sharing (AVSS) protocol leveraging Interactive Oracle Proofs of Proximity (IOPPs). By integrating an IOPP to the product of Reed-Solomon codes i.e., to bivariate polynomials, we achieve strong agreement properties while maintaining efficiency: our scheme achieves a total communication complexity of O(n(2)) for the dealer and O(n log(2) (n)) per party, and a computational complexity of only O(n log(n)) per party. It provides optimal resilience i.e., is secure against up to t < n/3 corrupted parties. Furthermore, our construction is resistant against post-quantum adversaries, as its security relies solely on the security of the underlying hash functions.
Keywords:
Hash-based
Verifiable Secret Sharing
Asynchronous
Coding Theory
Multivariate IOPP
Polynomial Commitment Scheme
Journal
P
IF:
0
Papers:
20
Citations:
0