\textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s
From MaRDI portal
Publication:6164395
DOI10.1007/978-3-031-20974-1_3zbMath1524.68141MaRDI QIDQ6164395
Victor Sucasas, Abdelrahaman Aly, Kashif Nawaz, Eugenio Salazar
Publication date: 28 July 2023
Published in: Cryptology and Network Security (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Privacy of data (68P27)
Cites Work
- Overdrive: making SPDZ great again
- Security and composition of multiparty cryptographic protocols
- Improved primitives for MPC over mixed arithmetic-binary circuits
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
- Private liquidity matching using MPC
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Error detection in monotone span programs with application to communication-efficient multi-party computation
- EPIC: efficient private image classification (or: learning from the masters)
- Benchmarking privacy preserving scientific operations
- Practically efficient secure distributed exponentiation without bit-decomposition
- Improved Primitives for Secure Multiparty Integer Computation
- Secure Equality and Greater-Than Tests with Sublinear Online Complexity
- Advances in Cryptology - CRYPTO 2003
- Theory of Cryptography
- Low cost constant round MPC combining BMR and oblivious transfer
This page was built for publication: \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s
