Asymmetric Commutative Encryption Scheme Based Efficient Solution to the Millionaires' Problem

Meng Liu, Priyadarsi Nanda, Xuyun Zhang, Chi Yang, Shui Yu, Jianxin Li

Research output: Chapter in Book/Conference paperConference paper

Abstract

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 which involves two-party secure computation. Because the efficiency of public key encryption scheme appears less than symmetric encryption scheme, most existing solutions based on public key cryptography to this problem is inefficient. Thus, a solution based on the symmetric encryption scheme has been proposed. Although it is claimed that this approach can be efficient and practical, we discover that there exist several severe security flaws in this solution. In this paper, we analyze the vulnerability of existing solutions, and propose a new scheme based on the Decisional Diffie-Hellman hypothesis (DDH). Our solution also uses two special encodings (0-encoding and 1-encoding) generated by our modified encoding method to reduce the computation cost of modular multiplications. Extensive experiments are conducted to evaluate the efficiency of our solution, and the experimental results show that our solution can be much more efficient and be approximately 8000 times faster than the solution based on symmetric encryption scheme for a 32-bit input and short-term security. Moreover, our solution is also more efficient than the state-of-the-art solution.
Original languageEnglish
Title of host publication2018 17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/ 12th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE)
Place of PublicationUnited States
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages990-995
Number of pages6
ISBN (Print)9781538643884
DOIs
Publication statusPublished - 2018
Event17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications / 12th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE 2018) - New York, United States
Duration: 1 Aug 20183 Aug 2018

Conference

Conference17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications / 12th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE 2018)
CountryUnited States
CityNew York
Period1/08/183/08/18

    Fingerprint

Cite this

Liu, M., Nanda, P., Zhang, X., Yang, C., Yu, S., & Li, J. (2018). Asymmetric Commutative Encryption Scheme Based Efficient Solution to the Millionaires' Problem. In 2018 17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/ 12th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE) (pp. 990-995). United States: IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/TrustCom/BigDataSE.2018.00139