Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Lu, Zhenliang"'
Recent progresses in asynchronous Byzantine fault-tolerant (BFT) consensus, e.g. Dumbo-NG (CCS' 22) and Tusk (EuroSys' 22), show promising performance through decoupling transaction dissemination and block agreement. However, when executed with a lar
Externí odkaz:
http://arxiv.org/abs/2403.11238
Despite recent progresses of practical asynchronous Byzantine fault tolerant (BFT) consensus, the state-of-the-art designs still suffer from suboptimal performance. Particularly, to obtain maximum throughput, most existing protocols with guaranteed l
Externí odkaz:
http://arxiv.org/abs/2209.00750
Efficient asynchronous Byzantine agreement (BA) protocols were mostly studied with private setups, e.g., pre-setup threshold cryptosystem. Challenges remain to reduce the large communication in the absence of such setups. Recently, Abraham et al. (PO
Externí odkaz:
http://arxiv.org/abs/2106.07831
An urgent demand of deploying BFT consensus over the Internet is raised for implementing blockchain services. The deterministic (partial) synchronous protocols can be simple and fast in good network conditions, but are subject to denial-of-service wh
Externí odkaz:
http://arxiv.org/abs/2103.09425
In this paper, we study one-Lee weight and two-Lee weight codes over $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$, where $u^{2}=0$. Some properties of one-Lee weight $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-additive codes are given, and a complete classification of on
Externí odkaz:
http://arxiv.org/abs/1609.09588
Autor:
Lu, Zhenliang, Zhu, Shixin
In this paper, we study $\mathbb{Z}_p\mathbb{Z}_p[u]$-additive codes, where $p$ is prime and $u^{2}=0$. In particular, we determine a Gray map from $ \mathbb{Z}_p\mathbb{Z}_p[u]$ to $\mathbb{Z}_p^{ \alpha+2 \beta}$ and study generator and parity chec
Externí odkaz:
http://arxiv.org/abs/1510.08636
Publikováno v:
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security.
An urgent demand of deploying BFT consensus over the Internet is raised for implementing blockchain services. The deterministic (partial) synchronous protocols can be simple and fast in good network conditions, but are subject to denial-of-service wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01ee3767bfb5e20fbb27d95a8bc2372e
https://doi.org/10.1145/3548606.3559346
https://doi.org/10.1145/3548606.3559346
Publikováno v:
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security.
Despite recent progresses of practical asynchronous Byzantine fault tolerant (BFT) consensus, the state-of-the-art designs still suffer from suboptimal performance. Particularly, to obtain maximum throughput, most existing protocols with guaranteed l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0dc37db33e5b62b8cef3c51fad2c73d3
https://doi.org/10.1145/3548606.3559379
https://doi.org/10.1145/3548606.3559379
Autor:
JIE XU1 jiexu49-c@my.cityu.edu.hk, CONG WANG1 congwang@cityu.edu.hk, XIAOHUA JIA1 csjia@cityu.edu.hk
Publikováno v:
ACM Computing Surveys. 2023 Suppl13s, Vol. 55, p1-35. 35p.
Autor:
Xu, Yanping, Zhang, Xia, Lu, Chengdan, Qiu, Zhenliang, Bi, Chunfang, Lai, Yuping, Qiu, Jian, Zhang, Hua
Publikováno v:
Wireless Communications & Mobile Computing; 9/3/2021, p1-18, 18p