Multi party computation motivated by the birthday problem

Hudoba Péter and Burcsi Péter: Multi party computation motivated by the birthday problem. In: Acta cybernetica, (24) 1. pp. 29-41. (2019)

[thumbnail of actacyb_24_1_2019_029_041.pdf]
Cikk, tanulmány, mű

Download (339kB) | Preview


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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2019
Volume: 24
Number: 1
ISSN: 0324-721X
Page Range: pp. 29-41
Language: English
Publisher: University of Szeged, Institute of Informatics
Place of Publication: Szeged
Event Title: Conference of PhD students in computer science (11.) (2018) (Szeged)
Related URLs:
DOI: 10.14232/actacyb.24.1.2019.4
Uncontrolled Keywords: Kriptográfia, Programozás, Számítástechnika
Additional Information: Bibliogr.: p. 40-41. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.01. Mathematics
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2019. Jul. 17. 13:08
Last Modified: 2022. Jun. 21. 09:02

Actions (login required)

View Item View Item