Pages that link to "Item:Q5458599"
From MaRDI portal
The following pages link to Almost-Everywhere Secure Computation (Q5458599):
Displayed 45 items.
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
- Almost-everywhere secure computation with edge corruptions (Q901366) (← links)
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- Quantum verifiable protocol for secure modulo zero-sum randomness (Q2101598) (← links)
- Efficient constructions for almost-everywhere secure computation (Q2119011) (← links)
- Network-Hiding Communication and Applications to Multi-party Protocols (Q2829220) (← 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)
- The round complexity of distributed sorting (Q2943403) (← links)
- A tight unconditional lower bound on distributed randomwalk computation (Q2943404) (← links)
- Minimum congestion mapping in a cloud (Q2943405) (← links)
- Conflict on a communication channel (Q2943406) (← links)
- Xheal (Q2943407) (← links)
- Stability of a peer-to-peer communication system (Q2943409) (← links)
- Tight bounds on information dissemination in sparse mobile networks (Q2943410) (← links)
- Time-efficient randomized multiple-message broadcast in radio networks (Q2943411) (← links)
- Faster information dissemination in dynamic networks via network coding (Q2943412) (← links)
- Broadcast (and Round) Efficient Verifiable Secret Sharing (Q2948264) (← links)
- Secure Message Transmission by Public Discussion: A Brief Survey (Q3005585) (← links)
- Perfectly Secure Message Transmission Against Independent Rational Adversaries (Q3297684) (← links)
- Distributed Corruption Detection in Networks (Q5140835) (← links)
- Byzantine agreement with homonyms (Q5892120) (← links)
- Structuring unreliable radio networks (Q5892121) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5892122) (← links)
- Compact policy routing (Q5892123) (← links)
- Order optimal information spreading using algebraic gossip (Q5892124) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Practical provably secure flooding for blockchains (Q6135421) (← links)