Το πρόβλημα των κρυπτογράφων που δειπνούν
Date Issued
March 18, 2024
Type
Πτυχιακή Εργασία
Abstract
The present thesis was written during the academic year 2023/2024. Its subject concerns the problem of cryptographers dining. This particular problem focuses on the execution of secure multi-party computation. Game theory can help us solve various social and practical problems and contribute as much as possible to the development of more sustainable communities. Through game theory, we also have the ability to project ideas and ideology while simultaneously establishing the fundamental principles that govern human and, more broadly, social behavior. In the era we live in, anonymity is essential for many tasks in maintaining privacy in online communication. High-security communications cannot be achieved solely through secure key distribution. It is often necessary to hide from an adversary sending messages or seeking to extract information from your own messages. Thus, David Chaum developed a method for anonymous message publishing. I chose this topic because I believe that anonymity and privacy have always been and continue to be one of the most important issues in communication. Nowadays, the spectrum of communication is constantly expanding while the boundaries of anonymity and privacy are gradually diminishing. It is particularly important to maintain privacy in the interconnected world we have built. The purpose of this thesis is to provide as spherical and detailed an explanation as possible of the problem, as well as to modify the problem at a quantum level. Equally important, however, is the dissemination of information, understanding of the usefulness, and necessary maintenance of anonymity and privacy. Finally, a new quantum protocol is proposed to solve the classical problem at a quantum level.
Subjects