Practical isogeny-based key-exchange with optimal tightness

DOI10.1007/978-3-030-81652-0_18zbMath1485.94079OpenAlexW3202116954MaRDI QIDQ832367

Mattia Veroni, Kristian Gjøsteen, Bor de Kock

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81652-0_18

zbMATH Keywords

tightnesskey-exchangeisogeniespost-quantumprovable-securityre-randomization

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (7)

An efficient and generic construction for signal's handshake (X3DH): post-quantum, state leakage secure, and deniable ⋮ Generic models for group actions ⋮ Password-authenticated key exchange from group actions ⋮ Group action key encapsulation and non-interactive key exchange in the QROM ⋮ Post-quantum asynchronous deniable key exchange and the signal handshake ⋮ Post-quantum anonymous one-sided authenticated key exchange without random oracles ⋮ Lattice-based authenticated key exchange with tight security

Uses Software

• HMQV
• NAXOS
• SeaSign

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient authenticated key exchange from random self-reducibility on CSIDH
• CSIDH: an efficient post-quantum commutative group action
• Strongly secure authenticated key exchange from supersingular isogenies
• SeaSign: compact isogeny signatures from class group actions
• Highly efficient key exchange protocols with optimal tightness
• Die Typen der Multiplikatorenringe elliptischer Funktionenkörper
• On the Security of the TLS Protocol: A Systematic Analysis
• Proving the TLS Handshake Secure (As It Is)
• On the Security of TLS-DHE in the Standard Model
• On the evaluation of modular polynomials
• Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A Rigorous Subexponential Algorithm For Computation of Class Groups
• Stronger Security of Authenticated Key Exchange
• The Arithmetic of Elliptic Curves
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• HMQV: A High-Performance Secure Diffie-Hellman Protocol
• On the Impossibility of Tight Cryptographic Reductions
• Public Key Cryptography - PKC 2006

This page was built for publication: Practical isogeny-based key-exchange with optimal tightness