Round-efficient perfectly secure message transmission scheme against general adversary
From MaRDI portal
Publication:766245
Recommendations
- Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
- Perfectly Secure Message Transmission in Two Rounds
- Towards Optimal and Efficient Perfectly Secure Message Transmission
- General perfectly secure message transmission using linear codes
- Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary
Cites work
- Advances in Cryptology – CRYPTO 2004
- Algorithms and Computation
- Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
- Efficient perfectly secure message transmission in synchronous networks
- General secure multi-party computation from any linear secret-sharing scheme
- Multiple assignment scheme for sharing secret
- On perfectly secure communication over arbitrary networks
- Perfectly secure message transmission
- Player simulation and general adversary structures in perfect multiparty computation
- Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
Cited in
(7)- Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary
- General perfectly secure message transmission using linear codes
- Perfectly Secure Message Transmission in Two Rounds
- Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
- Almost Secure (1-Round, n-Channel) Message Transmission Scheme
- Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
- Secure message transmission in the presence of a fully generalised adversary
This page was built for publication: Round-efficient perfectly secure message transmission scheme against general adversary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766245)