Efficient solution to the millionaires' problem based on asymmetric commutative encryption scheme
Secure multiparty computation is an important scheme in cryptography and can be applied
in various real‐life problems. The first secure multiparty computation problem is the …
in various real‐life problems. The first secure multiparty computation problem is the …
Efficient solution to the millionaires' problem based on asymmetric commutative encryption scheme
M Liu, Y Luo, P Nanda, S Yu… - Computational …, 2019 - opus.lib.uts.edu.au
© 2019 Wiley Periodicals, Inc. Secure multiparty computation is an important scheme in
cryptography and can be applied in various real-life problems. The first secure multiparty …
cryptography and can be applied in various real-life problems. The first secure multiparty …
Efficient solution to the millionaires' problem based on asymmetric commutative encryption scheme.
M Liu, Y Luo, P Nanda, S Yu… - Computational …, 2019 - search.ebscohost.com
Secure multiparty computation is an important scheme in cryptography and can be applied
in various real‐life problems. The first secure multiparty computation problem is the …
in various real‐life problems. The first secure multiparty computation problem is the …
[PDF][PDF] Efficient Solution to the Millionaires' Problem Based on Asymmetric Commutative Encryption Scheme
M Liu, Y Luo, P Nanda, S Yu - opus.lib.uts.edu.au
Secure multiparty computation (SMC) is an important scheme in cryptography and can be
applied in various real-life problems. The first SMC problem is the millionaires' problem, and …
applied in various real-life problems. The first SMC problem is the millionaires' problem, and …