Optimal perfectly secure message transmission
From MaRDI portal
Recommendations
- Towards Optimal and Efficient Perfectly Secure Message Transmission
- Perfectly Secure Message Transmission in Two Rounds
- Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
- Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
- Perfectly reliable message transmission
Cited in
(35)- Oblivious transfer in incomplete networks
- Efficient perfectly secure message transmission in synchronous networks
- On private computation in incomplete networks
- Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation
- Bounds and constructions for 1-round (0, )-secure message transmission against generalized adversary
- Human Perfectly Secure Message Transmission Protocols and Their Applications
- Round-optimal perfectly secret message transmission with linear communication complexity
- Secure message transmission by public discussion: a brief survey
- General perfectly secure message transmission using linear codes
- Secure Message Transmission in Asynchronous Directed Graphs
- Perfectly Secure Message Transmission in Two Rounds
- Perfectly secure message transmission against independent rational adversaries
- Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
- Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
- Simple and communication complexity efficient almost secure and perfectly secure message transmission schemes
- Secure message transmission with small public discussion
- Towards Optimal and Efficient Perfectly Secure Message Transmission
- On Proactive Perfectly Secure Message Transmission
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
- Cryptanalysis of secure message transmission protocols with feedback
- Private message transmission using disjoint paths
- Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality
- Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
- Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
- Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
- Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
- Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
- Must the communication graph of MPC protocols be an expander?
- Perfectly secure message transmission against rational timid adversaries
- Secure message transmission in asynchronous networks
- Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees
- Two-round perfectly secure message transmission with optimal transmission rate
- Universally composable almost-everywhere secure computation
- Round-efficient perfectly secure message transmission scheme against general adversary
- Perfectly reliable message transmission
This page was built for publication: Optimal perfectly secure message transmission
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311556)