A Unified Approach to MPC with Preprocessing Using OT
From MaRDI portal
Publication:2811152
DOI10.1007/978-3-662-48797-6_29zbMATH Open1396.94077OpenAlexW2295145729MaRDI QIDQ2811152FDOQ2811152
Authors: Marcel Keller, Emmanuela Orsini, Peter Scholl, Tore Kasper Frederiksen 
Publication date: 10 June 2016
Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)
Full work available at URL: http://eprint.iacr.org/2015/901
Recommendations
- Linear overhead optimally-resilient robust MPC using preprocessing
- Efficient MPC optimization using Pontryagin's minimum principle
- scientific article; zbMATH DE number 880287
- scientific article; zbMATH DE number 50941
- Robust model predictive control by iterative optimisation for polytopic uncertain systems
- Preconditioners for robust optimal control problems under uncertainty
- Explicit/multi-parametric model predictive control (MPC) of linear discrete-time systems by dynamic and multi-parametric programming
- Optimizing prediction dynamics for robust MPC
- Dynamic output feedback robust MPC with convex optimisation for system with polytopic uncertainty
- MPC for continuous piecewise-affine systems
Cited In (21)
- Faster Secure Multi-party Computation of AES and DES Using Lookup Tables
- An empirical study and some improvements of the MiniMac protocol for secure computation
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- TinyKeys: a new approach to efficient multi-party computation
- Privacy-preserving edit distance computation using secret-sharing two-party computation
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Putting the online phase on a diet: covert security from short MACs
- Low cost constant round MPC combining BMR and oblivious transfer
- Secure multiparty computation with free branching
- Large scale, actively secure computation from LPN and free-XOR garbled circuits
- The more the merrier: reducing the cost of large scale MPC
- Fast public-key silent OT and more from constrained Naor-Reingold
- Efficient constant-round MPC with identifiable abort and public verifiability
- Masked triples. Amortizing multiplication triples across conditionals
- More efficient oblivious transfer extensions
- Actively secure setup for SPDZ
- An efficient structural attack on NIST submission DAGS
- Better preprocessing for secure multiparty computation
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- A new approach to efficient and secure fixed-point computation
- Improved primitives for MPC over mixed arithmetic-binary circuits
This page was built for publication: A Unified Approach to MPC with Preprocessing Using OT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811152)
