Almost-Everywhere Secure Computation

DOI10.1007/978-3-540-78967-3_18MaRDI QIDQ5458599zbMATH OpenOpenAlexFDO

Authors 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

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)

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?

Cited in

(54)

• Perfectly secure message transmission against independent rational adversaries
• Faster information dissemination in dynamic networks via network coding
• Tight bounds on information dissemination in sparse mobile networks
• Resilience of mutual exclusion algorithms to transient memory faults
• Quantum verifiable protocol for secure modulo zero-sum randomness
• Adaptively secure broadcast, revisited
• Byzantine agreement with homonyms
• General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
• Efficient perfectly secure computation with optimal resilience
• Distributed deterministic edge coloring using bounded neighborhood independence
• Efficient constructions for almost-everywhere secure computation
• Coordinated consensus in dynamic networks
• Compact policy routing
• 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
• Xheal, localized self-healing using expanders
• Distributed algorithms made secure: a graph theoretic approach
• Toward more localized local algorithms, removing assumptions concerning global knowledge
• Topology-hiding computation
• 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
• Broadcast (and round) efficient verifiable secret sharing
• Scalable rational secret sharing
• Distributed corruption detection in networks
• Error-free multi-valued consensus with Byzantine failures
• Structuring unreliable radio networks
• Network-Hiding Communication and Applications to Multi-party Protocols
• The hidden graph model: communication locality and optimal resiliency with adaptive faults
• Minimum congestion mapping in a cloud
• Conflict on a communication channel
• The round complexity of distributed sorting, extended abstract
• Almost-everywhere secure computation with edge corruptions
• Practical provably secure flooding for blockchains
• Must the communication graph of MPC protocols be an expander?
• Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
• A complexity separation between the cache-coherent and distributed shared memory models
• Secure message transmission by public discussion: a brief survey
• Improved fault tolerance and secure computation on sparse networks
• Order optimal information spreading using algebraic gossip
• Must the communication graph of MPC protocols be an expander?
• The complexity of robust atomic storage
• Fault-tolerant spanners
• Secure computation with low communication from cross-checking
• Efficient robust secret sharing from expander graphs

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)