标题： OciorMVBA：近似最优无错误异步MVBA 显示英文标题

标题： OciorMVBA: Near-Optimal Error-Free Asynchronous MVBA

摘要： 在本工作中，我们提出一种无错误、信息论安全的异步多值有效拜占庭协议（MVBA），称为OciorMVBA。 该协议在消息$\boldsymbol{w}$上实现了MVBA共识，预期通信比特数为$O(n |\boldsymbol{w}|\log n + n^2 \log q)$，预期消息数为$O(n^2)$，预期轮数为$O(\log n)$，预期公共硬币数为$O(\log n)$，在具有最优容错能力$n \geq 3t + 1$的$n$节点网络中，最多有$t$个节点可能不诚实。 这里，$q$表示协议中使用的纠错码的字母表大小。 当使用固定字母表大小的纠错码（例如，扩展码）时，$q$成为一个常数。 一种MVBA协议，它在不依赖任何密码学假设（如签名或哈希）的情况下，仅依赖于公共硬币假设，就能保证所有所需属性，被称为信息论安全（IT安全）。 在公共硬币假设下，一种在所有执行中都能保证所有所需属性的MVBA协议被称为无错误的。 我们还提出另一种无错误、IT安全、异步的MVBA协议，称为OciorMVBArr。 该协议在松弛的弹性（RR）为$n \geq 5t + 1$的情况下，以期望的$O(n |\boldsymbol{w}| + n^2 \log n)$通信比特、期望的$O(1)$轮次和期望的$O(1)$个公共硬币实现MVBA共识。 此外，我们提出一种基于哈希的异步MVBA协议，称为OciorMVBAh。 此协议在最优弹性$n \geq 3t + 1$下，以期望的$O(n |\boldsymbol{w}| + n^3)$位、期望的$O(1)$轮次和期望的$O(1)$个公共硬币实现MVBA共识。 显示英文摘要

摘要： In this work, we propose an error-free, information-theoretically secure, asynchronous multi-valued validated Byzantine agreement (MVBA) protocol, called OciorMVBA. This protocol achieves MVBA consensus on a message $\boldsymbol{w}$ with expected $O(n |\boldsymbol{w}|\log n + n^2 \log q)$ communication bits, expected $O(n^2)$ messages, expected $O(\log n)$ rounds, and expected $O(\log n)$ common coins, under optimal resilience $n \geq 3t + 1$ in an $n$-node network, where up to $t$ nodes may be dishonest. Here, $q$ denotes the alphabet size of the error correction code used in the protocol. When error correction codes with a constant alphabet size (e.g., Expander Codes) are used, $q$ becomes a constant. An MVBA protocol that guarantees all required properties without relying on any cryptographic assumptions, such as signatures or hashing, except for the common coin assumption, is said to be information-theoretically secure (IT secure). Under the common coin assumption, an MVBA protocol that guarantees all required properties in all executions is said to be error-free. We also propose another error-free, IT-secure, asynchronous MVBA protocol, called OciorMVBArr. This protocol achieves MVBA consensus with expected $O(n |\boldsymbol{w}| + n^2 \log n)$ communication bits, expected $O(1)$ rounds, and expected $O(1)$ common coins, under a relaxed resilience (RR) of $n \geq 5t + 1$. Additionally, we propose a hash-based asynchronous MVBA protocol, called OciorMVBAh. This protocol achieves MVBA consensus with expected $O(n |\boldsymbol{w}| + n^3)$ bits, expected $O(1)$ rounds, and expected $O(1)$ common coins, under optimal resilience $n \geq 3t + 1$.