Perfectly secure message transmission
From MaRDI portal
Recommendations
- On perfectly secure communication over arbitrary networks
- Efficient perfectly secure message transmission in synchronous networks
- Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
- Simple and communication complexity efficient almost secure and perfectly secure message transmission schemes
- scientific article; zbMATH DE number 2086727
Cited in
(only showing first 100 items - show all)- Reliable communication over partially authenticated networks
- Designing secure communication protocols from trust specifications
- Oblivious transfer in incomplete networks
- Topology-hiding computation beyond semi-honest adversaries
- On minimal connectivity requirements for secure message transmission in directed networks
- Incentives and the structure of communication
- Learning the state of nature in repeated games with incomplete information and signals
- Mathematical problems in cryptology
- Efficient perfectly secure message transmission in synchronous networks
- On private computation in incomplete networks
- Secure communication in minimal connectivity models
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Quantum verifiable protocol for secure modulo zero-sum randomness
- Is information-theoretic topology-hiding computation possible?
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Improving the round complexity of VSS in point-to-point networks
- Reliable broadcast with respect to topology knowledge
- On one-round reliable message transmission
- Probabilistic reliability and privacy of communication using multicast in general neighbor networks
- Secure message transmission on directed networks
- Information-theoretically secure MPC against mixed dynamic adversaries
- Distributed Merkle's puzzles
- What is the Future of Cryptography?
- Network oblivious transfer
- Human Perfectly Secure Message Transmission Protocols and Their Applications
- The Byzantine generals problem in generic and wireless networks
- Secure communication over radio channels
- 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, removing assumptions concerning global knowledge
- 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
- 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, extended abstract
- A tight unconditional lower bound on distributed randomwalk computation
- Minimum congestion mapping in a cloud
- Conflict on a communication channel
- Xheal, localized self-healing using expanders
- 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
- Round-optimal perfectly secret message transmission with linear communication complexity
- Broadcast (and round) efficient verifiable secret sharing
- Secure message transmission by public discussion: a brief survey
- Graph-theoretic design and analysis of key predistribution schemes
- Byzantine Agreement Using Partial Authentication
- Secure communication in multicast graphs
- Secure Message Transmission in Asynchronous Directed Graphs
- An application of st-numbering to secret key agreement
- Perfectly Secure Message Transmission in Two Rounds
- Realistic versus rational secret sharing
- Perfectly secure message transmission against independent rational adversaries
- Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
- Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
- Simple and communication complexity efficient almost secure and perfectly secure message transmission schemes
- Perfectly Secure Message Transmission Revisited
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
- Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission
- scientific article; zbMATH DE number 1263179 (Why is no real title available?)
- scientific article; zbMATH DE number 1303134 (Why is no real title available?)
- scientific article; zbMATH DE number 2006644 (Why is no real title available?)
- scientific article; zbMATH DE number 1504555 (Why is no real title available?)
- Mechanism design and communication networks
- scientific article; zbMATH DE number 2086727 (Why is no real title available?)
- Using quantum key distribution for cryptographic purposes: a survey
- Absolutely secure message transmission using a key sharing graph
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- Cryptanalysis of secure message transmission protocols with feedback
- A logical approach to multilevel security of probabilistic systems
- Cryptography and cryptographic protocols
- On perfectly secure communication over arbitrary networks
- Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality
- Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
- Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
- Byzantine agreement with homonyms
- Structuring unreliable radio networks
- Distributed deterministic edge coloring using bounded neighborhood independence
- Compact policy routing
- Order optimal information spreading using algebraic gossip
- Efficient reliable communication over partially authenticated networks
- Correction to: ``Topology-hiding communication from minimal assumptions
- Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Must the communication graph of MPC protocols be an expander?
- Attaining GOD beyond honest majority with friends and foes
- Secure message transmission in asynchronous networks
- Communication on networks and strong reliability
- Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees
This page was built for publication: Perfectly secure message transmission
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033834)
