Multi party computation motivated by the birthday problem

Hudoba, Péter and Burcsi, Péter: Multi party computation motivated by the birthday problem. Conference of PhD Students in Computer Science, (11). pp. 138-139. (2018)

[img] Cikk, tanulmány, mű
cscs_2018_151-152.pdf

Download (176kB)

Abstract

The birthday problem is a widely known observation, can be found in most of the textbooks on probability. In this talk we are focusing on the following case of the problem: there are n people in a classroom and we want to decide if there are two people who were born on the same day of the year. During the decision making process, we want to keep all information secret. We consider multiple ways to securely solve the decision problem and compare them by computational and communication aspects.

Item Type: Article
Event Title: Conference of PhD students in computer science (11.) (2018) (Szeged)
Journal or Publication Title: Conference of PhD Students in Computer Science
Date: 2018
Volume: 11
Page Range: pp. 138-139
Uncontrolled Keywords: Számítástechnika, Valószínűségszámítás
Additional Information: Bibliogr.: p. 138-139. ; összefoglalás angol nyelven
Date Deposited: 2019. Nov. 04. 13:41
Last Modified: 2019. Nov. 04. 13:41
URI: http://acta.bibl.u-szeged.hu/id/eprint/61786

Actions (login required)

View Item View Item