Secure multi-party computation protocol for sequencing problem
From MaRDI portal
Recommendations
- Efficient secure multiparty computation protocol for sequencing problem over insecure channel
- Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion
- A secure multi-party computation protocol for the sorting problem
- scientific article; zbMATH DE number 1583776
- scientific article; zbMATH DE number 1952886
Cites work
- A proof of security of Yao's protocol for two-party computation
- An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption
- General secure multi-party computation from any linear secret-sharing scheme
- How to share a secret
- scientific article; zbMATH DE number 1617945 (Why is no real title available?)
- scientific article; zbMATH DE number 2112427 (Why is no real title available?)
- Practical Two-Party Computation Based on the Conditional Gate
- Strong Conditional Oblivious Transfer and Computing on Intervals
Cited in
(4)- Finding the maximal adversary structure from any given access structure
- Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion
- Securely solving classical network flow problems
- Efficient secure multiparty computation protocol for sequencing problem over insecure channel
This page was built for publication: Secure multi-party computation protocol for sequencing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q350932)
