@article{Hudoba_Burcsi_2019, title={Multi Party Computation Motivated by the Birthday Problem}, volume={24}, url={http://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3992}, DOI={10.14232/actacyb.24.1.2019.4}, abstractNote={<p>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.</p>}, number={1}, journal={Acta Cybernetica}, author={Hudoba, Péter and Burcsi, Péter}, year={2019}, month={May}, pages={29-41} }