Putting the online phase on a diet: covert security from short MACs

Cites Work

Optimizing authenticated garbling for faster secure two-party computation
Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
Overdrive: making SPDZ great again
The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
\(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
Security and composition of multiparty cryptographic protocols
High-performance multi-party computation for binary circuits based on oblivious transfer
Generic compiler for publicly verifiable covert multi-party computation
Efficient pseudorandom correlation generators from ring-LPN
Black-box transformations from passive to covert security with public verifiability
Efficient, actively secure MPC with a dishonest majority: a survey
Efficient pseudorandom correlation generators: silent OT extension and more
Maliciously secure matrix multiplication with applications to private deep learning
A Unified Approach to MPC with Preprocessing Using OT
Secure Multi-Party Computation with Identifiable Abort
Dishonest Majority Multi-Party Computation for Binary Circuits
Multiparty Computation from Somewhat Homomorphic Encryption
A New Approach to Practical Active-Secure Two-Party Computation
Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
Calling Out Cheaters: Covert Security with Public Verifiability
Authenticated garbling from simple correlations
Batching base oblivious transfers

This page was built for publication: Putting the online phase on a diet: covert security from short MACs