Constant-Round MPC with Fairness and Guarantee of Output Delivery
From MaRDI portal
Recommendations
- Communication-efficient unconditional MPC with guaranteed output delivery
- Distributed Satisficing MPC With Guarantee of Stability
- Round optimal concurrent MPC via strong simulation
- Efficient constant-round MPC with identifiable abort and public verifiability
- Efficient scalable constant-round MPC via garbled circuits
- Stochastic MPC with inequality stability constraints
- MPC for tracking piecewise constant references for constrained linear systems
- MPC for Sampled-Data Linear Systems: Guaranteeing Constraint Satisfaction in Continuous-Time
- Dynamic output feedback robust MPC with convex optimisation for system with polytopic uncertainty
- MPC for continuous piecewise-affine systems
Cited in
(39)- Two-round MPC: information-theoretic and black-box
- Two-round adaptively secure multiparty computation from standard assumptions
- An improved affine equivalence algorithm for random permutations
- Round-optimal secure multiparty computation with honest majority
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Multiparty reusable non-interactive secure computation from LWE
- Unbounded multi-party computation from learning with errors
- Broadcast-optimal two-round MPC
- Broadcast-optimal two round MPC with an honest majority
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Offline witness encryption with semi-adaptive security
- Probabilistic termination and composability of cryptographic protocols
- On the exact round complexity of best-of-both-worlds multi-party computation
- Secure MPC: laziness leads to GOD
- On communication models and best-achievable security in two-round MPC
- Probabilistic Termination and Composability of Cryptographic Protocols
- Foundations of homomorphic secret sharing
- On the exact round complexity of secure three-party computation
- On the exact round complexity of secure three-party computation
- Adaptively secure MPC with sublinear communication complexity
- Minimizing setup in broadcast-optimal two round MPC
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- The round complexity of statistical MPC with optimal resiliency
- On the round complexity of fully secure solitary MPC with honest majority
- Broadcast-optimal two round MPC with asynchronous peer-to-peer channels
- Threshold-optimal MPC with friends and foes
- Witness encryption for succinct functional commitments and applications
- Round-optimal, fully secure distributed key generation
- Authorized multi-key fully homomorphic encryption scheme with compact ciphertext
- How to share an NP statement or combiners for zero-knowledge proofs
- Actively secure MPC in the dishonest majority setting: achieving constant complexity in online communication, computation per gate, rounds, and private input size
- Foundations of platform-assisted auctions
- Improved universal thresholdizer from iterative Shamir secret sharing
- Low communication threshold FHE from standard (module-)LWE
- Constant-round YOSO MPC without setup
This page was built for publication: Constant-Round MPC with Fairness and Guarantee of Output Delivery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457060)
