@inproceedings{30df764391e64bc28c95a1da9f9e84c3,
title = "Bivariate Proximity Test-Based Asynchronous Verifiable Secret Sharing",
abstract = "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(n2) for the dealer and O(nlog2(n)) per party, and a computational complexity of only O(nlog(n)) per party. It provides optimal resilience i.e., is secure against up to t",
keywords = "Asynchronous, Coding Theory, Hash-based, Multivariate IOPP, Polynomial Commitment Scheme, Verifiable Secret Sharing",
author = "Daniel Augot and Olivier Blazy and Hugo Delavenne and Mallordy, \{Lola Baie\}",
note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.; 16th International Conference on Cryptology in Africa, AFRICACRYPT 2025 ; Conference date: 21-07-2025 Through 23-07-2025",
year = "2026",
month = jan,
day = "1",
doi = "10.1007/978-3-031-97260-7\_15",
language = "English",
isbn = "9783031972591",
series = "Lecture Notes in Computer Science",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "319--342",
editor = "Abderrahmane Nitaj and Svetla Petkova-Nikova and Vincent Rijmen and Vincent Rijmen",
booktitle = "Progress in Cryptology - AFRICACRYPT 2025 - 16th International Conference on Cryptology in Africa, Proceedings",
}