Pages that link to "Item:Q4033834"
From MaRDI portal
The following pages link to Perfectly secure message transmission (Q4033834):
Displaying 50 items.
- Graph-theoretic design and analysis of key predistribution schemes (Q306046) (← links)
- Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission (Q391242) (← links)
- Using quantum key distribution for cryptographic purposes: a survey (Q477173) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- Secure message transmission in asynchronous networks (Q635383) (← links)
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures (Q662167) (← links)
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
- Round-efficient perfectly secure message transmission scheme against general adversary (Q766245) (← links)
- Perfectly reliable message transmission (Q845819) (← links)
- Almost-everywhere secure computation with edge corruptions (Q901366) (← links)
- Reliable communication over partially authenticated networks (Q1292432) (← links)
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- Topology-hiding computation beyond semi-honest adversaries (Q1631311) (← links)
- On minimal connectivity requirements for secure message transmission in directed networks (Q1685018) (← links)
- Incentives and the structure of communication (Q1753690) (← links)
- Learning the state of nature in repeated games with incomplete information and signals (Q1885428) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- On private computation in incomplete networks (Q1954202) (← links)
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
- Quantum verifiable protocol for secure modulo zero-sum randomness (Q2101598) (← links)
- Is information-theoretic topology-hiding computation possible? (Q2175925) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Improving the round complexity of VSS in point-to-point networks (Q2389350) (← links)
- Reliable broadcast with respect to topology knowledge (Q2407628) (← links)
- On one-round reliable message transmission (Q2414041) (← links)
- Probabilistic reliability and privacy of communication using multicast in general neighbor networks (Q2425532) (← links)
- Secure message transmission on directed networks (Q2442837) (← links)
- Information-theoretically secure MPC against mixed dynamic adversaries (Q2695650) (← links)
- Distributed Merkle's puzzles (Q2697863) (← links)
- What is the Future of Cryptography? (Q2803620) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- The Byzantine Generals Problem in Generic and Wireless Networks (Q2926152) (← links)
- Coordinated consensus in dynamic networks (Q2943377) (← links)
- Error-free multi-valued consensus with byzantine failures (Q2943378) (← links)
- Distributed graph coloring in a few rounds (Q2943379) (← links)
- MIS on trees (Q2943380) (← links)
- Toward more localized local algorithms (Q2943381) (← links)
- The complexity of robust atomic storage (Q2943384) (← links)
- Resilience of mutual exclusion algorithms to transient memory faults (Q2943385) (← links)
- The impact of memory models on software reliability in multiprocessors (Q2943388) (← links)
- A complexity separation between the cache-coherent and distributed shared memory models (Q2943389) (← links)
- From bounded to unbounded concurrency objects and back (Q2943391) (← links)
- The space complexity of long-lived and one-shot timestamp implementations (Q2943392) (← links)
- Locally checkable proofs (Q2943393) (← links)
- Fault-tolerant spanners (Q2943394) (← links)
- Adaptively secure broadcast, revisited (Q2943395) (← links)
- Scalable rational secret sharing (Q2943397) (← links)
- Analyzing consistency properties for fun and profit (Q2943399) (← links)
- Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions (Q2943400) (← links)
- Optimal-time adaptive strong renaming, with applications to counting (Q2943401) (← links)
