Binary AMD Circuits from Secure Multiparty Computation
From MaRDI portal
Publication:3179363
DOI10.1007/978-3-662-53641-4_14zbMath1406.94057OpenAlexW2536771734MaRDI QIDQ3179363
Mor Weiss, Daniel Genkin, Yuval Ishai
Publication date: 21 December 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53641-4_14
Related Items (8)
Fluid MPC: secure multiparty computation with dynamic participants ⋮ Perfectly secure oblivious parallel RAM ⋮ Oblivious transfer with constant computational overhead ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Round-optimal secure multi-party computation ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ Improved primitives for MPC over mixed arithmetic-binary circuits ⋮ The price of active security in cryptographic protocols
Cites Work
- Unnamed Item
- Unnamed Item
- Bounded Indistinguishability and the Complexity of Recovering Secrets
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Linear-time encodable and decodable error-correcting codes
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
- Actively Secure OT Extension with Optimal Overhead
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- Circuits resilient to additive attacks with applications to secure computation
- Advances in Cryptology - CRYPTO 2003
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Theory of Cryptography
- Scalable Secure Multiparty Computation
- Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
This page was built for publication: Binary AMD Circuits from Secure Multiparty Computation
