Login
 Forum
 
 
Thesis topic proposal
 
Attila Kertész
Analysis and Applications of Quantum and Post-Quantum Blockchains

THESIS TOPIC PROPOSAL

Institute: University of Szeged
computer sciences
Doctoral School of Computer Science

Thesis supervisor: Attila Kertész
Location of studies (in Hungarian): SZTE
Abbreviation of location of studies: SZTE


Description of the research topic:

The cryptocurrency application Bitcoin, proposed back in 2009, availed the potential of Blockchain (BC) as a promising technology for hundreds of foundational applications, including Smart Systems, IoT, e-Health, supply chain, digital identity. One of the solid properties of BC is its high security guarantees in classical fully distributed systems. However, the recent advances in the field of Quantum Computing (QC), derived basically from the concepts of quantum mechanics revealed several security risks on BC-based solutions. Many proposals attempted to address these risks by improving BC methods, including infrastructure, data structure, cryptography, networking, etc. targeting the so-called post-quantum blockchains. On the other hand, QC can also be used for the optimization of BC methods and configurations, leading to quantum blockchain principles that can see the light once quantum computers are commercialized. The aim of this research topic is to study and investigate QC aspects and potential for strengthening, attacking, and protecting BC-based solutions. The successful candidate needs a strong background in distributed computing, cryptography, algorithms, abstract mathematics, and probability theory.

Number of students who can be accepted: 2

Deadline for application: 2024-09-15


2024. IV. 17.
ODT ülés
Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).

 
All rights reserved © 2007, Hungarian Doctoral Council. Doctoral Council registration number at commissioner for data protection: 02003/0001. Program version: 2.2358 ( 2017. X. 31. )