Chen-Da Liu-Zhang

Orcid: 0000-0002-0349-3838

According to our database1, Chen-Da Liu-Zhang authored at least 40 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Towards Achieving Asynchronous MPC with Linear Communication and Optimal Resilience.
IACR Cryptol. ePrint Arch., 2024

Communication-Optimal Convex Agreement.
IACR Cryptol. ePrint Arch., 2024

Efficient Execution Auditing for Blockchains under Byzantine Assumptions.
IACR Cryptol. ePrint Arch., 2024

Delphi: Efficient Asynchronous Approximate Agreement for Distributed Oracles.
CoRR, 2024

Brief Announcement: Communication-Optimal Convex Agreement.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023
Asymmetric Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2023

Multidimensional Approximate Agreement with Asynchronous Fallback.
IACR Cryptol. ePrint Arch., 2023

Maximally-Fluid MPC with Guaranteed Output Delivery.
IACR Cryptol. ePrint Arch., 2023

Computational Quantum Secret Sharing.
IACR Cryptol. ePrint Arch., 2023

Unbounded Leakage-Resilience and Leakage-Detection in a Quantum World.
IACR Cryptol. ePrint Arch., 2023

Communication Lower Bounds for Cryptographic Broadcast Protocols.
IACR Cryptol. ePrint Arch., 2023

Perfect MPC over Layered Graphs.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Network-Agnostic Security Comes (Almost) for Free in DKG and MPC.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Asymptotically Optimal Message Dissemination with Applications to Blockchains.
IACR Cryptol. ePrint Arch., 2022

Practical Provably Secure Flooding for Blockchains.
IACR Cryptol. ePrint Arch., 2022

Asynchronous Multi-Party Quantum Computation.
IACR Cryptol. ePrint Arch., 2022

Optimal Synchronous Approximate Agreement with Asynchronous Fallback.
IACR Cryptol. ePrint Arch., 2022

Round-Optimal Byzantine Agreement.
IACR Cryptol. ePrint Arch., 2022

Synchronous Perfectly Secure Message Transmission with Optimal Asynchronous Fallback Guarantees.
IACR Cryptol. ePrint Arch., 2022

Network-Agnostic Security Comes for Free in DKG and MPC.
IACR Cryptol. ePrint Arch., 2022

2021
Multi-Party Computation: Definitions, Enhanced Security Guarantees and Efficiency.
PhD thesis, 2021

Adaptive Security of Multi-Party Protocols, Revisited.
IACR Cryptol. ePrint Arch., 2021

A New Way to Achieve Round-Efficient Byzantine Agreement.
IACR Cryptol. ePrint Arch., 2021

Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback.
IACR Cryptol. ePrint Arch., 2021

On Communication-Efficient Asynchronous MPC with Adaptive Security.
IACR Cryptol. ePrint Arch., 2021

Efficient Adaptively-Secure Byzantine Agreement for Long Messages.
IACR Cryptol. ePrint Arch., 2021

2020
On Broadcast in Generalized Network and Adversarial Models.
IACR Cryptol. ePrint Arch., 2020

Synchronous Constructive Cryptography.
IACR Cryptol. ePrint Arch., 2020

Multi-Threshold Asynchronous Reliable Broadcast and Consensus.
IACR Cryptol. ePrint Arch., 2020

From Partial to Global Asynchronous Reliable Broadcast.
IACR Cryptol. ePrint Arch., 2020

Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback.
IACR Cryptol. ePrint Arch., 2020

Asynchronous Byzantine Agreement with Subquadratic Communication.
IACR Cryptol. ePrint Arch., 2020

Brief Announcement: Multi-Threshold Asynchronous Reliable Broadcast and Consensus.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

MPC with Synchronous Security and Asynchronous Responsiveness.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
Robust MPC: Asynchronous Responsiveness yet Synchronous Security.
IACR Cryptol. ePrint Arch., 2019

Topology-Hiding Computation for Networks with Unknown Delays.
IACR Cryptol. ePrint Arch., 2019

Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

2018
Topology-Hiding Computation Beyond Semi-Honest Adversaries.
IACR Cryptol. ePrint Arch., 2018

2017
Witness-hiding proofs of knowledge for cable locks.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Efficiency lower bounds for commit-and-prove constructions.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017


  Loading...