Scholarlink

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

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Bivariate Proximity Test-Based Asynchronous Verifiable Secret Sharing

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Daniel Augot,
  • Olivier Blazy,
  • Hugo Delavenne,
  • Lola-Baie Mallordy

摘要

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