Threshold schemes from isogeny assumptions
From MaRDI portal
Publication:2055691
DOI10.1007/978-3-030-45388-6_7zbMath1481.94095OpenAlexW3022851301MaRDI QIDQ2055691
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45388-6_7
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items
CSIDH on the Surface ⋮ On the Security of OSIDH ⋮ Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption ⋮ SCALLOP: scaling the CSI-FiSh ⋮ Generic models for group actions ⋮ Disorientation faults in CSIDH ⋮ Full quantum equivalence of group action DLog and CDH, and more ⋮ On actively secure fine-grained access structures from isogeny assumptions ⋮ Cryptographic group actions and applications ⋮ On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves ⋮ \textsf{CSI-RAShi}: distributed key generation for CSIDH
Cites Work
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- Expander graphs based on GRH with an application to elliptic curve cryptography
- On Lovász' lattice reduction and the nearest lattice point problem
- Towards practical key exchange from ordinary isogeny graphs
- CSIDH: an efficient post-quantum commutative group action
- A faster way to the CSIDH
- A note on the security of CSIDH
- Sharing the LUOV: threshold post-quantum signatures
- CSI-FiSh: efficient isogeny based signatures through class group computations
- Stronger and faster side-channel protections for CSIDH
- SeaSign: compact isogeny signatures from class group actions
- Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies
- Finding closest lattice vectors using approximate Voronoi cells
- Faster SeaSign signatures through improved rejection sampling
- On Lions and elligators: an efficient constant-time implementation of CSIDH
- Robust Threshold DSS Signatures
- Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- How to share a secret
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- A public key cryptosystem and a signature scheme based on discrete logarithms
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Group-oriented (t, n) threshold digital signature scheme and digital multisignature
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
