English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Yao’s millionaires’ problem and public-key encryption without computational assumptions

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.

Item is

Files

show Files
hide Files
:
Grigoriev_Yaos millionaires problem_oa_2017.pdf (Any fulltext), 363KB
Name:
Grigoriev_Yaos millionaires problem_oa_2017.pdf
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
eDoc_access: PUBLIC
License:
-

Locators

show

Creators

show
hide
 Creators:
Grigoriev, Dima1, Author           
Kish, Laszlo B., Author
Shpilrain, Vladimir1, Author           
Affiliations:
1Max Planck Institute for Mathematics, Max Planck Society, ou_3029201              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2017
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: International Journal of Foundations of Computer Science
  Alternative Title : Internat. J. Found. Comput. Sci.
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 28 (4) Sequence Number: - Start / End Page: 379 - 389 Identifier: -