An efficient solution to generalized Yao's millionaires problem

MaRDI QIDQ372703zbMATH OpenFDO

Authors Sheng Zhong, Yuan Zhang

Publication date 21 October 2013

Published in Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.bbms/1378314507

zbMATH Keywords

privacy-preservingsecure comparisonYao's millionaires problem

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Symmetric cryptographic protocols for extended millionaires' problem
• A fair and efficient solution to the socialist millionaires' problem
• Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations
• Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion
• Practical and Secure Solutions for Integer Comparison

Cited in

(6)

• Probabilistic solution of Yao's millionaires' problem
• Symmetric cryptographic protocols for extended millionaires' problem
• Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations
• An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption
• An Efficient and Verifiable Solution to the Millionaire Problem
• A fair and efficient solution to the socialist millionaires' problem

This page was built for publication: An efficient solution to generalized Yao's millionaires problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q372703)