Yao’s millionaires’ problem and public-key encryption without computational 
assumptions

Grigoriev, Dima; Kish, Laszlo B.; Shpilrain, Vladimir

doi:10.1142/S012905411750023X

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Yao’s millionaires’ problem and public-key encryption without computational assumptions

MPS-Authors

/persons/resource/persons235358

Grigoriev, Dima
Max Planck Institute for Mathematics, Max Planck Society;

/persons/resource/persons236204

Shpilrain, Vladimir
Max Planck Institute for Mathematics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

Grigoriev_Yaos millionaires problem_oa_2017.pdf
(Any fulltext), 363KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Grigoriev, D., Kish, L. B., & Shpilrain, V. (2017). Yao’s millionaires’ problem and public-key encryption without computational assumptions. International Journal of Foundations of Computer Science, 28(4), 379-389. doi:10.1142/S012905411750023X.

Cite as: https://hdl.handle.net/21.11116/0000-0004-0BE2-1

Abstract

There is no abstract available