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 lim...
| Päätekijä: | |
|---|---|
| Muut tekijät: | |
| Aineistotyyppi: | Opinnäyte |
| Julkaistu: |
Massachusetts Institute of Technology
2024
|
| Linkit: | https://hdl.handle.net/1721.1/156650 |