The price of active security in cryptographic protocols

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Smooth projective hashing and two-message oblivious transfer
Fast large-scale honest-majority MPC for malicious adversaries
Amortized complexity of information-theoretically secure MPC revisited
Efficient secure two-party protocols. Techniques and constructions
Overdrive: making SPDZ great again
Secure arithmetic computation with constant computational overhead
Actively secure garbled circuits with constant communication overhead in the plain model
A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
Secure two-party computation via cut-and-choose oblivious transfer
Constant-overhead unconditionally secure multiparty computation over binary fields
A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
Sublinear GMW-style compiler for MPC with preprocessing
Secure multiparty computation with sublinear preprocessing
Zero-knowledge proofs on secret-shared data via fully linear PCPs
Communication-efficient unconditional MPC with guaranteed output delivery
Efficient fully secure computation via distributed zero-knowledge proofs
Amortizing Garbled 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
Two Halves Make a Whole
Semi-homomorphic Encryption and Multiparty Computation
Black-Box Constructions of Protocols for Secure Computation
How to share a secret
Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
Improved Garbled Circuit: Free XOR Gates and Applications
On Ideal Lattices and Learning with Errors over Rings
Founding Cryptography on Oblivious Transfer – Efficiently
Secure Arithmetic Computation with No Honest Majority
LEGO for Two-Party Secure Computation
Scalable and Unconditionally Secure Multiparty Computation
The IPS Compiler: Optimizations, Variants and Concrete Efficiency
Circuits resilient to additive attacks with applications to secure computation
Faster Secure Two-Party Computation in the Single-Execution Setting
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
Practical Two-Party Computation Based on the Conditional Gate
Oblivious Polynomial Evaluation
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
Scalable Secure Multiparty Computation
On the local leakage resilience of linear secret sharing schemes
Low cost constant round MPC combining BMR and oblivious transfer
Sharing transformation and dishonest majority MPC with packed secret sharing
Ramp hyper-invertible matrices and their applications to MPC protocols

This page was built for publication: The price of active security in cryptographic protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595846)