Towards Optimal and Efficient Perfectly Secure Message Transmission

DOI10.1007/978-3-540-70936-7_17MaRDI QIDQ3596386zbMATH OpenOpenAlexFDO

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

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) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Perfectly Secure Message Transmission in Two Rounds
• Advances in Cryptology – CRYPTO 2004
• Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
• Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
• Efficient perfectly secure message transmission in synchronous networks

Cited in

(35)

• Efficient perfectly secure message transmission in synchronous networks
• Network oblivious transfer
• Bounds and constructions for 1-round (0, )-secure message transmission against generalized adversary
• Human Perfectly Secure Message Transmission Protocols and Their Applications
• Round-optimal perfectly secret message transmission with linear communication complexity
• Secure message transmission by public discussion: a brief survey
• 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 against independent rational adversaries
• Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
• Simple and communication complexity efficient almost secure and perfectly secure message transmission schemes
• Secure message transmission with small public discussion
• Almost Secure (1-Round, n-Channel) Message Transmission Scheme
• Robust Secure Transmission in MISO Channels Based on Worst-Case Optimization
• Private message transmission using disjoint paths
• Advances in Cryptology – CRYPTO 2004
• Constant phase efficient protocols for secure message transmission in directed networks
• Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
• Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
• Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
• Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
• Topics in Cryptology – CT-RSA 2006
• Must the communication graph of MPC protocols be an expander?
• Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
• Perfectly secure message transmission against rational timid adversaries
• How to recover a secret with O(n) additions
• Secure message transmission in asynchronous networks
• $$\text {Muckle}+$$: End-to-End Hybrid Authenticated Key Exchanges
• Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
• Network-agnostic perfectly secure message transmission revisited
• Two-round perfectly secure message transmission with optimal transmission rate
• Efficient robust secret sharing from expander graphs
• Round-efficient perfectly secure message transmission scheme against general adversary
• Perfectly reliable message transmission
• Secure message transmission in the presence of a fully generalised adversary

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596386)