Cryptanalysis of an oblivious PRF from supersingular isogenies
From MaRDI portal
Publication:6157490
DOI10.1007/978-3-030-92062-3_6zbMath1514.94037OpenAlexW3174055219MaRDI QIDQ6157490
Christophe Petit, Péter Kutas, Simon-Philipp Merz, Antonio Sanso, Andrea Basso
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/339002/3/2021-706.pdf
Related Items (2)
Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ M-SIDH and MD-SIDH: countering SIDH attacks by masking information
Cites Work
- Unnamed Item
- Another look at some isogeny hardness assumptions
- Cryptographic hash functions from expander graphs
- Parallel collision search with cryptanalytic applications
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- CSIDH: an efficient post-quantum commutative group action
- Delay encryption
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- Rational isogenies from irrational endomorphisms
- Improved torsion-point attacks on SIDH variants
- Oblivious pseudorandom functions from isogenies
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- On the Security of Supersingular Isogeny Cryptosystems
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- The Arithmetic of Elliptic Curves
- Theory of Cryptography
- Supersingular curves with small noninteger endomorphisms
This page was built for publication: Cryptanalysis of an oblivious PRF from supersingular isogenies