Please use this identifier to cite or link to this item:
DC FieldValue
dc.contributor.authorJEDRZEJ KANIEWSKI
dc.identifier.citationJEDRZEJ KANIEWSKI (2015-12-14). RELATIVISTIC QUANTUM CRYPTOGRAPHY. ScholarBank@NUS Repository.
dc.description.abstractIn this thesis we explore the benefits of relativistic constraints for cryptography. We first revisit non-communicating models and its applications in the context of interactive proofs and cryptography. We propose bit commitment protocols whose security hinges on communication constraints and investigate its limitations. We explain how some non-communicating models can be justified by special relativity and study the limitations of such models. In particular, we present a framework for analysing security of multiround relativistic protocols. The second part of the thesis is dedicated to analysing specific protocols. We start by considering a recently proposed two-round quantum bit commitment protocol. We propose a fault-tolerant variant of the protocol, present a complete security analysis and report on an experimental implementation performed in collaboration with an experimental group at the University of Geneva. We also propose a new, multiround classical bit commitment protocol and prove its security against classical adversaries. This demonstrates that in the classical world an arbitrarily long commitment can be achieved even if the agents are restricted to occupy a finite region of space. Moreover, the protocol is easy to implement and we report on an experiment performed in collaboration with the Geneva group.
dc.subjectquantum cryptography, quantum information, relativistic cryptography
dc.contributor.departmentCENTRE FOR QUANTUM TECHNOLOGIES
dc.contributor.supervisorSTEPHANIE WEHNER
dc.description.degreeconferredDOCTOR OF PHILOSOPHY
Appears in Collections:Ph.D Theses (Open)

Show simple item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
KaniewskiJ.pdf2.38 MBAdobe PDF



Page view(s)

checked on Aug 16, 2019


checked on Aug 16, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.