{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T21:02:52Z","timestamp":1746219772033,"version":"3.37.3"},"reference-count":4,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2017,6]]},"abstract":"<jats:p> We offer efficient and practical solutions of Yao\u2019s millionaires\u2019 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. <\/jats:p>","DOI":"10.1142\/s012905411750023x","type":"journal-article","created":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T01:37:56Z","timestamp":1502069876000},"page":"379-389","source":"Crossref","is-referenced-by-count":6,"title":["Yao\u2019s Millionaires\u2019 Problem and Public-Key Encryption Without Computational Assumptions"],"prefix":"10.1142","volume":"28","author":[{"given":"Dima","family":"Grigoriev","sequence":"first","affiliation":[{"name":"CNRS, Math\u00e9matiques, Universit\u00e9 de Lille, 59655, Villeneuve d\u2019Ascq, France"}]},{"given":"Laszlo B.","family":"Kish","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Texas A&amp;M University, College Station, TX 77843, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2239-7996","authenticated-orcid":false,"given":"Vladimir","family":"Shpilrain","sequence":"additional","affiliation":[{"name":"Department of Mathematics, The City College of New York, New York, NY 10031, USA"}]}],"member":"219","published-online":{"date-parts":[[2017,8,6]]},"reference":[{"key":"S012905411750023XBIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24837-0_10"},{"key":"S012905411750023XBIB002","first-page":"253","volume-title":"Designs, Codes and Cryptography","volume":"39","author":"Dijk M.","year":"2006"},{"key":"S012905411750023XBIB003","doi-asserted-by":"publisher","DOI":"10.1515\/gcc-2013-0002"},{"key":"S012905411750023XBIB004","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054114400036"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905411750023X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T09:21:23Z","timestamp":1565083283000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905411750023X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":4,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2017,8,6]]},"published-print":{"date-parts":[[2017,6]]}},"alternative-id":["10.1142\/S012905411750023X"],"URL":"https:\/\/doi.org\/10.1142\/s012905411750023x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2017,6]]}}}