Binary AMD circuits from secure multiparty computation
From MaRDI portal
Recommendations
- Circuits resilient to additive attacks with applications to secure computation
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- The price of active security in cryptographic protocols
- Secure Arithmetic Computation with No Honest Majority
Cites work
- scientific article; zbMATH DE number 3586920 (Why is no real title available?)
- Actively secure OT extension with optimal overhead
- Advances in Cryptology - CRYPTO 2003
- Bounded indistinguishability and the complexity of recovering secrets
- Circuits resilient to additive attacks with applications to secure computation
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Cryptography with constant computational overhead
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Founding Cryptography on Oblivious Transfer – Efficiently
- Linear-time encodable and decodable error-correcting codes
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
- Scalable Secure Multiparty Computation
- Theory of Cryptography
Cited in
(12)- Efficient, actively secure MPC with a dishonest majority: a survey
- Oblivious transfer with constant computational overhead
- A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Perfectly secure oblivious parallel RAM
- Round-optimal secure multi-party computation
- Fluid MPC: secure multiparty computation with dynamic participants
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Going beyond dual execution: MPC for functions with efficient verification
- The price of active security in cryptographic protocols
- Circuits resilient to additive attacks with applications to secure computation
- Improved primitives for MPC over mixed arithmetic-binary circuits
This page was built for publication: Binary AMD circuits from secure multiparty computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179363)
