Paper 2015/376

Cryptography from Post-Quantum Assumptions

Raza Ali Kazmi

Abstract

In this thesis we present our contribution in the field of post-quantum cryptography. We introduce a new notion of {\em weakly Random-Self-Reducible} public-key cryptosystem and show how it can be used to implement secure Oblivious Transfer. We also show that two recent (Post-quantum) cryptosystems can be considered as {\em weakly Random-Self-Reducible}. We introduce a new problem called Isometric Lattice Problem and reduce graph isomorphism and linear code equivalence to this problem. We also show that this problem has a perfect zero-knowledge interactive proof with respect to a malicious verifier; this is the only hard problem in lattices that is known to have this property.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
Contact author(s)
raza-ali kazmi @ mail mcgill ca
History
2015-04-24: received
Short URL
https://ia.cr/2015/376
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/376,
      author = {Raza Ali Kazmi},
      title = {Cryptography from Post-Quantum Assumptions},
      howpublished = {Cryptology ePrint Archive, Paper 2015/376},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/376}},
      url = {https://eprint.iacr.org/2015/376}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.