default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChen-Da Liu-Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Vipul Goyal, Chen-Da Liu-Zhang, Yifan Song:
Towards Achieving Asynchronous MPC with Linear Communication and Optimal Resilience. CRYPTO (8) 2024: 170-206- [c32]Akhil Bandarupalli, Adithya Bhat, Saurabh Bagchi, Aniket Kate, Chen-Da Liu-Zhang, Michael K. Reiter:
Delphi: Efficient Asynchronous Approximate Agreement for Distributed Oracles. DSN 2024: 456-469 - [c31]Chen-Da Liu-Zhang
, Christian Matt, Søren Eller Thomsen:
Asymptotically Optimal Message Dissemination with Applications to Blockchains. EUROCRYPT (3) 2024: 64-95 - [c30]Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer:
Brief Announcement: Communication-Optimal Convex Agreement. PODC 2024: 492-495 - [i38]Akhil Bandarupalli, Adithya Bhat, Saurabh Bagchi, Aniket Kate, Chen-Da Liu-Zhang, Michael K. Reiter:
Delphi: Efficient Asynchronous Approximate Agreement for Distributed Oracles. CoRR abs/2405.02431 (2024) - [i37]Vipul Goyal, Chen-Da Liu-Zhang, Yifan Song:
Towards Achieving Asynchronous MPC with Linear Communication and Optimal Resilience. IACR Cryptol. ePrint Arch. 2024: 243 (2024) - [i36]Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer:
Communication-Optimal Convex Agreement. IACR Cryptol. ePrint Arch. 2024: 251 (2024) - [i35]Jeff Burdges, Alfonso Cevallos, Handan Kilinç Alper, Chen-Da Liu-Zhang, Fatemeh Shirazi, Alistair Stewart, Rob Habermeier, Robert Klotzner, Andronik Ordian:
Efficient Execution Auditing for Blockchains under Byzantine Assumptions. IACR Cryptol. ePrint Arch. 2024: 961 (2024) - [i34]Chen-Da Liu-Zhang, Elisaweta Masserova, João Ribeiro, Pratik Soni, Sri Aravinda Krishnan Thyagarajan:
Improved YOSO Randomness Generation with Worst-Case Corruptions. IACR Cryptol. ePrint Arch. 2024: 1268 (2024) - [i33]Chen-Da Liu-Zhang, Christopher Portmann, Guilherme Rito:
Stateful Communication with Malicious Parties. IACR Cryptol. ePrint Arch. 2024: 1593 (2024) - [i32]Giovanni Deligios, Ivana Klasovita, Chen-Da Liu-Zhang:
Optimal Early Termination for Dishonest Majority Broadcast. IACR Cryptol. ePrint Arch. 2024: 1656 (2024) - [i31]Akhil Bandarupalli, Xiaoyu Ji, Aniket Kate, Chen-Da Liu-Zhang, Yifan Song:
Concretely Efficient Asynchronous MPC from Lightweight Cryptography. IACR Cryptol. ePrint Arch. 2024: 1666 (2024) - [i30]Giovanni Deligios, Anders Konring, Chen-Da Liu-Zhang, Varun Narayanan:
Statistical Layered MPC. IACR Cryptol. ePrint Arch. 2024: 1670 (2024) - 2023
- [c29]Vipul Goyal, Chen-Da Liu-Zhang, Rafail Ostrovsky:
Asymmetric Multi-Party Computation. ITC 2023: 6:1-6:25 - [c28]Renas Bacho, Daniel Collins, Chen-Da Liu-Zhang, Julian Loss:
Network-Agnostic Security Comes (Almost) for Free in DKG and MPC. CRYPTO (1) 2023: 71-106 - [c27]Bernardo David, Giovanni Deligios, Aarushi Goel, Yuval Ishai, Anders Konring, Eyal Kushilevitz, Chen-Da Liu-Zhang, Varun Narayanan:
Perfect MPC over Layered Graphs. CRYPTO (1) 2023: 360-392 - [c26]Giovanni Deligios, Chen-Da Liu-Zhang:
Synchronous Perfectly Secure Message Transmission with Optimal Asynchronous Fallback Guarantees. FC (1) 2023: 77-93 - [c25]Vipul Goyal, Chen-Da Liu-Zhang, Justin Raizes, João Ribeiro:
Asynchronous Multi-Party Quantum Computation. ITCS 2023: 62:1-62:22 - [c24]Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer:
Multidimensional Approximate Agreement with Asynchronous Fallback. SPAA 2023: 141-151 - [c23]Alper Çakan, Vipul Goyal, Chen-Da Liu-Zhang, João Ribeiro:
Computational Quantum Secret Sharing. TQC 2023: 4:1-4:26 - [c22]Erica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu-Zhang:
Communication Lower Bounds for Cryptographic Broadcast Protocols. DISC 2023: 10:1-10:19 - [i29]Alper Çakan, Vipul Goyal, Chen-Da Liu-Zhang, João Ribeiro:
Computational Quantum Secret Sharing. CoRR abs/2305.00356 (2023) - [i28]Erica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu-Zhang:
Communication Lower Bounds for Cryptographic Broadcast Protocols. CoRR abs/2309.01466 (2023) - [i27]Alper Çakan, Vipul Goyal, Chen-Da Liu-Zhang, João Ribeiro:
Unbounded Leakage-Resilience and Leakage-Detection in a Quantum World. IACR Cryptol. ePrint Arch. 2023: 410 (2023) - [i26]Giovanni Deligios, Aarushi Goel, Chen-Da Liu-Zhang:
Maximally-Fluid MPC with Guaranteed Output Delivery. IACR Cryptol. ePrint Arch. 2023: 415 (2023) - [i25]Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer:
Multidimensional Approximate Agreement with Asynchronous Fallback. IACR Cryptol. ePrint Arch. 2023: 449 (2023) - [i24]Alper Çakan, Vipul Goyal, Chen-Da Liu-Zhang, João Ribeiro:
Computational Quantum Secret Sharing. IACR Cryptol. ePrint Arch. 2023: 613 (2023) - [i23]Vipul Goyal, Chen-Da Liu-Zhang, Rafail Ostrovsky:
Asymmetric Multi-Party Computation. IACR Cryptol. ePrint Arch. 2023: 704 (2023) - [i22]Erica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu-Zhang:
Communication Lower Bounds for Cryptographic Broadcast Protocols. IACR Cryptol. ePrint Arch. 2023: 1316 (2023) - 2022
- [c21]Amey Bhangale, Chen-Da Liu-Zhang, Julian Loss, Kartik Nayak:
Efficient Adaptively-Secure Byzantine Agreement for Long Messages. ASIACRYPT (1) 2022: 504-525 - [c20]Chen-Da Liu-Zhang, Christian Matt, Ueli Maurer, Guilherme Rito, Søren Eller Thomsen:
Practical Provably Secure Flooding for Blockchains. ASIACRYPT (1) 2022: 774-805 - [c19]Diana Ghinea, Vipul Goyal, Chen-Da Liu-Zhang:
Round-Optimal Byzantine Agreement. EUROCRYPT (1) 2022: 96-119 - [c18]Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer:
Optimal Synchronous Approximate Agreement with Asynchronous Fallback. PODC 2022: 70-80 - [i21]Diana Ghinea, Vipul Goyal, Chen-Da Liu-Zhang:
Round-Optimal Byzantine Agreement. IACR Cryptol. ePrint Arch. 2022: 255 (2022) - [i20]Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer:
Optimal Synchronous Approximate Agreement with Asynchronous Fallback. IACR Cryptol. ePrint Arch. 2022: 354 (2022) - [i19]Chen-Da Liu-Zhang, Christian Matt, Ueli Maurer, Guilherme Rito, Søren Eller Thomsen:
Practical Provably Secure Flooding for Blockchains. IACR Cryptol. ePrint Arch. 2022: 608 (2022) - [i18]Renas Bacho, Daniel Collins, Chen-Da Liu-Zhang, Julian Loss:
Network-Agnostic Security Comes for Free in DKG and MPC. IACR Cryptol. ePrint Arch. 2022: 1369 (2022) - [i17]Giovanni Deligios, Chen-Da Liu-Zhang:
Synchronous Perfectly Secure Message Transmission with Optimal Asynchronous Fallback Guarantees. IACR Cryptol. ePrint Arch. 2022: 1397 (2022) - [i16]Vipul Goyal, Chen-Da Liu-Zhang, Justin Raizes, João Ribeiro:
Asynchronous Multi-Party Quantum Computation. IACR Cryptol. ePrint Arch. 2022: 1583 (2022) - [i15]Chen-Da Liu-Zhang, Christian Matt, Søren Eller Thomsen:
Asymptotically Optimal Message Dissemination with Applications to Blockchains. IACR Cryptol. ePrint Arch. 2022: 1723 (2022) - 2021
- [b1]Chen-Da Liu-Zhang:
Multi-Party Computation: Definitions, Enhanced Security Guarantees and Efficiency. ETH Zurich, Zürich, Switzerland, 2021 - [c17]Matthias Fitzi, Chen-Da Liu-Zhang, Julian Loss:
A New Way to Achieve Round-Efficient Byzantine Agreement. PODC 2021: 355-362 - [c16]Annick Chopard, Martin Hirt, Chen-Da Liu-Zhang:
On Communication-Efficient Asynchronous MPC with Adaptive Security. TCC (2) 2021: 35-65 - [c15]Giovanni Deligios, Martin Hirt, Chen-Da Liu-Zhang:
Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback. TCC (1) 2021: 623-653 - [c14]Martin Hirt, Chen-Da Liu-Zhang, Ueli Maurer:
Adaptive Security of Multi-party Protocols, Revisited. TCC (1) 2021: 686-716 - [i14]Matthias Fitzi, Chen-Da Liu-Zhang, Julian Loss:
A New Way to Achieve Round-Efficient Byzantine Agreement. IACR Cryptol. ePrint Arch. 2021: 814 (2021) - [i13]Giovanni Deligios, Martin Hirt, Chen-Da Liu-Zhang:
Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback. IACR Cryptol. ePrint Arch. 2021: 1141 (2021) - [i12]Annick Chopard, Martin Hirt, Chen-Da Liu-Zhang:
On Communication-Efficient Asynchronous MPC with Adaptive Security. IACR Cryptol. ePrint Arch. 2021: 1174 (2021) - [i11]Martin Hirt, Chen-Da Liu-Zhang, Ueli Maurer:
Adaptive Security of Multi-Party Protocols, Revisited. IACR Cryptol. ePrint Arch. 2021: 1175 (2021) - [i10]Amey Bhangale, Chen-Da Liu-Zhang, Julian Loss, Kartik Nayak:
Efficient Adaptively-Secure Byzantine Agreement for Long Messages. IACR Cryptol. ePrint Arch. 2021: 1403 (2021) - 2020
- [c13]Chen-Da Liu-Zhang, Julian Loss, Ueli Maurer, Tal Moran, Daniel Tschudi:
MPC with Synchronous Security and Asynchronous Responsiveness. ASIACRYPT (3) 2020: 92-119 - [c12]Erica Blum, Chen-Da Liu Zhang, Julian Loss:
Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback. CRYPTO (2) 2020: 707-731 - [c11]Martin Hirt, Ard Kastrati, Chen-Da Liu-Zhang:
Multi-Threshold Asynchronous Reliable Broadcast and Consensus. OPODIS 2020: 6:1-6:16 - [c10]Chen-Da Liu-Zhang, Varun Maram, Ueli Maurer:
On Broadcast in Generalized Network and Adversarial Models. OPODIS 2020: 25:1-25:16 - [c9]Rio LaVigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, Daniel Tschudi:
Topology-Hiding Computation for Networks with Unknown Delays. Public Key Cryptography (2) 2020: 215-245 - [c8]Erica Blum, Jonathan Katz, Chen-Da Liu-Zhang, Julian Loss:
Asynchronous Byzantine Agreement with Subquadratic Communication. TCC (1) 2020: 353-380 - [c7]Chen-Da Liu-Zhang, Ueli Maurer:
Synchronous Constructive Cryptography. TCC (2) 2020: 439-472 - [c6]Diana Ghinea, Martin Hirt, Chen-Da Liu-Zhang:
From Partial to Global Asynchronous Reliable Broadcast. DISC 2020: 29:1-29:16 - [c5]Martin Hirt, Ard Kastrati, Chen-Da Liu-Zhang:
Brief Announcement: Multi-Threshold Asynchronous Reliable Broadcast and Consensus. DISC 2020: 48:1-48:3 - [i9]Erica Blum, Chen-Da Liu Zhang, Julian Loss:
Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback. IACR Cryptol. ePrint Arch. 2020: 740 (2020) - [i8]Erica Blum, Jonathan Katz, Chen-Da Liu Zhang, Julian Loss:
Asynchronous Byzantine Agreement with Subquadratic Communication. IACR Cryptol. ePrint Arch. 2020: 851 (2020) - [i7]Martin Hirt, Ard Kastrati, Chen-Da Liu-Zhang:
Multi-Threshold Asynchronous Reliable Broadcast and Consensus. IACR Cryptol. ePrint Arch. 2020: 958 (2020) - [i6]Diana Ghinea, Martin Hirt, Chen-Da Liu-Zhang:
From Partial to Global Asynchronous Reliable Broadcast. IACR Cryptol. ePrint Arch. 2020: 963 (2020) - [i5]Chen-Da Liu-Zhang, Ueli Maurer:
Synchronous Constructive Cryptography. IACR Cryptol. ePrint Arch. 2020: 1226 (2020) - [i4]Chen-Da Liu-Zhang, Varun Maram, Ueli Maurer:
On Broadcast in Generalized Network and Adversarial Models. IACR Cryptol. ePrint Arch. 2020: 1408 (2020)
2010 – 2019
- 2019
- [c4]Chen-Da Liu Zhang, Varun Maram, Ueli Maurer:
Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models. DISC 2019: 47:1-47:3 - [i3]Chen-Da Liu Zhang, Julian Loss, Ueli Maurer, Tal Moran, Daniel Tschudi:
Robust MPC: Asynchronous Responsiveness yet Synchronous Security. IACR Cryptol. ePrint Arch. 2019: 159 (2019) - [i2]Rio LaVigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, Daniel Tschudi:
Topology-Hiding Computation for Networks with Unknown Delays. IACR Cryptol. ePrint Arch. 2019: 1211 (2019) - 2018
- [c3]Rio LaVigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, Daniel Tschudi:
Topology-Hiding Computation Beyond Semi-Honest Adversaries. TCC (2) 2018: 3-35 - [i1]Rio LaVigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, Daniel Tschudi:
Topology-Hiding Computation Beyond Semi-Honest Adversaries. IACR Cryptol. ePrint Arch. 2018: 255 (2018) - 2017
- [c2]Chen-Da Liu Zhang, Ueli Maurer, Martin Raszyk, Daniel Tschudi:
Witness-hiding proofs of knowledge for cable locks. ISIT 2017: 953-957 - [c1]Christian Badertscher, Sandro Coretti, Chen-Da Liu Zhang, Ueli Maurer:
Efficiency lower bounds for commit-and-prove constructions. ISIT 2017: 1788-1792
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 2024-11-11 22:28 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:
