Asymptotically Optimal Two-Round Perfectly Secure Message Transmission

DOI10.1007/11818175_24MaRDI QIDQ5756631zbMATH OpenOpenAlexFDO

Authors Saurabh Agarwal, Ronald Cramer, Robbert de Haan

Publication date 4 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11818175_24

zbMATH Keywords

communication efficiencyinformation theoretic securityReliable and private transmissionzero-error protocols

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
• Towards Optimal and Efficient Perfectly Secure Message Transmission
• Advances in Cryptology – CRYPTO 2004
• Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
• Perfectly reliable message transmission

Cited in

(28)

• Oblivious transfer in incomplete networks
• Quantum verifiable protocol for secure modulo zero-sum randomness
• Two-message key exchange with strong security from ideal lattices
• On one-round reliable message transmission
• 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
• Secure Message Transmission in Asynchronous Directed Graphs
• Perfectly Secure Message Transmission in Two Rounds
• Perfectly secure message transmission against independent rational adversaries
• Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
• Towards Optimal and Efficient Perfectly Secure Message Transmission
• On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
• Almost Secure (1-Round, n-Channel) Message Transmission Scheme
• Perfectly secure message transmission
• Cryptanalysis of secure message transmission protocols with feedback
• Private message transmission using disjoint paths
• Advances in Cryptology – CRYPTO 2004
• Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality
• Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
• Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
• Must the communication graph of MPC protocols be an expander?
• Secure message transmission in asynchronous networks
• Network-agnostic perfectly secure message transmission revisited
• Two-round perfectly secure message transmission with optimal transmission rate
• Universally composable almost-everywhere secure computation
• Round-efficient perfectly secure message transmission scheme against general adversary
• Perfectly reliable message transmission

This page was built for publication: Asymptotically Optimal Two-Round Perfectly Secure Message Transmission

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