Zhuolun Xiang

Orcid: 0000-0002-4398-3428

According to our database1, Zhuolun Xiang authored at least 41 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Raptr: Prefix Consensus for Robust High-Performance BFT.
CoRR, April, 2025

Zaptos: Towards Optimal Blockchain Latency.
CoRR, January, 2025

Optimistic Asynchronous Dynamic-committee Proactive Secret Sharing.
IACR Cryptol. ePrint Arch., 2025

Verifiable Secret Sharing Simplified.
Proceedings of the IEEE Symposium on Security and Privacy, 2025

Distributed Randomness Using Weighted VUFs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

2024
Distributed Randomness using Weighted VRFs.
IACR Cryptol. ePrint Arch., 2024

The Latency Price of Threshold Cryptosystem in Blockchains.
CoRR, 2024

Deferred Objects to Enhance Smart Contract Programming with Optimistic Parallel Execution.
CoRR, 2024

Powers of Tau in Asynchrony.
Proceedings of the 31st Annual Network and Distributed System Security Symposium, 2024

2023
A New Paradigm for Verifiable Secret Sharing.
IACR Cryptol. ePrint Arch., 2023

Long Live The Honey Badger: Robust Asynchronous DPSS and its Applications.
Proceedings of the 32nd USENIX Security Symposium, 2023

Practical Asynchronous High-threshold Distributed Key Generation and Distributed Polynomial Sampling.
Proceedings of the 32nd USENIX Security Symposium, 2023

Block-STM: Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing.
Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

On the Amortized Communication Complexity of Byzantine Broadcast.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Executing and Proving Over Dirty Ledgers.
Proceedings of the Financial Cryptography and Data Security, 2023

Threshold Signatures from Inner Product Argument: Succinct, Weighted, and Multi-threshold.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Balanced Quadratic Reliable Broadcast and Improved Asynchronous Verifiable Information Dispersal.
IACR Cryptol. ePrint Arch., 2022

Asynchronous Verifiable Information Dispersal with Near-Optimal Communication.
IACR Cryptol. ePrint Arch., 2022

Practical Asynchronous Distributed Key Generation.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback.
Proceedings of the Financial Cryptography and Data Security, 2022

2021
Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol.
CoRR, 2021

Brief Note: Fast Authenticated Byzantine Consensus.
CoRR, 2021

Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Good-case Latency of Byzantine Broadcast: a Complete Categorization.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Good-Case and Bad-Case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization.
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

Asynchronous Data Dissemination and its Applications.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Optimal Good-case Latency for Byzantine Broadcast and State Machine Replication.
CoRR, 2020

Improved Extension Protocols for Byzantine Broadcast and Agreement.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Linear and Range Counting under Metric-based Local Differential Privacy.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Global Stabilization for Causally Consistent Partial Replication.
Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

2019
Design of Algorithms under Policy-Aware Local Differential Privacy: Utility-Privacy Trade-offs.
CoRR, 2019

Partially Replicated Causally Consistent Shared Memory: Lower Bounds and An Algorithm.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018
Brief Announcement: Partially Replicated Causally Consistent Shared Memory.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
Lower Bounds and Algorithm for Partially Replicated Causally Consistent Shared Memory.
CoRR, 2017

2016
Timestamps for Partial Replication.
CoRR, 2016

Brief Announcement: Relaxed Byzantine Vector Consensus.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Relaxed Byzantine Vector Consensus.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016


  Loading...