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.展开更多
In this paper, a protocol for quantum millionaire problem with continuous variables is proposed. In the protocol, two participants can compare the values of their fortune with the assistance of a semi-trusted third pa...In this paper, a protocol for quantum millionaire problem with continuous variables is proposed. In the protocol, two participants can compare the values of their fortune with the assistance of a semi-trusted third party(STTP). Only EPR states are exploited in our protocol while most other protocols exploited d-dimensional Bell states.Two participants are just required to perform single particle operations, which makes our protocol more efficiently. Our protocol can ensure fairness, correctness, security and high efficiency as well. In our protocol, only the two participants can deduce the results of comparisons, others include STTP will learn no information. Our protocol can resist various kinds of attacks from both the outside eavesdroppers and the inside participants, even the STTP.展开更多
China should soon see its largest group of instant millionaires after Jack Ma,Chief Executive Officer and Chairman of Alibaba Group,announced on July 27 that the China’s preeminent e-commerce company has initiated th...China should soon see its largest group of instant millionaires after Jack Ma,Chief Executive Officer and Chairman of Alibaba Group,announced on July 27 that the China’s preeminent e-commerce company has initiated the listing of its B2B unit alibaba.展开更多
ZHANG Can is a young woman who likes to laugh. She is also the founder of a business kingdom worth 400 million yuan. Certainly, there were points in her career that were no laughing matter, but now she is general mana...ZHANG Can is a young woman who likes to laugh. She is also the founder of a business kingdom worth 400 million yuan. Certainly, there were points in her career that were no laughing matter, but now she is general manager of Beijing Dyne Group Corporation. "She’s simply amazing—beyond description," say her friends.展开更多
Secure Multi-party Computation has been a research focus in international cryptographic community in recent years. In this paper the authors investigate how some computational geometric problems could be solved in a c...Secure Multi-party Computation has been a research focus in international cryptographic community in recent years. In this paper the authors investigate how some computational geometric problems could be solved in a cooperative environment, where two parties need to solve a geometric problem based on their joint data, but neither wants to disclose its private data to the other party. These problems are the distance between two private points, the relation between a private point and a circle area, the relation between a private point and an ellipse area and the shortest distance between two point sets. The paper gives solutions to these specific geometric. problems, and in doing so a building block is developed, the protocol for the distance between two private points, that is also useful in the solutions to other geometric problems and combinatorial problems.展开更多
基金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.
基金Supported by the National Natural Science Foundation of China under Grant Nos.61170270,61003290,61170221,61100205the Specialized Research Fund for the Doctoral Program of Higher Education under Grant Nos.20091103120014,20090005110010+1 种基金Beijing Natural Science Foundation under Grant No.4122008the ISN open Foundation
文摘In this paper, a protocol for quantum millionaire problem with continuous variables is proposed. In the protocol, two participants can compare the values of their fortune with the assistance of a semi-trusted third party(STTP). Only EPR states are exploited in our protocol while most other protocols exploited d-dimensional Bell states.Two participants are just required to perform single particle operations, which makes our protocol more efficiently. Our protocol can ensure fairness, correctness, security and high efficiency as well. In our protocol, only the two participants can deduce the results of comparisons, others include STTP will learn no information. Our protocol can resist various kinds of attacks from both the outside eavesdroppers and the inside participants, even the STTP.
文摘China should soon see its largest group of instant millionaires after Jack Ma,Chief Executive Officer and Chairman of Alibaba Group,announced on July 27 that the China’s preeminent e-commerce company has initiated the listing of its B2B unit alibaba.
文摘ZHANG Can is a young woman who likes to laugh. She is also the founder of a business kingdom worth 400 million yuan. Certainly, there were points in her career that were no laughing matter, but now she is general manager of Beijing Dyne Group Corporation. "She’s simply amazing—beyond description," say her friends.
文摘Secure Multi-party Computation has been a research focus in international cryptographic community in recent years. In this paper the authors investigate how some computational geometric problems could be solved in a cooperative environment, where two parties need to solve a geometric problem based on their joint data, but neither wants to disclose its private data to the other party. These problems are the distance between two private points, the relation between a private point and a circle area, the relation between a private point and an ellipse area and the shortest distance between two point sets. The paper gives solutions to these specific geometric. problems, and in doing so a building block is developed, the protocol for the distance between two private points, that is also useful in the solutions to other geometric problems and combinatorial problems.
