Towards Optimal and Efficient Perfectly Secure Message Transmission

DOI10.1007/978-3-540-70936-7_17zbMath1129.94020OpenAlexW1526970571MaRDI QIDQ3596386

Matthias Fitzi, Matthew Franklin, S. Harsha Vardhan, Juan A. Garay

Publication date: 30 August 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-70936-7_17

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (9)

Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ How to recover a secret with \(O(n)\) additions ⋮ Secure message transmission in asynchronous networks ⋮ Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Secure Message Transmission by Public Discussion: A Brief Survey ⋮ Efficient robust secret sharing from expander graphs ⋮ Network Oblivious Transfer

This page was built for publication: Towards Optimal and Efficient Perfectly Secure Message Transmission