The price of active security in cryptographic protocols
From MaRDI portal
Recommendations
- Multiparty computation for dishonest majority: from passive to active security at low cost
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Perfectly-Secure MPC with Linear Communication Complexity
Cites work
- A new approach to practical active-secure two-party computation
- Actively secure garbled circuits with constant communication overhead in the plain model
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Amortizing Garbled Circuits
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Binary AMD circuits from secure multiparty computation
- Black-box constructions of protocols for secure computation
- Circuits resilient to additive attacks with applications to secure computation
- Communication-efficient unconditional MPC with guaranteed output delivery
- Efficient constant round multi-party computation combining BMR and SPDZ
- Fast garbling of circuits under standard assumptions
- Fast large-scale honest-majority MPC for malicious adversaries
- Faster secure two-party computation in the single-execution setting
- Founding Cryptography on Oblivious Transfer – Efficiently
- How to share a secret
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- Improved Garbled Circuit: Free XOR Gates and Applications
- LEGO for Two-Party Secure Computation
- Low cost constant round MPC combining BMR and oblivious transfer
- Multiparty Computation from Somewhat Homomorphic Encryption
- Overdrive: making SPDZ great again
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Practical Two-Party Computation Based on the Conditional Gate
- Scalable and Unconditionally Secure Multiparty Computation
- Scalable Secure Multiparty Computation
- Secure arithmetic computation with constant computational overhead
- Secure Arithmetic Computation with No Honest Majority
- Secure protocol transformations
- Secure two-party computation via cut-and-choose oblivious transfer
- Semi-homomorphic encryption and multiparty computation
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Smooth projective hashing and two-message oblivious transfer
- The IPS compiler: optimizations, variants and concrete efficiency
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
Cited in
(21)- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Generic compiler for publicly verifiable covert multi-party computation
- Constant-overhead unconditionally secure multiparty computation over binary fields
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Constructing locally leakage-resilient linear secret-sharing schemes
- Efficient, actively secure MPC with a dishonest majority: a survey
- On actively-secure elementary MPC reductions
- Binary AMD circuits from secure multiparty computation
- From Passive to Covert Security at Low Cost
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Multiparty computation for dishonest majority: from passive to active security at low cost
- Actively secure arithmetic computation and VOLE with constant computational overhead
- Best of both worlds. Revisiting the spymasters double agent problem
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- The price of active security in cryptographic protocols
- Constructing leakage-resilient Shamir's secret sharing: over composite order fields
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
- Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing
- Physical-bit leakage resilience of linear code-based secret sharing
- On achieving ``best-in-the-multiverse MPC
- Leakage-resilience of Shamir's secret sharing: identifying secure evaluation places
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 Q2119012)
