Post-Quantum Verifiable Oblivious Pseudorandom Functions

This work presents the construction of a post-quantum verifiable oblivious pseudorandom function (VOPRF) with a focus on efficiency and practicality. Leveraging lattice-based cryptographic primitives, particularly the Learning With Errors (LWE) problem, our VOPRF construction aims to address the limitations of existing approaches by reducing proof sizes. The key component in our work is the integration of an efficient zero-knowledge proof of knowledge (ZKPoK) protocol. This ZKPoK is notably more efficient than the proof systems used in prior VOPRF constructions, ensuring the verifiability of PRF outputs while providing smaller proof sizes. Our construction relies on the hardness of the ring-LWE and short integer solution (SIS) problems, and we demonstrate its security in the random oracle model. Overall, our VOPRF construction represents a step towards the development of more practical post-quantum secure cryptographic protocols, highlighting the potential for further improvements in efficiency and real-world applicability.

Name thesis:degree_name

Master

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2024

Author dc:creator

• Propson, Helen

Advisor dc:contributor.advisor

• Vaikuntanathan, Vinod

Statement dc:rights

• Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
• Copyright retained by author(s)

Licence dc:rights.uri

• https://creativecommons.org/licenses/by-nc-nd/4.0/

Handle dc:identifier.uri

https://hdl.handle.net/1721.1/156650

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/156650