Device Independent Quantum Cryptography for Finite Samples.

Date of Submission

December 2017

Date of Award

Winter 12-12-2018

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Applied Statistics Unit (ASU-Kolkata)


Maitra, Subhamoy (ASU-Kolkata; ISI)

Abstract (Summary of the Work)

Quantum cryptography promises levels of security that are impossible to replicate in classical world. In all the initial quantum cryptographic protocols, the involving parties trust the measurement devices involved in the protocol.Later it is shown that the security of the protocol can’t be guaranteed when the quantum devices on which the protocol relies are untrusted. This invents the concept of device independent protocols which implies that the security does not rely on trusting that the quantum devices used are truthful. The aim of the device independent approach to cryptography is to do away with this trustful assumption, and, consequently, significantly increase security.With this aim, several device independent quantum cryptographic protocols are proposed till now. All these existing device independent schemes are perfectly alright for asymptotic limit only. However, none of these protocols have analyzed the scheme for finite sample size i.e all the existing device independent protocols are theoretically correct but none of these are practically implementable.In this thesis, we overcome this shortcomings by upgrading the existing device independent quantum cryptographic protocols for finite samples. The modified protocols provide an estimation of the sample size in an optimal way. Due to finite sample size, we have to allow some information leakage to the adversary. However, by fixing the accuracy parameter appropriately for all the protocols, we show that the adversary can’t perform any fruitful attack due to this information leakage.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.