Multi party computation motivated by the birthday problem

Suppose there are n people in a classroom and we want to decide if there are two of them who were born on the same day of the year. The wellknown birthday paradox is concerned with the probability of this event and is discussed in many textbooks on probability. In this paper we focus on cryptographi...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Hudoba Péter
Burcsi Péter
Testületi szerző: Conference of PhD students in computer science (11.) (2018) (Szeged)
Dokumentumtípus: Cikk
Megjelent: University of Szeged, Institute of Informatics Szeged 2019
Sorozat:Acta cybernetica 24 No. 1
Kulcsszavak:Kriptográfia, Programozás, Számítástechnika
Tárgyszavak:
doi:10.14232/actacyb.24.1.2019.4

Online Access:http://acta.bibl.u-szeged.hu/59226
Leíró adatok
Tartalmi kivonat:Suppose there are n people in a classroom and we want to decide if there are two of them who were born on the same day of the year. The wellknown birthday paradox is concerned with the probability of this event and is discussed in many textbooks on probability. In this paper we focus on cryptographic aspects of the problem: how can we decide if there is a collision of birthdays without the participants disclosing their respective date of birth. We propose several procedures for solving this generally in a privacypreserving way and compare them according to their computational and communication complexity.
Terjedelem/Fizikai jellemzők:29-41
ISSN:0324-721X