TY - JOUR AU - Péter Hudoba AU - Péter Burcsi PY - 2019/05/21 Y2 - 2024/03/29 TI - Multi Party Computation Motivated by the Birthday Problem JF - Acta Cybernetica JA - Acta Cybern VL - 24 IS - 1 SE - Special Issue of the 11th Conference of PhD Students in Computer Science DO - 10.14232/actacyb.24.1.2019.4 UR - https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3992 AB - 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 well-known 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 in a privacy-preserving way and compare them according to their computational and communication complexity. ER -