Yao’s millionaires’ problem is a fundamental problem in secure multiparty computation, and its solutions have become building blocks of many secure multiparty computation solutions.Unfortunately, most protocols for ...Yao’s millionaires’ problem is a fundamental problem in secure multiparty computation, and its solutions have become building blocks of many secure multiparty computation solutions.Unfortunately, most protocols for millionaires’ problem are constructed based on public cryptography, and thus are inefficient.Furthermore, all protocols are designed to solve the basic millionaires’ problem, that is, to privately determine which of two natural numbers is greater.If the numbers are real, existing solutions do not directly work.These features limit the extensive application of the existing protocols.This study introduces and refines the first symmetric cryptographic protocol for the basic millionaires’ problem, and then extends the symmetric cryptographic protocol to privately determining which of two real numbers is greater, which are called the extended millionaires’ problem, and proposes corresponding protocols.We further prove, by a well accepted simulation paradigm, that these protocols are private.Constructed based on symmetric cryptography, these protocols are very efficient.展开更多
为提高三维空间两平行直线间距离协议的计算效率,基于安全两实数和平方(secure square of two real numbers sum,SSTS)计算协议与Paillier同态加密算法(Paillier homomorphic encryption algorithm,PHEA)分别提出了三维空间两平行直线...为提高三维空间两平行直线间距离协议的计算效率,基于安全两实数和平方(secure square of two real numbers sum,SSTS)计算协议与Paillier同态加密算法(Paillier homomorphic encryption algorithm,PHEA)分别提出了三维空间两平行直线间的距离计算协议。SSTS协议利用空间任一点到直线的距离推导出三维空间两平行直线间的距离,通过安全两实数和平方计算协议构造辅助数据来隐藏自己的具体数据;PHEA协议通过Paillier同态加密算法将自己直线方程的系数隐藏,能与对方进行交流计算,但不会泄露自己的具体数据;两个协议均能保密地计算出三维空间两平行直线间的距离。分别证明了两个协议的正确性,并利用模拟范例证明了两个协议的安全性。最后,对SSTS协议和PHEA协议与现有协议进行比较分析,结果表明,新协议有较低的计算复杂性和通信复杂性,比现有协议至少降低了50%。展开更多
基金Supported by the National Natural Science Foundation of China (Grant Nos 60673065, 60873249)
文摘Yao’s millionaires’ problem is a fundamental problem in secure multiparty computation, and its solutions have become building blocks of many secure multiparty computation solutions.Unfortunately, most protocols for millionaires’ problem are constructed based on public cryptography, and thus are inefficient.Furthermore, all protocols are designed to solve the basic millionaires’ problem, that is, to privately determine which of two natural numbers is greater.If the numbers are real, existing solutions do not directly work.These features limit the extensive application of the existing protocols.This study introduces and refines the first symmetric cryptographic protocol for the basic millionaires’ problem, and then extends the symmetric cryptographic protocol to privately determining which of two real numbers is greater, which are called the extended millionaires’ problem, and proposes corresponding protocols.We further prove, by a well accepted simulation paradigm, that these protocols are private.Constructed based on symmetric cryptography, these protocols are very efficient.
文摘为提高三维空间两平行直线间距离协议的计算效率,基于安全两实数和平方(secure square of two real numbers sum,SSTS)计算协议与Paillier同态加密算法(Paillier homomorphic encryption algorithm,PHEA)分别提出了三维空间两平行直线间的距离计算协议。SSTS协议利用空间任一点到直线的距离推导出三维空间两平行直线间的距离,通过安全两实数和平方计算协议构造辅助数据来隐藏自己的具体数据;PHEA协议通过Paillier同态加密算法将自己直线方程的系数隐藏,能与对方进行交流计算,但不会泄露自己的具体数据;两个协议均能保密地计算出三维空间两平行直线间的距离。分别证明了两个协议的正确性,并利用模拟范例证明了两个协议的安全性。最后,对SSTS协议和PHEA协议与现有协议进行比较分析,结果表明,新协议有较低的计算复杂性和通信复杂性,比现有协议至少降低了50%。
