Generic constant-round oblivious sorting algorithm for MPC
From MaRDI portal
Recommendations
- Practically efficient multi-party sorting protocols from comparison sort algorithms
- scientific article; zbMATH DE number 2009982
- Low cost constant round MPC combining BMR and oblivious transfer
- Low cost constant round MPC combining BMR and oblivious transfer
- Constant rounds almost linear complexity multi-party computation for prefix sum
Cites work
- A Formal Treatment of Onion Routing
- Asynchronous Multiparty Computation: Theory and Implementation
- Branching Programs and Binary Decision Diagrams
- Evaluating Branching Programs on Encrypted Data
- Fully homomorphic encryption using ideal lattices
- General secure multi-party computation from any linear secret-sharing scheme
- How to share a secret
- scientific article; zbMATH DE number 1820029 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 2009982 (Why is no real title available?)
- scientific article; zbMATH DE number 1497864 (Why is no real title available?)
- Player simulation and general adversary structures in perfect multiparty computation
- Sorting in \(c \log n\) parallel steps
- The periodic balanced sorting network
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Generic constant-round oblivious sorting algorithm for MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092362)