Perfectly Secure Message Transmission in Two Rounds

DOI10.1007/978-3-662-53641-4_12zbMath1406.94080arXiv1608.01909OpenAlexW2952832728MaRDI QIDQ3179361

Gilles Zémor, Gabriele Spini

Publication date: 21 December 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.01909

zbMATH Keywords

perfectly secure message transmission

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Oblivious transfer in incomplete networks ⋮ On one-round reliable message transmission ⋮ Perfectly Secure Message Transmission Against Independent Rational Adversaries ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Quantum verifiable protocol for secure modulo zero-sum randomness

Cites Work

• Unnamed Item
• Efficient perfectly secure message transmission in synchronous networks
• How to share a secret
• Perfectly secure message transmission
• Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme
• Advances in Cryptology – CRYPTO 2004
• Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
• Asymptotically Optimal Two-Round Perfectly Secure Message Transmission

This page was built for publication: Perfectly Secure Message Transmission in Two Rounds