Shengqi Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shengqi Liu has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Atsuki Momose
University of Illinois at Urbana-Champaign, Urbana, IL, USA
1 shared publication - Guanlong Wu
Southern University of Science and Technology, Shenzhen, Guangdong, China
1 shared publication - Jiangshan Yu
The University of Sydney
1 shared publication - Jianyu Niu
Research Institute of Trustworthy Autonomous Systems and Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, China
1 shared publication - Ling Ren
University of Illinois Urbana-Champaign
1 shared publication - Sisi Duan
Tsinghua University, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 193-210
Achilles: Efficient TEE-Assisted BFT Consensus via Rollback Resilient Recovery
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 193-210
Open AccessAchilles: Efficient TEE-Assisted BFT Consensus via Rollback Resilient Recovery
- Open Access
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 3242-3256
Asynchronous Consensus without Trusted Setup or Public-Key Cryptography
Byzantine consensus is a fundamental building block in distributed cryptographic problems. Despite decades of research, most existing asynchronous consensus protocols require a strong trusted setup and expensive public-key cryptography. In this paper, we study asynchronous Byzantine consensus protocols that do not rely on a trusted setup and do not use public-key cryptography such as digital signatures. We give an Asynchronous Common Subset (ACS) protocol whose security is only based on cryptographic hash functions modeled as a random oracle. Our protocol has O(κn3) total communication and runs in expected O(1) rounds. The fact that we use only cryptographic hash functions also means that our protocol is post-quantum secure. The minimal use of cryptography and the small number of rounds make our protocol practical. We implement our protocol and evaluate it in a geo-distributed setting with up to 128 machines. Our experimental evaluation shows that our protocol is more efficient than the only other setup-free consensus protocol that has been implemented to date. En route to our asynchronous consensus protocols, we also introduce new primitives called asynchronous secret key sharing and cover gather, which may be of independent interest.
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 3242-3256
Open AccessAsynchronous Consensus without Trusted Setup or Public-Key Cryptography
Byzantine consensus is a fundamental building block in distributed cryptographic problems. Despite decades of research, most existing asynchronous consensus protocols require a strong trusted setup and expensive public-key cryptography. In this paper, we study asynchronous Byzantine consensus protocols that do not rely on a trusted setup and do not use public-key cryptography such as digital signatures. We give an Asynchronous Common Subset (ACS) protocol whose security is only based on cryptographic hash functions modeled as a random oracle. Our protocol has O(κn3) total communication and runs in expected O(1) rounds. The fact that we use only cryptographic hash functions also means that our protocol is post-quantum secure. The minimal use of cryptography and the small number of rounds make our protocol practical. We implement our protocol and evaluate it in a geo-distributed setting with up to 128 machines. Our experimental evaluation shows that our protocol is more efficient than the only other setup-free consensus protocol that has been implemented to date. En route to our asynchronous consensus protocols, we also introduce new primitives called asynchronous secret key sharing and cover gather, which may be of independent interest.