Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees
From MaRDI portal
Publication:6573950
DOI10.1007/978-3-031-47754-6_5MaRDI QIDQ6573950
Chen-Da Liu-Zhang, Giovanni Deligios
Publication date: 17 July 2024
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)
Cites Work
- Title not available (Why is that?)
- Secure message transmission in asynchronous networks
- Zur allgemeinen Kurventheorie.
- Efficient perfectly secure message transmission in synchronous networks
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Synchronous consensus with optimal asynchronous fallback guarantees
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- Secure Message Transmission by Public Discussion: A Brief Survey
- Perfectly Secure Message Transmission in Two Rounds
- Almost Secure (1-Round, n-Channel) Message Transmission Scheme
- Perfectly secure message transmission
- Advances in Cryptology – CRYPTO 2004
- Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
- \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions
- Optimal Synchronous Approximate Agreement with Asynchronous Fallback
- Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees
Related Items (1)
This page was built for publication: Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573950)
