scientific article; zbMATH DE number 1302842
From MaRDI portal
Publication:4249325
Recommendations
Cited in
(33)- On minimal connectivity requirements for secure message transmission in directed networks
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Secure multi-party computation made simple
- Secure MPC: laziness leads to GOD
- Information-theoretically secure MPC against mixed dynamic adversaries
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
- Round-optimal perfectly secret message transmission with linear communication complexity
- Graceful degradation in multi-party computation. (Extended abstract)
- Player-centric Byzantine agreement
- MPC vs. SFE : Unconditional and Computational Security
- Realistic Failures in Secure Multi-party Computation
- Multi-Party Computation with Omnipresent Adversary
- scientific article; zbMATH DE number 2009948 (Why is no real title available?)
- scientific article; zbMATH DE number 1504552 (Why is no real title available?)
- Trading robustness for correctness and privacy in certain multiparty computations, beyond an honest majority
- Passive corruption in statistical multi-party computation. (Extended abstract)
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Simultaneous Broadcast
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Attaining GOD beyond honest majority with friends and foes
- On linear communication complexity for (maximally) fluid MPC
- MPC with delayed parties over star-like networks
- On information-theoretic secure multiparty computation with local repairability
- Multi-party computation with conversion of secret sharing
- Multi-threshold asynchronous reliable broadcast and consensus
- Universally composable almost-everywhere secure computation
- Distributing keys and random secrets with constant complexity
- General adversary structures in Byzantine agreement and multi-party computation with active and omission corruption
- Towards scalable YOSO MPC via packed secret-sharing
- Rumors MPC: GOD for dynamic committees, low communication via constant-round chat
- Perfectly secure fluid MPC with abort and linear communication complexity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249325)
