Multi party computation motivated by the birthday problem
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. Duri...
Elmentve itt :
| Szerzők: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Könyv része |
| Megjelent: |
2018
|
| Sorozat: | Conference of PhD Students in Computer Science
11 |
| Kulcsszavak: | Számítástechnika, Valószínűségszámítás |
| Online Access: | http://acta.bibl.u-szeged.hu/61786 |
| Tartalmi kivonat: | 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. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 138-139 |