Yao's Millionaires' Problem and Public-Key Encryption Without Computational Assumptions Academic Article

abstract

• We offer efficient and practical solutions of Yaos 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.

authors

• Kish, Laszlo

published proceedings

• INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE

author list (cited authors)

• Grigoriev, D., Kish, L. B., & Shpilrain, V.

citation count

• 5

complete list of authors

• Grigoriev, Dima||Kish, Laszlo B||Shpilrain, Vladimir

publication date

• June 2017

publisher

• World Scientific Publishing  Publisher

published in

• International Journal of Foundations of Computer Science  Journal

keywords

• Encryption Based On Physical Principles
• Millionaires'problem
• Public-key Encryption
• Without Computational Assumptions

Digital Object Identifier (DOI)

• 10.1142/S012905411750023X

start page

• 379

end page

• 389

volume

• 28

issue

• 4

URL

• http://dx.doi.org/10.1142/s012905411750023x