Secure message transmission in asynchronous networks
From MaRDI portal
Recommendations
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
- Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
- Towards Optimal and Efficient Perfectly Secure Message Transmission
- Advances in Cryptology – CRYPTO 2004
- Efficient perfectly secure message transmission in synchronous networks
Cites work
- scientific article; zbMATH DE number 1583776 (Why is no real title available?)
- scientific article; zbMATH DE number 1583939 (Why is no real title available?)
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1952911 (Why is no real title available?)
- scientific article; zbMATH DE number 2086727 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- Almost Secure (1-Round, n-Channel) Message Transmission Scheme
- An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience
- Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
- Asynchronous Secure Communication Tolerating Mixed Adversaries
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
- Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
- Efficient perfectly secure message transmission in synchronous networks
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- Fast asynchronous Byzantine agreement with optimal resilience
- How to share a secret
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
- Perfectly secure message transmission
- Perfectly-Secure MPC with Linear Communication Complexity
- Reaching Agreement in the Presence of Faults
- Secure communication in minimal connectivity models
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Simple and efficient asynchronous Byzantine agreement with optimal resilience
- The Byzantine generals strike again
- The Round Complexity of Verifiable Secret Sharing Revisited
- The round complexity of verifiable secret sharing and secure multicast
- Theory of Cryptography
- Towards Optimal and Efficient Perfectly Secure Message Transmission
- Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
- Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality
Cited in
(10)- Security in Asynchronous Interactive Systems
- Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- On the communication complexity of reliable and secure message transmission in asynchronous networks
- Asynchronous Secure Communication Tolerating Mixed Adversaries
- Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
- Network-agnostic perfectly secure message transmission revisited
- Secure Message Delivery Games for Device-to-Device Communications
- Secure Message Transmission in Asynchronous Directed Graphs
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
This page was built for publication: Secure message transmission in asynchronous networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635383)
