default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhuolun Xiang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c24]Sourav Das, Zhuolun Xiang, Ling Ren:
Powers of Tau in Asynchrony. NDSS 2024- [i29]George Mitenkov, Igor Kabiljo, Zekun Li, Alexander Spiegelman, Satyanarayana Vusirikala, Zhuolun Xiang, Aleksandar Zlateski, Nuno P. Lopes, Rati Gelashvili:
Deferred Objects to Enhance Smart Contract Programming with Optimistic Parallel Execution. CoRR abs/2405.06117 (2024) - [i28]Zhuolun Xiang, Sourav Das, Zekun Li, Zhoujun Ma, Alexander Spiegelman:
The Latency Price of Threshold Cryptosystem in Blockchains. CoRR abs/2407.12172 (2024) - [i27]Sourav Das, Benny Pinkas, Alin Tomescu, Zhuolun Xiang:
Distributed Randomness using Weighted VRFs. IACR Cryptol. ePrint Arch. 2024: 198 (2024) - 2023
- [c23]Sourav Das
, Philippe Camacho, Zhuolun Xiang, Javier Nieto, Benedikt Bünz, Ling Ren:
Threshold Signatures from Inner Product Argument: Succinct, Weighted, and Multi-threshold. CCS 2023: 356-370 - [c22]Christos Stefo, Zhuolun Xiang, Lefteris Kokoris-Kogias:
Executing and Proving Over Dirty Ledgers. FC (1) 2023: 3-20 - [c21]Jun Wan, Atsuki Momose, Ling Ren, Elaine Shi, Zhuolun Xiang:
On the Amortized Communication Complexity of Byzantine Broadcast. PODC 2023: 253-261 - [c20]Rati Gelashvili, Alexander Spiegelman, Zhuolun Xiang, George Danezis, Zekun Li, Dahlia Malkhi, Yu Xia, Runtian Zhou:
Block-STM: Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing. PPoPP 2023: 232-244 - [c19]Sourav Das, Zhuolun Xiang, Lefteris Kokoris-Kogias, Ling Ren:
Practical Asynchronous High-threshold Distributed Key Generation and Distributed Polynomial Sampling. USENIX Security Symposium 2023: 5359-5376 - [c18]Thomas Yurek, Zhuolun Xiang, Yu Xia, Andrew Miller:
Long Live The Honey Badger: Robust Asynchronous DPSS and its Applications. USENIX Security Symposium 2023: 5413-5430 - [i26]Atsuki Momose, Ling Ren, Elaine Shi, Jun Wan, Zhuolun Xiang:
On the Amortized Communication Complexity of Byzantine Broadcast. IACR Cryptol. ePrint Arch. 2023: 38 (2023) - [i25]Sourav Das, Philippe Camacho, Zhuolun Xiang, Javier Nieto, Benedikt Bünz, Ling Ren:
Threshold Signatures from Inner Product Argument: Succinct, Weighted, and Multi-threshold. IACR Cryptol. ePrint Arch. 2023: 598 (2023) - [i24]Sourav Das, Zhuolun Xiang, Alin Tomescu, Alexander Spiegelman, Benny Pinkas, Ling Ren:
A New Paradigm for Verifiable Secret Sharing. IACR Cryptol. ePrint Arch. 2023: 1196 (2023) - 2022
- [c17]Rati Gelashvili, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander Spiegelman, Zhuolun Xiang:
Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback. Financial Cryptography 2022: 296-315 - [c16]Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, Haibin Zhang:
Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. PODC 2022: 399-417 - [c15]Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, Haibin Zhang:
Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication. PODC 2022: 418-420 - [c14]Sourav Das, Thomas Yurek, Zhuolun Xiang, Andrew Miller, Lefteris Kokoris-Kogias, Ling Ren:
Practical Asynchronous Distributed Key Generation. SP 2022: 2518-2534 - [i23]Rati Gelashvili, Alexander Spiegelman, Zhuolun Xiang, George Danezis, Zekun Li, Yu Xia, Runtian Zhou, Dahlia Malkhi:
Block-STM: Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing. CoRR abs/2203.06871 (2022) - [i22]Sourav Das, Zhuolun Xiang, Ling Ren:
Balanced Quadratic Reliable Broadcast and Improved Asynchronous Verifiable Information Dispersal. IACR Cryptol. ePrint Arch. 2022: 52 (2022) - [i21]Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, Haibin Zhang:
Asynchronous Verifiable Information Dispersal with Near-Optimal Communication. IACR Cryptol. ePrint Arch. 2022: 775 (2022) - [i20]Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, Haibin Zhang:
Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. IACR Cryptol. ePrint Arch. 2022: 776 (2022) - [i19]Thomas Yurek, Zhuolun Xiang, Yu Xia, Andrew Miller:
Long Live The Honey Badger: Robust Asynchronous DPSS and its Applications. IACR Cryptol. ePrint Arch. 2022: 971 (2022) - [i18]Sourav Das, Zhuolun Xiang, Lefteris Kokoris-Kogias, Ling Ren:
Practical Asynchronous High-threshold Distributed Key Generation and Distributed Polynomial Sampling. IACR Cryptol. ePrint Arch. 2022: 1389 (2022) - [i17]Christos Stefo, Zhuolun Xiang, Lefteris Kokoris-Kogias:
Executing and Proving over Dirty Ledgers. IACR Cryptol. ePrint Arch. 2022: 1554 (2022) - [i16]Sourav Das, Zhuolun Xiang, Ling Ren:
Powers of Tau in Asynchrony. IACR Cryptol. ePrint Arch. 2022: 1683 (2022) - 2021
- [c13]Sourav Das, Zhuolun Xiang, Ling Ren:
Asynchronous Data Dissemination and its Applications. CCS 2021: 2705-2721 - [c12]Zhuolun Xiang, Dahlia Malkhi, Kartik Nayak, Ling Ren:
Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication. ICDCS 2021: 205-215 - [c11]Ittai Abraham, Ling Ren, Zhuolun Xiang:
Good-Case and Bad-Case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization. OPODIS 2021: 5:1-5:20 - [c10]Rati Gelashvili, Lefteris Kokoris-Kogias, Alexander Spiegelman, Zhuolun Xiang:
Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol. PODC 2021: 187-190 - [c9]Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Good-case Latency of Byzantine Broadcast: a Complete Categorization. PODC 2021: 331-341 - [i15]Zhuolun Xiang, Dahlia Malkhi, Kartik Nayak, Ling Ren:
Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication. CoRR abs/2101.03715 (2021) - [i14]Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Good-case Latency of Byzantine Broadcast: a Complete Categorization. CoRR abs/2102.07240 (2021) - [i13]Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Brief Note: Fast Authenticated Byzantine Consensus. CoRR abs/2102.07932 (2021) - [i12]Rati Gelashvili, Lefteris Kokoris-Kogias, Alexander Spiegelman, Zhuolun Xiang:
Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol. CoRR abs/2103.03181 (2021) - [i11]Rati Gelashvili, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander Spiegelman, Zhuolun Xiang:
Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback. CoRR abs/2106.10362 (2021) - [i10]Ittai Abraham, Ling Ren, Zhuolun Xiang:
Good-case and Bad-case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization. CoRR abs/2109.12454 (2021) - [i9]Sourav Das, Zhuolun Xiang, Ling Ren:
Asynchronous Data Dissemination and its Applications. IACR Cryptol. ePrint Arch. 2021: 777 (2021) - [i8]Sourav Das, Tom Yurek, Zhuolun Xiang, Andrew Miller, Lefteris Kokoris-Kogias, Ling Ren:
Practical Asynchronous Distributed Key Generation. IACR Cryptol. ePrint Arch. 2021: 1591 (2021) - 2020
- [c8]Zhuolun Xiang, Nitin H. Vaidya:
Global Stabilization for Causally Consistent Partial Replication. ICDCN 2020: 30:1-30:10 - [c7]Zhuolun Xiang, Bolin Ding, Xi He, Jingren Zhou:
Linear and Range Counting under Metric-based Local Differential Privacy. ISIT 2020: 908-913 - [c6]Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, Zhuolun Xiang:
Improved Extension Protocols for Byzantine Broadcast and Agreement. DISC 2020: 28:1-28:17 - [c5]Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency. DISC 2020: 47:1-47:3 - [i7]Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, Zhuolun Xiang:
Improved Extension Protocols for Byzantine Broadcast and Agreement. CoRR abs/2002.11321 (2020) - [i6]Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Optimal Good-case Latency for Byzantine Broadcast and State Machine Replication. CoRR abs/2003.13155 (2020)
2010 – 2019
- 2019
- [c4]Zhuolun Xiang, Nitin H. Vaidya:
Partially Replicated Causally Consistent Shared Memory: Lower Bounds and An Algorithm. PODC 2019: 425-434 - [i5]Zhuolun Xiang, Bolin Ding, Xi He, Jingren Zhou:
Design of Algorithms under Policy-Aware Local Differential Privacy: Utility-Privacy Trade-offs. CoRR abs/1909.11778 (2019) - 2018
- [c3]Zhuolun Xiang, Nitin H. Vaidya:
Brief Announcement: Partially Replicated Causally Consistent Shared Memory. PODC 2018: 273-275 - [i4]Zhuolun Xiang, Nitin H. Vaidya:
Global Stabilization for Causally Consistent Partial Replication. CoRR abs/1803.05575 (2018) - 2017
- [i3]Zhuolun Xiang, Nitin H. Vaidya:
Lower Bounds and Algorithm for Partially Replicated Causally Consistent Shared Memory. CoRR abs/1703.05424 (2017) - 2016
- [c2]Zhuolun Xiang, Nitin H. Vaidya:
Relaxed Byzantine Vector Consensus. OPODIS 2016: 26:1-26:15 - [c1]Zhuolun Xiang, Nitin H. Vaidya:
Brief Announcement: Relaxed Byzantine Vector Consensus. SPAA 2016: 401-403 - [i2]Zhuolun Xiang, Nitin H. Vaidya:
Relaxed Byzantine Vector Consensus. CoRR abs/1601.08067 (2016) - [i1]Zhuolun Xiang, Nitin H. Vaidya:
Timestamps for Partial Replication. CoRR abs/1611.04022 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
