Perfectly secure message transmission

DOI10.1145/138027.138036zbMath0774.68017OpenAlexW2092148937MaRDI QIDQ4033834

Orli Waarts, Danny Dolev, Cynthia Dwork, Mordechai M. Yung

Publication date: 16 May 1993

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/138027.138036

zbMATH Keywords

fault-tolerance distributed computing probabilistic computation security and protection distributed applications perfectly secure communication

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (91)

Learning the state of nature in repeated games with incomplete information and signals ⋮ Oblivious transfer in incomplete networks ⋮ Topology-hiding computation beyond semi-honest adversaries ⋮ AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT ⋮ Graph-theoretic design and analysis of key predistribution schemes ⋮ Perfectly reliable message transmission ⋮ Perfectly Secure Message Transmission in Two Rounds ⋮ Improving the round complexity of VSS in point-to-point networks ⋮ The Byzantine Generals Problem in Generic and Wireless Networks ⋮ Mathematical problems in cryptology ⋮ Reliable broadcast with respect to topology knowledge ⋮ Is information-theoretic topology-hiding computation possible? ⋮ Coordinated consensus in dynamic networks ⋮ Error-free multi-valued consensus with byzantine failures ⋮ Distributed graph coloring in a few rounds ⋮ MIS on trees ⋮ Toward more localized local algorithms ⋮ The complexity of robust atomic storage ⋮ Resilience of mutual exclusion algorithms to transient memory faults ⋮ The impact of memory models on software reliability in multiprocessors ⋮ A complexity separation between the cache-coherent and distributed shared memory models ⋮ From bounded to unbounded concurrency objects and back ⋮ The space complexity of long-lived and one-shot timestamp implementations ⋮ Locally checkable proofs ⋮ Fault-tolerant spanners ⋮ Adaptively secure broadcast, revisited ⋮ Scalable rational secret sharing ⋮ Analyzing consistency properties for fun and profit ⋮ Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions ⋮ Optimal-time adaptive strong renaming, with applications to counting ⋮ The round complexity of distributed sorting ⋮ A tight unconditional lower bound on distributed randomwalk computation ⋮ Minimum congestion mapping in a cloud ⋮ Conflict on a communication channel ⋮ Stability of a peer-to-peer communication system ⋮ Tight bounds on information dissemination in sparse mobile networks ⋮ Time-efficient randomized multiple-message broadcast in radio networks ⋮ Faster information dissemination in dynamic networks via network coding ⋮ On one-round reliable message transmission ⋮ Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission ⋮ Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity ⋮ Mechanism design and communication networks ⋮ Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ On minimal connectivity requirements for secure message transmission in directed networks ⋮ Correction to: ``Topology-hiding communication from minimal assumptions ⋮ Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey ⋮ Probabilistic reliability and privacy of communication using multicast in general neighbor networks ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Almost-everywhere secure computation with edge corruptions ⋮ Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary ⋮ Secure message transmission in asynchronous networks ⋮ Information-theoretically secure MPC against mixed dynamic adversaries ⋮ Distributed Merkle's puzzles ⋮ On private computation in incomplete networks ⋮ Secure message transmission on directed networks ⋮ Order optimal information spreading using algebraic gossip ⋮ Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited ⋮ A logical approach to multilevel security of probabilistic systems ⋮ Cryptography and cryptographic protocols ⋮ Using quantum key distribution for cryptographic purposes: a survey ⋮ Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures ⋮ Realistic versus Rational Secret Sharing ⋮ Perfectly Secure Message Transmission Against Independent Rational Adversaries ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Secure Message Transmission by Public Discussion: A Brief Survey ⋮ Fast and compact self-stabilizing verification, computation, and fault detection of an MST ⋮ ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH ⋮ Efficient robust secret sharing from expander graphs ⋮ Incentives and the structure of communication ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Cryptanalysis of Secure Message Transmission Protocols with Feedback ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ Structuring unreliable radio networks ⋮ Byzantine agreement with homonyms ⋮ Distributed deterministic edge coloring using bounded neighborhood independence ⋮ Compact policy routing ⋮ Efficient reliable communication over partially authenticated networks ⋮ On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks ⋮ What is the Future of Cryptography? ⋮ Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality ⋮ Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary ⋮ Byzantine Agreement Using Partial Authentication ⋮ Network Oblivious Transfer ⋮ Round-efficient perfectly secure message transmission scheme against general adversary ⋮ Secure Message Transmission in Asynchronous Directed Graphs ⋮ Reliable communication over partially authenticated networks ⋮ Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary ⋮ Xheal ⋮ Quantum verifiable protocol for secure modulo zero-sum randomness

This page was built for publication: Perfectly secure message transmission