Compact, efficient and UC-secure isogeny-based oblivious transfer
From MaRDI portal
Publication:2056684
DOI10.1007/978-3-030-77870-5_8zbMath1479.94207OpenAlexW3082533815MaRDI QIDQ2056684
Yi-Fu Lai, Steven D. Galbraith, Cyprien Delpech De Saint Guilhem
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77870-5_8
Related Items
On the Security of OSIDH, Supersingular curves you can trust, Round-optimal oblivious transfer and MPC from computational CSIDH, Disorientation faults in CSIDH, Password-authenticated key exchange from group actions, Statistical security in two-party computation revisited, Horizontal racewalking using radical isogenies, Full quantum equivalence of group action DLog and CDH, and more, Two-round adaptively secure MPC from isogenies, LPN, or CDH, Attack on SHealS and HealS: the second wave of GPST, Group signatures and more from isogenies and lattices: generic, simple, and efficient, Compact, efficient and UC-secure isogeny-based oblivious transfer, On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient secure two-party protocols. Techniques and constructions
- CSIDH: an efficient post-quantum commutative group action
- Security and composition of multiparty cryptographic protocols
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Two-round oblivious transfer from CDH or LPN
- Simple oblivious transfer protocols compatible with supersingular isogenies
- CSI-FiSh: efficient isogeny based signatures through class group computations
- SeaSign: compact isogeny signatures from class group actions
- On Lions and elligators: an efficient constant-time implementation of CSIDH
- Cryptographic group actions and applications
- The Simplest Protocol for Oblivious Transfer
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- Fast quantum algorithms for computing the unit group and class group of a number field
- A Framework for Efficient and Composable Oblivious Transfer
- Foundations of Cryptography
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions
- Efficient Fully-Simulatable Oblivious Transfer
- Oblivious Transfer Based on the McEliece Assumptions
- Faster computation of isogenies of large prime degree
