A post-quantum round-optimal oblivious PRF from isogenies
From MaRDI portal
Publication:6620041
DOI10.1007/978-3-031-53368-6_8zbMATH Open1547.94316MaRDI QIDQ6620041
Publication date: 16 October 2024
Cites Work
- Title not available (Why is that?)
- Another look at some isogeny hardness assumptions
- Cryptographic hash functions from expander graphs
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- Oblivious pseudorandom functions from isogenies
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Theory of Cryptography
- Supersingular curves you can trust
- M-SIDH and MD-SIDH: countering SIDH attacks by masking information
- An efficient key recovery attack on SIDH
- A direct key recovery attack on SIDH
- Breaking SIDH in polynomial time
- Cryptanalysis of an oblivious PRF from supersingular isogenies
- TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF
This page was built for publication: A post-quantum round-optimal oblivious PRF from isogenies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6620041)
