搜索结果: 1-5 共查到“军事学 Millionaires Problem”相关记录5条 . 查询时间(0.062 秒)
We offer a probabilistic solution of Yao's millionaires' problem that gives correct answer with probability (slightly) less than 1 but on the positive side, this solution does not use any one-way func...
Yao's millionaires' problem and public-key encryption without computational assumptions
Yao's millionaires' problem computationally unbounded adversary
2016/2/24
We offer efficient and practical solutions of Yao's millionaires' problem without using any one-way functions. Some of the solutions involve physical principles, while others are purely mathematical. ...
Yao's millionaires' problem and decoy-based public key encryption by classical physics
Yao's millionaires' problem decoy-based cryptography computationally unbounded adversary
2016/1/9
We use various laws of classical physics to offer several solutions
of Yao’s millionaires’ problem without using any one-way functions.
We also describe several informationally secure public key enc...
Improvement of Lin-Tzeng Solution to Yao's Millionaires Problem and Its Cheating Advantage Analysis
Semi-honest assumption Exponentially lifting transform
2014/3/5
In 2005, Lin and Tzeng proposed a solution to Yao's Millionaires problem in the setting of semi-honest parties. At the end of the protocol only the party (Alice) who is responsible for setting up the ...
An Efficient Solution to The Millionaires’ Problem Based on Homomorphic Encryption
secure computation homomorphic encryption the socialist millionaires’problem
2009/1/15
We proposed a two-round protocol for solving the Millionaires’ Problem
in the setting of semi-honest parties. Our protocol uses either multiplicative or
additive homomorphic encryptions. Previously ...