Uncloneable Quantum Encryption via Random Oracles

FieldValue
dc.contributor.authorLord, Sébastien
dc.date.accessioned2019-02-27T21:17:53Z
dc.date.available2019-02-27T21:17:53Z
dc.date.issued2019-02-27
dc.identifier.urihttp://hdl.handle.net/10393/38855
dc.identifier.urihttp://dx.doi.org/10.20381/ruor-23107
dc.description.abstractOne of the key distinctions between classical and quantum information is given by the no-cloning theorem: unlike bits, arbitrary qubits cannot be perfectly copied. This fact has been the inspiration for many quantum cryptographic protocols. In this thesis, we introduce a new cryptographic functionality called uncloneable encryption. This functionality allows the encryption of a classical message such that two collaborating but non-communicating adversaries may not both simultaneously recover the message, even when the encryption key is revealed. We achieve this functionality by using Wiesner’s conjugate coding scheme to encrypt the message. We show that the adversaries cannot both obtain all the necessary information for the correct decryption with high probability. Quantum-secure pseudorandom functions, modelled as random oracles, are then used to ensure that any partial information that the adversaries obtain does not give them an advantage in recovering the message.
dc.language.isoen
dc.publisherUniversité d'Ottawa / University of Ottawa
dc.subjectQuantum Cryptography
dc.titleUncloneable Quantum Encryption via Random Oracles
dc.typeThesis
dc.contributor.supervisorBroadbent, Anne
thesis.degree.nameMSc
thesis.degree.levelMasters
thesis.degree.disciplineSciences / Science
uottawa.departmentMathématiques et statistique / Mathematics and Statistics
CollectionThèses, 2011 - // Theses, 2011 -

Files