Pseudorandom Correlation Functions (PCFs) allow two parties to locally generate a large amount of correlated randomness, such as Oblivious Transfer (OT) correlations, using short correlated keys. These correlations can then be used to significantly speed up secure computation protocols. In this talk, we build on the recent approach of constructing PCFs for OT from Constrained Pseudorandom Functions (CPRFs). CPRFs are pseudorandom functions where a constrained key allows the evaluation of the function only on a specific subset of inputs. We show some instantiations of this framework in the post-quantum regime, from lattices and isogenies. Our lattice-based PCF, which further allows a public-key setup, offers relatively high throughput, i.e., several hundred OTs per second. However, it requires megabyte-sized public keys and gigabyte-sized PCF keys. In contrast, our isogeny-based PCF is highly compact and has keys in the 100 kB range, while generating around 7 OTs per second.