Almost-Everywhere Secure Computation

DOI10.1007/978-3-540-78967-3_18zbMath1149.68377OpenAlexW2083796634MaRDI QIDQ5458599

Juan A. Garay, Rafail Ostrovsky

Publication date: 15 April 2008

Published in: Advances in Cryptology – EUROCRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78967-3_18

zbMATH Keywords

expander graphssecure message transmissionSecure multi-party computationalmost-everywhere agreementbounded-degree networks

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (45)

Oblivious transfer in incomplete networks ⋮ 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 ⋮ Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ Practical provably secure flooding for blockchains ⋮ Almost-everywhere secure computation with edge corruptions ⋮ Order optimal information spreading using algebraic gossip ⋮ 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 ⋮ Fast and compact self-stabilizing verification, computation, and fault detection of an MST ⋮ Efficient robust secret sharing from expander graphs ⋮ Structuring unreliable radio networks ⋮ Byzantine agreement with homonyms ⋮ Distributed deterministic edge coloring using bounded neighborhood independence ⋮ Compact policy routing ⋮ Distributed Corruption Detection in Networks ⋮ Network-Hiding Communication and Applications to Multi-party Protocols ⋮ Xheal ⋮ Quantum verifiable protocol for secure modulo zero-sum randomness ⋮ Efficient constructions for almost-everywhere secure computation

This page was built for publication: Almost-Everywhere Secure Computation