Cryptography with spacetime constraints

Abstract : In this thesis we have studied how to exploit relativistic constraints such as the non-superluminal signalling principle to design secure cryptographic primitives like position-verification and bit commitment. According to non-superluminal signalling principle, no physical carrier of information can travel faster than the speed of light. This put a constraint on the communication time between two distant stations. One can consider this delay in information transfer as a temporal non-communication constraint. Cryptographic primitives like bit-commitment, oblivious transfer can be implemented with perfect secrecy under such non-communication assumption between the agents. The first part of this thesis has studied how non-signalling constraints can be used for secure position verification. Here, we have discussed about a strategy which can attack any position verification scheme. In the next part of this thesis we have discussed about the nonlocal games, relevant for studying relativistic bit commitment protocols. We have established an upper bound on the classical value of such family of games. The last part of this thesis discusses about two relativistic bit commitment protocols and their security against classical adversaries. We conclude this thesis by giving a brief summary of the content of each chapter and mentioning interesting open problems. These open problems can be very useful for better understanding of the role of spacetime constraints such as non-superluminal signalling in designing perfectly secure cryptographic primitives.
Document type :
Complete list of metadatas

Cited literature [99 references]  Display  Hide  Download
Contributor : Abes Star <>
Submitted on : Thursday, February 8, 2018 - 9:34:07 AM
Last modification on : Thursday, February 7, 2019 - 1:32:22 AM
Long-term archiving on: Thursday, May 3, 2018 - 3:17:06 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01637818, version 2


Kaushik Chakraborty. Cryptography with spacetime constraints. Cryptography and Security [cs.CR]. Université Pierre et Marie Curie - Paris VI, 2017. English. ⟨NNT : 2017PA066194⟩. ⟨tel-01637818v2⟩



Record views


Files downloads