Hudoba Péter and Burcsi Péter: Multi party computation motivated by the birthday problem.
Preview |
Cikk, tanulmány, mű
cscs_2018_151-152.pdf Download (176kB) | Preview |
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: | Conference or Workshop Item |
|---|---|
| Journal or Publication Title: | Conference of PhD Students in Computer Science |
| Date: | 2018 |
| Volume: | 11 |
| Page Range: | pp. 138-139 |
| Event Title: | Conference of PhD students in computer science (11.) (2018) (Szeged) |
| Related URLs: | http://acta.bibl.u-szeged.hu/59477/ |
| 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: | 2022. Nov. 08. 10:18 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/61786 |
Actions (login required)
 |
View Item |
