Asymptotically Optimal Two-Round Perfectly Secure Message Transmission

DOI10.1007/11818175_24zbMath1129.94009OpenAlexW1604064347MaRDI QIDQ5756631

Robbert de Haan, Ronald Cramer, Saurabh Agarwal

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

Related Items (15)

Oblivious transfer in incomplete networks ⋮ Perfectly Secure Message Transmission in Two Rounds ⋮ On one-round reliable message transmission ⋮ Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary ⋮ Secure message transmission in asynchronous networks ⋮ Perfectly Secure Message Transmission Against Independent Rational Adversaries ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Secure Message Transmission by Public Discussion: A Brief Survey ⋮ Cryptanalysis of Secure Message Transmission Protocols with Feedback ⋮ On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks ⋮ Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality ⋮ Round-efficient perfectly secure message transmission scheme against general adversary ⋮ Secure Message Transmission in Asynchronous Directed Graphs ⋮ Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary ⋮ Quantum verifiable protocol for secure modulo zero-sum randomness

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