Rabbit : efficient comparison for secure multi-party computation
From MaRDI portal
Publication:2145391
DOI10.1007/978-3-662-64322-8_12OpenAlexW3209723788MaRDI QIDQ2145391FDOQ2145391
Authors: Eleftheria Makri, Dragos Rotaru, Frederik Vercauteren, Sameer Wagh 
Publication date: 17 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-662-64322-8_12
Recommendations
- New protocols for secure equality test and comparison
- Secure equality and greater-than tests with sublinear online complexity
- Sub-linear, secure comparison with two non-colluding parties
- Practical and Secure Solutions for Integer Comparison
- Communication-efficient (client-aided) secure two-party protocols and its application
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer system organization (68Mxx)
Cites Work
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Multiparty Computation from Somewhat Homomorphic Encryption
- Semi-homomorphic encryption and multiparty computation
- Secure multiparty computation goes live
- Probabilistically correct secure arithmetic computation for modular conversion, zero test, comparison, MOD and exponentiation
- Advances in Cryptology - CRYPTO 2003
- A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation
- Sub-linear, secure comparison with two non-colluding parties
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Improved primitives for secure multiparty integer computation
- Theory of Cryptography
- New protocols for secure equality test and comparison
- Actively secure setup for SPDZ
- Maliciously secure matrix multiplication with applications to private deep learning
- Solving Linear Programs Using Multiparty Computation
- Secure equality and greater-than tests with sublinear online complexity
Cited In (4)
- Privacy preserving solution of DCOPs by mediation
- \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
- A new approach to efficient and secure fixed-point computation
Uses Software
This page was built for publication: \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2145391)
