Welcome to the resource topic for 2016/189
Title:
Yao’s millionaires’ problem and public-key encryption without computational assumptions
Authors: Dima Grigoriev, Laszlo B. Kish, Vladimir Shpilrain
Abstract: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. One of our solutions (based on physical principles) yields a public-key encryption protocol secure against (passive) computationally unbounded adversary. In that protocol, the legitimate parties are not assumed to be computationally unbounded.
ePrint: https://eprint.iacr.org/2016/189
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .