An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption

DOI10.1007/11496137_31zbMath1126.68406OpenAlexW2162538292WikidataQ60358730 ScholiaQ60358730MaRDI QIDQ3593167

Hsiao-Ying Lin, Wen-Guey Tzeng

Publication date: 24 September 2007

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11496137_31

zbMATH Keywords

secure computationthe greater than problemthe socialist millionaires' problem homomorphic encryption

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (9)

Set signatures and their applications ⋮ Secure multi-party computation protocol for sequencing problem ⋮ An efficient top-\(k\) query processing with result integrity verification in two-tiered wireless sensor networks ⋮ Secure \(k\)-skyband computation framework in distributed multi-party databases ⋮ The complete new solutions to the blind millionaires' problem in \(d\)-dimensional quantum system ⋮ Controllable forward secure identity-based encryption with equality test in privacy-preserving text similarity analysis ⋮ Secure computation of the median (and other elements of specified ranks) ⋮ Influence maximization in social networks with privacy protection ⋮ Multi-party quantum privacy comparison of size based on \(d\)-level GHZ states

This page was built for publication: An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption