Practical Privacy-Preserving Post-Quantum Cryptographic Protocols

Primary supervisor

Ron Steinfeld

Since the 1990s, researchers have known that commonly-used public-key cryptosystems (such as RSA and Diffie-Hellman systems) could be potentially broken using efficient algorithms running on a special type of computer based on the principles of quantum mechanics, known as a quantum computer. Due to significant recent advances in quantum computing technology, this threat may become a practical reality in the coming years. To mitigate against this threat, new `post-quantum’ (a.k.a. `quantum-resistant’) algorithm standards for public-key cryptography are in development [1], that are believed to be resistant against quantum computing attacks.

 

Aim/outline

This project aims to investigate aspects of design and security analysis of practical privacy-preserving post-quantum cryptographic protocols for various application scenarios. The aim is to build on recent progress (e.g. [2,3,4,5]) in techniques for practical post-quantum zero-knowledge proof protocols to investigate the design of improved post-quantum protocols for applications such as privacy-preserving blockchain cryptocurrencies, private credentials, or other applications. 

 

URLs/references

[1] National Institute of Standards and Technology (NIST) Post Quantum Cryptography (PQC) Standardisation project. https://csrc.nist.gov/projects/post-quantum-cryptography

[2] M.F. Esgin, R. Steinfeld, J.K. Liu, and D. Liu. Lattice-based zero-knowledge proofs: New techniques for shorter and faster constructions and applications. In CRYPTO 2019, pages 115–146, 2019. https://eprint.iacr.org/2019/445

[3] M.F. Esgin, R.K. Zhao, R. Steinfeld, J.K. Liu, and D. Liu. MatriCT: Efficient, scalable and post-quantum blockchain confidential transactions protocol. In ACM CCS, pages 567–584, 2019. https://eprint.iacr.org/2019/1287

[4] T. Attema and V. Lyubashevsky and G. Seiler. Practical Product Proofs for Lattice Commitments. In CRYPTO 2020.  https://eprint.iacr.org/2020/517

[5] M.F. Esgin and N.K. Nguyen and G. Seiler. Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings. https://eprint.iacr.org/2020/518

Required knowledge

Depending on the nature of the specific project topic selected, the student should have:

  • Good mathematical skills, 
  • Familiarity with the basics of cryptography, and preferably taking unit FIT5124 (Advanced Topics in Security).

If in doubt, please contact the primary supervisor for advice.