Cryptanalysis of secure message transmission protocols with feedback
From MaRDI portal
Recommendations
Cites work
- Advances in Cryptology – CRYPTO 2004
- Algorithms and Computation
- Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
- Codes Which Detect Deception
- How to share a secret
- scientific article; zbMATH DE number 5764833 (Why is no real title available?)
- scientific article; zbMATH DE number 2086727 (Why is no real title available?)
- On perfectly secure communication over arbitrary networks
- Perfectly secure message transmission
- Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
- Perfectly Secure Message Transmission Revisited
- Player simulation and general adversary structures in perfect multiparty computation
- Possibility and complexity of probabilistic reliable communication in directed networks
- Secure communication in minimal connectivity models
- The Byzantine generals strike again
- Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
- Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
Cited in
(4)
This page was built for publication: Cryptanalysis of secure message transmission protocols with feedback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4931676)