Die folgenden Links führen aus den jeweiligen lokalen Bibliotheken zum Volltext:
Alternativ können Sie versuchen, selbst über Ihren lokalen Bibliothekskatalog auf das gewünschte Dokument zuzugreifen.
Bei Zugriffsproblemen kontaktieren Sie uns gern.
4790 Ergebnisse
Sortierung:
In: Voprosy filosofii: naučno-teoretičeskij žurnal, Heft 12, S. 129-132
In: Latin American research review: LARR ; the journal of the Latin American Studies Association (LASA), Band 11, Heft 1, S. 75
ISSN: 0023-8791
In: Social history, Band 12, Heft 2, S. 237-240
ISSN: 1470-1200
In: Bulletin of peace proposals: to motivate research, to inspire future oriented thinking, to promote activities for peace, Band 12, Heft 1, S. 84-100
ISSN: 2516-9181
SSRN
In: Zeitschrift für kritische Sozialtheorie und Philosophie, Band 3, Heft 1
ISSN: 2194-5640
In: IEEE Antennas and Propagation Society Newsletter, Band 23, Heft 3, S. 4-10
ISSN: 2168-0329
In: Survey review, Band 7, Heft 49, S. 129-134
ISSN: 1752-2706
In: Journal of economic dynamics & control, Band 22, Heft 8-9, S. 1169-1186
ISSN: 0165-1889
In: Synthese: an international journal for epistemology, methodology and philosophy of science, Band 108, Heft 3, S. 335-359
ISSN: 1573-0964
In: Social history, Band 9, Heft 3, S. 411-416
ISSN: 1470-1200
We consider interactive computation of randomized functions between two users with the following privacy requirement: the interaction should not reveal to either user any extra information about the other user's input and output other than what can be inferred from the user's own input and output. We also consider the case where privacy is required against only one of the users. For both cases, we give single-letter expressions for feasibility and optimal rates of communication. Then we discuss the role of common randomness and interaction in both privacy settings. We also study perfectly secure non-interactive computation when only one of the users computes a randomized function based on a single transmission from the other user. We characterize randomized functions which can be perfectly securely computed in this model and obtain tight bounds on the optimal message lengths in all the privacy settings. ; This work was supported by the Department of Atomic Energy, Government of India, under Project 12-R&D-TFR-5.01-0500. The work of Deepesh Data was supported by a Microsoft Research India Ph.D. Fellowship. The work of Gowtham R. Kurri was supported in part by a Travel Fellowship from the Sarojini Damodaran Foundation and in part by the Department of Science and Technology, Government of India, under an Indo-Israel Grant DST/INT/ISR/P-16/2017. The work of Jithin Ravi was supported by the European Research Council (ERC) through the European Union's Horizon 2020 Research and Innovation Programme under Grant 714161. The work of Vinod M. Prabhakaran was supported in part by a Ramanujan Fellowship from the Department of Science and Technology, Government of India, in part by the Information Technology Research Academy (ITRA), Government of India, under ITRA Mobile Grant ITRA/15(64)/Mobile/USEAADWN/01, and in part by the Department of Science and Technology, Government of India, under an Indo-Israel Grant DST/INT/ISR/P-16/2017.
BASE