返回
Secure Comparison Under Ideal/Real Simulation Paradigm
DOI:10.1109/ACCESS.2018.2837665.png)
摘要
En 中文
Secure comparison problem, also known as Yao's Millionaires' problem, was introduced by Andrew Yao in 1982. It is a fundamental problem in secure multi-party computation. In this problem, two millionaires are interested in determining the richer one between them without revealing their actual wealth. Yao's millionaires' problem is a classic and fundamental problem in cryptography. The design of secure and efficient solutions to this problem provides effective building blocks for secure multi-party computation. However, only a few of the solutions in the literature have succeeded in resisting attacks of malicious adversaries, and none of these solutions has been proven secure in malicious model under ideal/real simulation paradigm. In this paper, we propose two secure solutions to Yao's millionaires' problem in the malicious model. One solution has full simulation security, and the other solution achieves one-sided simulation security. Both protocols are only based on symmetric cryptography. Experimental results indicate that our protocols can securely solve Yao's millionaires' problem with high efficiency and scalability. Furthermore, our solutions show better performance than the state-of-the-art solutions in terms of complexity and security. Specifically, our solutions only require O(vertical bar U vertical bar) symmetric operations at most to achieve simulation-based security against malicious adversaries, where U denotes the universal set and vertical bar U vertical bar denotes the size of U.
Keyword:
Ideal/real simulation paradigm
malicious model
secure comparison
secure multi-party computation
simulation-based security
Yao's millionaires' problem
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Coproduction of a Theory-Based Digital Resource for Unpaid Carers (The Care Companion): Mixed-Methods Study
JMIR Aging
IF0

