Almost-Everywhere Secure Computation

DOI10.1007/978-3-540-78967-3_18zbMATH Open1149.68377OpenAlexW2083796634MaRDI QIDQ5458599FDOQ5458599

Juan 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

Recommendations

• Almost-everywhere secure computation with edge corruptions
• Topology-hiding computation
• Perfectly-Secure MPC with Linear Communication Complexity
• Improved fault tolerance and secure computation on sparse networks
• Must the communication graph of MPC protocols be an expander?

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (51)

• Must the communication graph of MPC protocols be an expander?
• Resilience of mutual exclusion algorithms to transient memory faults
• Quantum verifiable protocol for secure modulo zero-sum randomness
• Distributed Corruption Detection in Networks
• Byzantine agreement with homonyms
• Adaptively secure broadcast, revisited
• General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
• Efficient perfectly secure computation with optimal resilience
• Secure Message Transmission by Public Discussion: A Brief Survey
• Distributed deterministic edge coloring using bounded neighborhood independence
• Compact policy routing
• Coordinated consensus in dynamic networks
• The space complexity of long-lived and one-shot timestamp implementations
• Efficient constructions for almost-everywhere secure computation
• MIS on trees
• Distributed graph coloring in a few rounds
• Oblivious transfer in incomplete networks
• Fine-grained secure computation
• Time-efficient randomized multiple-message broadcast in radio networks
• From bounded to unbounded concurrency objects and back
• Perfectly Secure Message Transmission Against Independent Rational Adversaries
• Locally checkable proofs
• Optimal-time adaptive strong renaming, with applications to counting
• Analyzing consistency properties for fun and profit
• Stability of a peer-to-peer communication system
• The impact of memory models on software reliability in multiprocessors
• A tight unconditional lower bound on distributed randomwalk computation
• Maliciously secure massively parallel computation for all-but-one corruptions
• An algebraic framework for silent preprocessing with trustless setup and active security
• Scalable rational secret sharing
• Structuring unreliable radio networks
• Network-Hiding Communication and Applications to Multi-party Protocols
• Minimum congestion mapping in a cloud
• Toward more localized local algorithms
• Conflict on a communication channel
• Practical provably secure flooding for blockchains
• Almost-everywhere secure computation with edge corruptions
• Broadcast (and Round) Efficient Verifiable Secret Sharing
• Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
• Order optimal information spreading using algebraic gossip
• Fast and compact self-stabilizing verification, computation, and fault detection of an MST
• A complexity separation between the cache-coherent and distributed shared memory models
• Error-free multi-valued consensus with byzantine failures
• The complexity of robust atomic storage
• The round complexity of distributed sorting
• Fault-tolerant spanners
• Secure computation with low communication from cross-checking
• Xheal
• Efficient robust secret sharing from expander graphs
• Faster information dissemination in dynamic networks via network coding
• Tight bounds on information dissemination in sparse mobile networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458599)