scientific article; zbMATH DE number 2086727
From MaRDI portal
Publication:4737267
Recommendations
- Perfectly Secure Message Transmission Revisited
- Perfectly secure message transmission
- Simple and communication complexity efficient almost secure and perfectly secure message transmission schemes
- Cryptography for Unconditionally Secure Message Transmission in Networks (Invited Talk)
- Efficient perfectly secure message transmission in synchronous networks
Cited in
(32)- Edge-colored graphs with applications to homogeneous faults
- On private computation in incomplete networks
- Secure communication in minimal connectivity models
- Secure message transmission on directed networks
- Human Perfectly Secure Message Transmission Protocols and Their Applications
- Secure communication over radio channels
- Round-optimal perfectly secret message transmission with linear communication complexity
- Secure Message Transmission in Asynchronous Directed Graphs
- Perfectly Secure Message Transmission in Two Rounds
- Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
- Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
- Perfectly Secure Message Transmission Revisited
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
- Almost Secure (1-Round, n-Channel) Message Transmission Scheme
- Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission
- Perfectly secure message transmission
- scientific article; zbMATH DE number 1263179 (Why is no real title available?)
- scientific article; zbMATH DE number 1304089 (Why is no real title available?)
- Mechanism design and communication networks
- Using quantum key distribution for cryptographic purposes: a survey
- Cryptanalysis of secure message transmission protocols with feedback
- Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
- Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
- Algorithms and Computation
- Efficient reliable communication over partially authenticated networks
- Secure message transmission in asynchronous networks
- Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees
- Games with information constraints: seeds and spillovers
- Statistical layered MPC
- Perfectly reliable message transmission
- Secure message transmission in the presence of a fully generalised adversary
- A one-round secure message broadcasting protocol through a key sharing tree
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737267)